標(biāo)題: Titlebook: Web-Age Information Management; 12th International C Haixun Wang,Shijun Li,Tieyun Qian Conference proceedings 2011 The Editor(s) (if applic [打印本頁] 作者: 神像之光環(huán) 時間: 2025-3-21 19:01
書目名稱Web-Age Information Management影響因子(影響力)
書目名稱Web-Age Information Management影響因子(影響力)學(xué)科排名
書目名稱Web-Age Information Management網(wǎng)絡(luò)公開度
書目名稱Web-Age Information Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Web-Age Information Management被引頻次
書目名稱Web-Age Information Management被引頻次學(xué)科排名
書目名稱Web-Age Information Management年度引用
書目名稱Web-Age Information Management年度引用學(xué)科排名
書目名稱Web-Age Information Management讀者反饋
書目名稱Web-Age Information Management讀者反饋學(xué)科排名
作者: 灌溉 時間: 2025-3-21 22:49
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/w/image/1021730.jpg作者: AVID 時間: 2025-3-22 02:26 作者: indigenous 時間: 2025-3-22 08:17
978-3-642-23534-4The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer-Verlag GmbH, DE作者: 身體萌芽 時間: 2025-3-22 10:20 作者: DUST 時間: 2025-3-22 14:30 作者: Pelago 時間: 2025-3-22 17:23 作者: glans-penis 時間: 2025-3-22 21:51
General-Purpose Ontology Enrichment from the WWW missing background knowledge, and thus, enabling the reuse of such knowledge in future. (.) saving time and effort required to manually enrich and update the ontologies. Experimental results indicate that the techniques used to enrich ontologies are both effective and efficient.作者: INCH 時間: 2025-3-23 01:46 作者: Culmination 時間: 2025-3-23 08:13
General-Purpose Ontology Enrichment from the WWW missing background knowledge, and thus, enabling the reuse of such knowledge in future. (.) saving time and effort required to manually enrich and update the ontologies. Experimental results indicate that the techniques used to enrich ontologies are both effective and efficient.作者: 拒絕 時間: 2025-3-23 12:19
Getting Critical Categories of a Data Set categories can be treated as a probabilistic data set. In this paper, we devise a novel method to handle this issue. Analysis in theorem and experimental results show the effectiveness and efficiency of the proposed method.作者: STERN 時間: 2025-3-23 15:40
QuerySem: Deriving Query Semantics Based on Multiple Ontologiesed by multiple large-scale general-purpose ontologies to derive the semantic aspects of the user’s query. In addition, we utilize statistical-based semantic relatedness measures to compensate for missing background knowledge in the exploited ontologies. Experimental instantiation of the proposed system validates our proposal.作者: 索賠 時間: 2025-3-23 21:09
MFCluster: Mining Maximal Fault-Tolerant Constant Row Biclusters in Microarray Datasetenerates a weighted undirected relational graph firstly. Then all the maximal fault-tolerant biclusters would be mined by using pattern-growth method in above graph. The experimental results show our algorithm is more efficiently than traditional ones.作者: inventory 時間: 2025-3-24 01:24 作者: 大雨 時間: 2025-3-24 02:24 作者: 毛細(xì)血管 時間: 2025-3-24 07:13
MFCluster: Mining Maximal Fault-Tolerant Constant Row Biclusters in Microarray Datasetenerates a weighted undirected relational graph firstly. Then all the maximal fault-tolerant biclusters would be mined by using pattern-growth method in above graph. The experimental results show our algorithm is more efficiently than traditional ones.作者: Alpha-Cells 時間: 2025-3-24 11:48 作者: Gastric 時間: 2025-3-24 16:49
Probabilistic Threshold Join over Distributed Uncertain Dataery with communication efficiency. Furthermore, we provide theoretical analysis of the network cost of our algorithm and demonstrate it by simulation. The experiment results show that our algorithm can save network cost efficiently by comparing to original Bloomjoin algorithm in most scenarios.作者: 皺痕 時間: 2025-3-24 21:17 作者: Condyle 時間: 2025-3-25 02:08 作者: INCH 時間: 2025-3-25 06:58 作者: organic-matrix 時間: 2025-3-25 10:26 作者: 哥哥噴涌而出 時間: 2025-3-25 14:42 作者: Cumulus 時間: 2025-3-25 18:57
Leveraging Communication Information among Readers for RFID Data Cleaningse positive readings and data interpolating. To the best of our knowledge, this is the first work utilizing the communication information among readers in RFID data cleaning. We conduct extensive experiments, and the experimental results demonstrate the feasibility and effectiveness of our methods.作者: 慷慨不好 時間: 2025-3-25 21:00 作者: Decline 時間: 2025-3-26 00:54 作者: 健壯 時間: 2025-3-26 05:18 作者: 同步信息 時間: 2025-3-26 10:20
Data-Driven Modeling and Analysis of Online Social Networkshange, and individual entertainment and enhancement in a wide variety of forms. In light of these notable outcomes, understanding information diffusion over online social networks is a critical research goal. Because many social interactions currently take place in online networks, we now have have 作者: ineffectual 時間: 2025-3-26 13:20
Efficient Filter Algorithms for Reverse k-Nearest Neighbor Queryer-refinement) R.NN processing. However, for a large ., the amount of calculation becomes very heavy, especially in the filter step. This is not acceptable for most mobile devices. A new filter strategy called BRC is proposed to deal with the filter step for R.NN queries. There are two pruning heuri作者: 草本植物 時間: 2025-3-26 18:11 作者: Encumber 時間: 2025-3-26 21:26
Keyword Query Cleaning with Query Logskeyword query processing. In addition, the keywords in a given query often form natural segments. For example, the query “Tom Hanks Green Mile” can be considered as consisting of two segments, “Tom Hanks” and “Green Mile”. The goal of keyword query cleaning is to identify the optimal segmentation of作者: legitimate 時間: 2025-3-27 05:04 作者: maverick 時間: 2025-3-27 05:26
A Self-adaptive Cross-Domain Query Approach on the Deep Webtion of pairs of domains, when we do some queries involving multiple domains, such as “find a post named software development engineer on job web and look for apartments for rental around the company having been chosen”, we note that general-purpose search engines and general integration frameworks 作者: 領(lǐng)巾 時間: 2025-3-27 10:17
Data-Driven Modeling and Analysis of Online Social Networkshange, and individual entertainment and enhancement in a wide variety of forms. In light of these notable outcomes, understanding information diffusion over online social networks is a critical research goal. Because many social interactions currently take place in online networks, we now have have 作者: Rankle 時間: 2025-3-27 14:46 作者: 嘴唇可修剪 時間: 2025-3-27 18:32
Efficient Filter Algorithms for Reverse k-Nearest Neighbor Queryer-refinement) R.NN processing. However, for a large ., the amount of calculation becomes very heavy, especially in the filter step. This is not acceptable for most mobile devices. A new filter strategy called BRC is proposed to deal with the filter step for R.NN queries. There are two pruning heuri作者: AMBI 時間: 2025-3-28 01:40
Probabilistic Threshold Join over Distributed Uncertain Dataquerying uncertain data in distributed environment have only focus on ranking and skyline, join queries have not been addressed in earlier work despite their importance in databases. In this paper, we address distributed probabilistic threshold join query, which retrieves results satisfying the join作者: 運氣 時間: 2025-3-28 03:09
Keyword Query Cleaning with Query Logskeyword query processing. In addition, the keywords in a given query often form natural segments. For example, the query “Tom Hanks Green Mile” can be considered as consisting of two segments, “Tom Hanks” and “Green Mile”. The goal of keyword query cleaning is to identify the optimal segmentation of作者: Dealing 時間: 2025-3-28 09:23 作者: archenemy 時間: 2025-3-28 13:18 作者: antipsychotic 時間: 2025-3-28 17:20
SPARQL Query Answering with RDFS Reasoning on Correlated Probabilistic Datailistic knowledge. The probabilistic knowledge encoded by these models ranges from statistical relationships over possible objects of an RDF triple to relationships among correlated triples. The types of queries executed on these models vary from single triple patterns to complex graph patterns writ作者: 散開 時間: 2025-3-28 22:12 作者: 轉(zhuǎn)向 時間: 2025-3-28 23:07 作者: agonist 時間: 2025-3-29 05:24 作者: 無能力之人 時間: 2025-3-29 07:53 作者: Longitude 時間: 2025-3-29 15:09 作者: 嬉耍 時間: 2025-3-29 18:03
Measuring Social Tag Confidence: Is It a Good or Bad Tag?nce of information retrieval system. However, there also has been significant variance of the quality of social tags because they can be annotated by folks on the web freely. As a consequence, how to measure the quality of social tags (referred to as social tag confidence) becomes an important issue作者: 百科全書 時間: 2025-3-29 22:45
Incremental Reasoning over Multiple Ontologiesning. In order to reduce query response time, inferred results often need to be pre-computed and materialized. However, this approach faces the great challenge when data is updated, since the repositories need to perform reasoning from scratch to guarantee the consistency of the inferred results. Th作者: GRILL 時間: 2025-3-30 03:45 作者: 步履蹣跚 時間: 2025-3-30 04:05 作者: 喪失 時間: 2025-3-30 09:22 作者: 切碎 時間: 2025-3-30 13:58 作者: 音樂學(xué)者 時間: 2025-3-30 17:04 作者: Lament 時間: 2025-3-30 21:42
General-Purpose Ontology Enrichment from the WWWpecific domain. In this paper we present an automatic statistical/semantic framework for enriching general-purpose ontologies from the World Wide Web (WWW). Using the massive amount of information encoded in texts on the web as a corpus, missing background knowledge such as concepts, instances and r作者: Left-Atrium 時間: 2025-3-31 04:08 作者: jumble 時間: 2025-3-31 05:33
QuerySem: Deriving Query Semantics Based on Multiple Ontologieskeyword-based indexing techniques to index Web Pages. Although this approach assist users in finding information on the Web, many of the returned results are irrelevant to the user’s information needs. This is because of the “semantic-gap” between the meanings of the keywords that are used to index 作者: frivolous 時間: 2025-3-31 09:24
MFCluster: Mining Maximal Fault-Tolerant Constant Row Biclusters in Microarray Datasetver, due to the influence of experimental noise in the microarray dataset, using traditional biclustering methods may neglect some significative biological biclusters. In order to reduce the influence of noise and find more types of biological biclusters, we propose an algorithm, ., to mine fault-to作者: Directed 時間: 2025-3-31 15:14
Getting Critical Categories of a Data Setting work on ranking query focuses on getting top-. high-score tuples from a data set, this paper focuses on getting top-. critical categories from a data set, where each category is a data item in the nominal attribute or a combination of data items from more than one nominal attribute. To describe作者: 歡呼 時間: 2025-3-31 21:02
Expansion Finding for Given Acronyms Using Conditional Random Fieldsthe task of finding expansions in texts for given acronym queries. We formulate the expansion finding problem as a sequence labeling task and use Conditional Random Fields to solve it. Since it is a complex task, our method tries to enhance the performance from two aspects. First,we introduce nonlin作者: Cleave 時間: 2025-4-1 00:28
MFCluster: Mining Maximal Fault-Tolerant Constant Row Biclusters in Microarray Datasetver, due to the influence of experimental noise in the microarray dataset, using traditional biclustering methods may neglect some significative biological biclusters. In order to reduce the influence of noise and find more types of biological biclusters, we propose an algorithm, ., to mine fault-to作者: motor-unit 時間: 2025-4-1 03:52
Leveraging Communication Information among Readers for RFID Data Cleaningality due to frequent occurrences of false negative, false positive and duplicate readings. A number of RFID data cleaning techniques are proposed to solve the problem. In this paper we explore to use communication information for RFID data cleaning and make RFID readers produce less dirty data at t作者: Systemic 時間: 2025-4-1 08:26
Expansion Finding for Given Acronyms Using Conditional Random Fieldsthe task of finding expansions in texts for given acronym queries. We formulate the expansion finding problem as a sequence labeling task and use Conditional Random Fields to solve it. Since it is a complex task, our method tries to enhance the performance from two aspects. First,we introduce nonlin作者: 滔滔不絕地說 時間: 2025-4-1 12:08 作者: oblique 時間: 2025-4-1 17:23 作者: invade 時間: 2025-4-1 22:33
0302-9743 anized in topical sections on query processing, uncertain data, social media, semantics, data mining, cloud data, multimedia data, user models, data management, graph data, name disambiguation,? performance, temporal data, XML, spatial data and event detection..978-3-642-23534-4978-3-642-23535-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 留戀 時間: 2025-4-2 01:26 作者: 美學(xué) 時間: 2025-4-2 04:45
Efficient Filter Algorithms for Reverse k-Nearest Neighbor Querytable for most mobile devices. A new filter strategy called BRC is proposed to deal with the filter step for R.NN queries. There are two pruning heuristics in BRC. The experiments show that the processing time of BRC is still acceptable for most mobile devices when . is large. And we extend the BRC to the continuous R.NN queries.作者: AVOID 時間: 2025-4-2 07:54
Efficient Filter Algorithms for Reverse k-Nearest Neighbor Querytable for most mobile devices. A new filter strategy called BRC is proposed to deal with the filter step for R.NN queries. There are two pruning heuristics in BRC. The experiments show that the processing time of BRC is still acceptable for most mobile devices when . is large. And we extend the BRC to the continuous R.NN queries.作者: 吵鬧 時間: 2025-4-2 13:44
Conference proceedings 2011and selected from a total of 181 submissions. The papers are organized in topical sections on query processing, uncertain data, social media, semantics, data mining, cloud data, multimedia data, user models, data management, graph data, name disambiguation,? performance, temporal data, XML, spatial data and event detection..作者: gruelling 時間: 2025-4-2 17:59
Analytics for Info-plosion Including Information Diffusion Studies for the 3.11 Disasterntury. This causes so called information overload. Although there are such negative problems, we could think that this is a first experience for human being to see such a vast amount of information. Taking advantage of such a totally new opportunity, we believe various disruptive services could be i作者: Orchiectomy 時間: 2025-4-2 22:45
Using the Web for Collaborative Language Learning and Teachingnslation system ., which has the big advantage that it learns translation rules automatically from bilingual corpora. The acquisition process is performed by parsing source and target sentences, retrieving word translations of Japanese content words from lexical resources, mapping the content words 作者: 皮薩 時間: 2025-4-3 03:34
Data-Driven Modeling and Analysis of Online Social Networksale and at a level of detail that has never before been possible..We present an integrated approach to information diffusion in online social networks focusing on three key problems: (1) Querying and analysis of online social network datasets; (2) Modeling and analysis of social networks; and (3) An作者: 加花粗鄙人 時間: 2025-4-3 04:11 作者: PANG 時間: 2025-4-3 11:52 作者: 交響樂 時間: 2025-4-3 15:53
