標(biāo)題: Titlebook: Web and Big Data; First International Lei Chen,Christian S. Jensen,Xiang Lian Conference proceedings 2017 Springer International Publishin [打印本頁] 作者: Lensometer 時(shí)間: 2025-3-21 19:28
書目名稱Web and Big Data影響因子(影響力)
書目名稱Web and Big Data影響因子(影響力)學(xué)科排名
書目名稱Web and Big Data網(wǎng)絡(luò)公開度
書目名稱Web and Big Data網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Web and Big Data被引頻次
書目名稱Web and Big Data被引頻次學(xué)科排名
書目名稱Web and Big Data年度引用
書目名稱Web and Big Data年度引用學(xué)科排名
書目名稱Web and Big Data讀者反饋
書目名稱Web and Big Data讀者反饋學(xué)科排名
作者: 客觀 時(shí)間: 2025-3-21 21:45
Semantic-Aware Partitioning on RDF Graphsovel partitioning algorithm is proposed, which leverages the semantic information of RDF and reduces crossing edges between different fragments. The extensive experiments on both synthetic and real-world datasets show that our semantic-aware RDF graph partitioning outperforms the state-of-the-art methods by a large margin.作者: explicit 時(shí)間: 2025-3-22 03:47 作者: 記憶法 時(shí)間: 2025-3-22 05:55
0302-9743 ining and data streams; query processing; topic modeling; machine learning; recommendation systems; distributed data processing and applications; machine learning and optimization..978-3-319-63578-1978-3-319-63579-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 致命 時(shí)間: 2025-3-22 09:12
TrajSpark: A Scalable and Efficient In-Memory Management System for Big Trajectory Datahen new batch of data arrives. Extensive experiments of three types of trajectory queries on both real and synthetic dataset demonstrate that the performance of TrajSpark outperforms state-of-the-art systems.作者: 別名 時(shí)間: 2025-3-22 16:03 作者: fixed-joint 時(shí)間: 2025-3-22 19:47 作者: G-spot 時(shí)間: 2025-3-22 22:23
A Local-Global LDA Model for Discovering Geographical Topics from Social Mediach is currently the most popular micro-blogging service for Chinese. The evaluation results demonstrate that our method outperforms other baseline methods in several metrics such as model perplexity, two kinds of entropies and KL-divergence of discovered topics.作者: 發(fā)芽 時(shí)間: 2025-3-23 01:37 作者: 煉油廠 時(shí)間: 2025-3-23 07:53 作者: colloquial 時(shí)間: 2025-3-23 10:41 作者: ATP861 時(shí)間: 2025-3-23 14:42 作者: 關(guān)節(jié)炎 時(shí)間: 2025-3-23 20:44 作者: 凝乳 時(shí)間: 2025-3-24 00:35 作者: 微枝末節(jié) 時(shí)間: 2025-3-24 03:39 作者: Inkling 時(shí)間: 2025-3-24 09:44 作者: 牛的細(xì)微差別 時(shí)間: 2025-3-24 12:14 作者: 消毒 時(shí)間: 2025-3-24 16:44
Keyphrase Extraction Using Knowledge Graphsd on which we could detect the latent relations of two keyterms (i.e., noun words and named entities) without introducing many noises. Extensive experiments over real data show that our method outperforms the state-of-art methods including the graph-based co-occurrence methods and statistic-based clustering methods.作者: BRIEF 時(shí)間: 2025-3-24 21:44 作者: Blood-Vessels 時(shí)間: 2025-3-25 01:15
An Ontology-Based Latent Semantic Indexing Approach Using Long Short-Term Memory Networksncode the above two levels of features and match their embedding vectors utilizing LSTM networks. Finally, the experimental results reveal that LSTM-OLSI outperforms existing techniques and demonstrates deep comprehension of instances and articles.作者: debris 時(shí)間: 2025-3-25 05:55
Meta Paths and Meta Structures: Analysing Large Heterogeneous Information NetworksAGO and DBLP, can be modeled as HINs. A fundamental problem in HINs is the computation of closeness, or relevance, between two HIN objects. Relevance measures, such as PCRW, PathSim, and HeteSim, can be used in various applications, including information retrieval, entity resolution, and product rec作者: 裂口 時(shí)間: 2025-3-25 09:13
Meta Paths and Meta Structures: Analysing Large Heterogeneous Information NetworksAGO and DBLP, can be modeled as HINs. A fundamental problem in HINs is the computation of closeness, or relevance, between two HIN objects. Relevance measures, such as PCRW, PathSim, and HeteSim, can be used in various applications, including information retrieval, entity resolution, and product rec作者: cancellous-bone 時(shí)間: 2025-3-25 15:38
TrajSpark: A Scalable and Efficient In-Memory Management System for Big Trajectory Datarovide scalable and low latency query services any more. In view of that, we present TrajSpark, a distributed in-memory system to consistently offer efficient management of trajectory data. TrajSpark introduces a new abstraction called IndexTRDD to manage trajectory segments, and exploits a global a作者: Affection 時(shí)間: 2025-3-25 19:23 作者: 生來 時(shí)間: 2025-3-25 20:24 作者: 比目魚 時(shí)間: 2025-3-26 01:20 作者: 生來 時(shí)間: 2025-3-26 06:46
Team-Oriented Task Planning in Spatial Crowdsourcing gMission and Gigwalk, are becoming increasingly important in our daily life. A core functionality of spatial crowdsourcing platforms is to allocate tasks or make plans for workers to efficiently finish the published tasks. However, existing studies usually ignore the fact that tasks may impose diff作者: neoplasm 時(shí)間: 2025-3-26 10:24 作者: 評論性 時(shí)間: 2025-3-26 16:39
Negative Survey with Manual Selection: A Case Study in Chinese Universitiesvey models with specific hypothesis, e.g., the probability of selecting negative categories follows the uniform distribution or Gaussian distribution. Moreover, as far as we know, negative survey is never conducted with manual selection in real world. In this paper, we carry out such a negative surv作者: 沉思的魚 時(shí)間: 2025-3-26 20:28 作者: 知識(shí)分子 時(shí)間: 2025-3-27 00:10
Element-Oriented Method of Assessing Landscape of Sightseeing Spots by Using Social Images In this paper, we propose an element-oriented method of landscape assessment that analyzes images available on image-sharing web sites. The experimental results demonstrate that our method is superior to the existing ones based on low-level visual features and user behavior analysis.作者: sundowning 時(shí)間: 2025-3-27 04:56
Element-Oriented Method of Assessing Landscape of Sightseeing Spots by Using Social Images In this paper, we propose an element-oriented method of landscape assessment that analyzes images available on image-sharing web sites. The experimental results demonstrate that our method is superior to the existing ones based on low-level visual features and user behavior analysis.作者: GRILL 時(shí)間: 2025-3-27 07:50 作者: 傾聽 時(shí)間: 2025-3-27 10:42
Sifting Truths from Multiple Low-Quality Data Sourcesvalues from them. It is a critical part of an effective data integration solution. In order to solve this problem, we first propose a model to specify the tuple quality. Then we present a framework to infer the tuple quality based on the concept of .. In particular, we propose an algorithm underlyin作者: miracle 時(shí)間: 2025-3-27 17:21 作者: G-spot 時(shí)間: 2025-3-27 19:16 作者: 小步走路 時(shí)間: 2025-3-28 01:22
Time-Constrained Graph Pattern Matching in a Large Temporal Graphh is contrary to the fact that graphs in real life are intrinsically dynamic. Therefore, in this paper, we propose a new problem of Time-Constrained Graph Pattern Matching (TCGPM) in a large temporal graph. Different from traditional work, our work deals with temporal graphs rather than a series of 作者: aggravate 時(shí)間: 2025-3-28 05:48
Time-Constrained Graph Pattern Matching in a Large Temporal Graphh is contrary to the fact that graphs in real life are intrinsically dynamic. Therefore, in this paper, we propose a new problem of Time-Constrained Graph Pattern Matching (TCGPM) in a large temporal graph. Different from traditional work, our work deals with temporal graphs rather than a series of 作者: Herbivorous 時(shí)間: 2025-3-28 10:11 作者: 說笑 時(shí)間: 2025-3-28 12:51
Efficient Compression on Real World Directed Graphstion of graph computation very challenging. Reducing graph size to fit in memory, for example by using the technique of lossless compression, is crucial in cutting the cost of large scale graph computation. Unfortunately, literature work on graph compression still suffers from issues including low c作者: Basal-Ganglia 時(shí)間: 2025-3-28 17:35
Keyphrase Extraction Using Knowledge GraphsAlthough lots of efforts have been made on keyphrase extraction, most of the existing methods (the co-occurrence based methods and the statistic-based methods) do not take semantics into full consideration. The co-occurrence based methods heavily depend on the co-occurrence relations between two wor作者: conspicuous 時(shí)間: 2025-3-28 20:02
Keyphrase Extraction Using Knowledge GraphsAlthough lots of efforts have been made on keyphrase extraction, most of the existing methods (the co-occurrence based methods and the statistic-based methods) do not take semantics into full consideration. The co-occurrence based methods heavily depend on the co-occurrence relations between two wor作者: CIS 時(shí)間: 2025-3-29 00:02
Semantic-Aware Partitioning on RDF Graphsficiently process complex queries on RDF graphs. It becomes necessary to use a distributed cluster to store and process large-scale RDF datasets that are required to be partitioned. In this paper, we propose a . method for RDF graphs. Inspired by the . algorithm, classes in the RDF . are ranked. A n作者: Graves’-disease 時(shí)間: 2025-3-29 06:38
Semantic-Aware Partitioning on RDF Graphsficiently process complex queries on RDF graphs. It becomes necessary to use a distributed cluster to store and process large-scale RDF datasets that are required to be partitioned. In this paper, we propose a . method for RDF graphs. Inspired by the . algorithm, classes in the RDF . are ranked. A n作者: 描述 時(shí)間: 2025-3-29 07:56
An Incremental Algorithm for Estimating Average Clustering Coefficient Based on Random Walko compute clustering coefficient for the real-world networks, because many networks, such as Facebook and Twitter, are usually large and evolving continuously. Aiming to improve the performance of clustering coefficient computation for the large and evolving networks, we propose an incremental algor作者: 記憶 時(shí)間: 2025-3-29 12:15 作者: BLA 時(shí)間: 2025-3-29 16:16 作者: Climate 時(shí)間: 2025-3-29 21:03
Deep Multi-label Hashing for Large-Scale Visual Search Based on Semantic Graphhem with their friends. Accordingly, visual search from large scale image databases is getting more and more important. Hashing is an efficient technique to large-scale visual content search, and learning-based hashing approaches have achieved great success due to recent advancements of deep learnin作者: 道學(xué)氣 時(shí)間: 2025-3-30 00:35 作者: 使聲音降低 時(shí)間: 2025-3-30 07:40
An Ontology-Based Latent Semantic Indexing Approach Using Long Short-Term Memory Networkseen widely used to optimize performance. However, researchers are placing increased emphasis on internal relations of ontologies but neglect latent semantic relations between ontologies and documents. They generally annotate instances mentioned in documents, which are related to concepts in ontologi作者: Evolve 時(shí)間: 2025-3-30 10:41 作者: 象形文字 時(shí)間: 2025-3-30 13:02
0302-9743 International Joint Conference, APWeb-WAIM 2017, held in Beijing, China in July 2017...The 44 full papers presented together with 32 short papers and 10 demonstrations papers were carefully reviewed and selected from 240 submissions. The papers are organized around the following topics: spatial data作者: Ige326 時(shí)間: 2025-3-30 20:03
Sifting Truths from Multiple Low-Quality Data Sources the tuple quality. Then we present a framework to infer the tuple quality based on the concept of .. In particular, we propose an algorithm underlying the framework to find true values for each attribute. Last, we have conducted extensive experiments on real-life data to verify the effectiveness and efficiency of our methods.作者: 溫和女孩 時(shí)間: 2025-3-30 21:20 作者: noxious 時(shí)間: 2025-3-31 01:59 作者: 不愛防注射 時(shí)間: 2025-3-31 05:00
the same level of abstraction. Finally we show from an example how a test purpose resulting from an abstract IOSTS-model can be concretized in a test purpose defined at the abstraction level of the SUT.作者: 惹人反感 時(shí)間: 2025-3-31 11:57 作者: 似少年 時(shí)間: 2025-3-31 15:07 作者: visceral-fat 時(shí)間: 2025-3-31 20:54
Zhigang Zhang,Cheqing Jin,Jiali Mao,Xiaolin Yang,Aoying Zhoumpted to copy exactly the movements of active children at play, but the athletes have had to give up. One important reason was mentioned by Steffney (1983) in the Danish newspaper .; he stated that “on average an 11-year-old child weighs 42 kg and has a heart volume of 442 cc. The 16-year-old weighs 72 kg but only has a heart volume of 540 cc.”作者: 保守黨 時(shí)間: 2025-3-31 23:53
Siwei Qiang,Yongkun Wang,Yaohui Jinhe resulting Python code allows to test the behavior of cars following the motion model of RSS in simulation, to measure agreement between the model and simulation with monitors that are derived from the formal model, and to report counterexamples from simulation back to the formal model.作者: 充氣女 時(shí)間: 2025-4-1 05:45
Dawei Gao,Yongxin Tong,Yudian Ji,Ke Xuon of . uses parallelisation techniques that significantly improve its performance. The results presented here are encouraging, showing performance numbers that are one order of magnitude better than the ones obtained in the tool’s previous version.作者: ANA 時(shí)間: 2025-4-1 06:27
Yizhu Shen,Chenyi Zhuang,Qiang Ma emergence of model checking has been one of the ?rst signs that contradiction may yield to complementarity, but in the past few years an increasing number of r978-3-642-02948-6978-3-642-02949-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 摸索 時(shí)間: 2025-4-1 12:31 作者: nutrition 時(shí)間: 2025-4-1 14:40 作者: infatuation 時(shí)間: 2025-4-1 21:29
Yanxia Xu,Jinjing Huang,An Liu,Zhixu Li,Hongzhi Yin,Lei Zhaor Anforderungen die Kosten je Testerkanal nicht steigen und die Komplexit?t der Schaltungstests weitgehend erhalten bleibt. Damit werden Testsysteme zu den kostenintensivsten Ausrüstungsgegenst?nden einer IC-Fabrik. Testfreundlicher Entwurf ist das Bemühen durch geeignete Ma?nahmen auf dem IC dieser Situation entgegenzuwirken.作者: EPT 時(shí)間: 2025-4-2 00:34 作者: 使入迷 時(shí)間: 2025-4-2 05:50
Qiang Xu,Xin Wang,Junhu Wang,Yajun Yang,Zhiyong Fengy for several scholarly purposes: suggestions are made concerning the need for programmatic testing, for refinement, and for extension of the encoding model to support a broader range of text-transmission phenomena and research objectives.作者: 歸功于 時(shí)間: 2025-4-2 08:17 作者: 運(yùn)動(dòng)的我 時(shí)間: 2025-4-2 11:44 作者: 胰臟 時(shí)間: 2025-4-2 16:51 作者: infinite 時(shí)間: 2025-4-2 23:08 作者: 消極詞匯 時(shí)間: 2025-4-3 01:28 作者: 禁止 時(shí)間: 2025-4-3 06:11 作者: Cardiac-Output 時(shí)間: 2025-4-3 10:45 作者: 公豬 時(shí)間: 2025-4-3 12:10
