標(biāo)題: Titlebook: Advances in Web-Age Information Management; 6th International Co Wenfei Fan,Zhaohui Wu,Jun Yang Conference proceedings 2005 Springer-Verlag [打印本頁] 作者: 挑染 時(shí)間: 2025-3-21 19:13
書目名稱Advances in Web-Age Information Management影響因子(影響力)
書目名稱Advances in Web-Age Information Management影響因子(影響力)學(xué)科排名
書目名稱Advances in Web-Age Information Management網(wǎng)絡(luò)公開度
書目名稱Advances in Web-Age Information Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Web-Age Information Management被引頻次
書目名稱Advances in Web-Age Information Management被引頻次學(xué)科排名
書目名稱Advances in Web-Age Information Management年度引用
書目名稱Advances in Web-Age Information Management年度引用學(xué)科排名
書目名稱Advances in Web-Age Information Management讀者反饋
書目名稱Advances in Web-Age Information Management讀者反饋學(xué)科排名
作者: 仔細(xì)閱讀 時(shí)間: 2025-3-21 20:28 作者: 偏見 時(shí)間: 2025-3-22 01:13 作者: 數(shù)量 時(shí)間: 2025-3-22 06:23 作者: graphy 時(shí)間: 2025-3-22 12:07 作者: Erythropoietin 時(shí)間: 2025-3-22 14:43
Challenges of Grid Computingopment and usage of grid computing are listed. The purpose of this talk tries to point out that grid computing still has long way to go to be more accepted not only by scientists but also by ordinary end users.作者: 高談闊論 時(shí)間: 2025-3-22 19:12 作者: Arb853 時(shí)間: 2025-3-23 01:18
An Approach to RDF(S) Query, Manipulation and Inference on Databaseserful RDF(S) query and manipulation language RQML is provided for easy and uniform data access in a declarative way. Finally, we evaluate and report the performance on both query and inference of our approach. Experiments show that our approach achieves encouraging performance in million-scale real data.作者: 生氣的邊緣 時(shí)間: 2025-3-23 04:46
https://doi.org/10.1007/978-3-662-55244-5 a price. Web and database technology no longer support some of the desirable properties of paper publication, and it has introduced new problems in maintaining the scientific record. This brief paper is an examination of some of these issues.作者: Vasoconstrictor 時(shí)間: 2025-3-23 09:36
https://doi.org/10.1007/978-3-662-55244-5. All nodes are clustered based on their labels, and path information of each node is kept in bit vectors. Our filter technology mainly depends on high performance of bit operations. The experimental results show that these filter algorithms are effective, scalable and efficient.作者: 吞下 時(shí)間: 2025-3-23 12:49 作者: ingrate 時(shí)間: 2025-3-23 15:30 作者: 一大塊 時(shí)間: 2025-3-23 19:06
What the Web Has Done for Scientific Data – and What It Hasn’t a price. Web and database technology no longer support some of the desirable properties of paper publication, and it has introduced new problems in maintaining the scientific record. This brief paper is an examination of some of these issues.作者: parallelism 時(shí)間: 2025-3-24 00:09 作者: Analogy 時(shí)間: 2025-3-24 06:18 作者: 軍火 時(shí)間: 2025-3-24 09:34 作者: 繞著哥哥問 時(shí)間: 2025-3-24 11:10 作者: EXPEL 時(shí)間: 2025-3-24 17:32 作者: 好忠告人 時(shí)間: 2025-3-24 20:25 作者: 緯線 時(shí)間: 2025-3-25 02:14 作者: 先行 時(shí)間: 2025-3-25 04:50
Searching the World Wide Web for Local Services and Facilities: A Review on the Patterns of Location a service name accompanied by a location name. Our survey indicates that at least 22% of the Web queries have a geospatial dimension and most of these can be considered as location-based queries. We propose that location-based queries should be treated different from general queries to produce more relevant results.作者: 透明 時(shí)間: 2025-3-25 09:07
Self-adaptive Statistics Management for Efficient Query Processingement where, using query feedback information, an appropriate set of histograms is recommended and refined, and through histogram refining and reconstruction, fixed amount of memory is dynamically distributed to histograms which are most useful to the current workload. Extensive experiments showed the effectiveness of our techniques.作者: 枯萎將要 時(shí)間: 2025-3-25 11:53
https://doi.org/10.1007/978-3-662-55244-5we then propose a new storage approach, Blocked Binary-Tree Coding scheme (.), whose average code length reduces to O(log(n)). Our extensive experiments show that . significantly outperforms previous ones.作者: Isthmus 時(shí)間: 2025-3-25 19:03 作者: meritorious 時(shí)間: 2025-3-25 20:07
Construction de Series Discretes p-adiquesver physically modify original data, rather creates new version for compensating data intactness. Due to data intactness, search operation can access data without any locking or latching by reading old version. In the performance evaluation, it is proven that search operation of R.-tree is at least two times faster than a previous work.作者: 喃喃訴苦 時(shí)間: 2025-3-26 00:35
Lecture Notes in Civil Engineeringerent cost factors are attached on the training errors to generate an optimized hyperplane. Our experiments show that CS-SVM outperforms SVM on the standard ODP data set. The web pages with relative high PageRank values contribute most to the classifier and using them for training can exceed the random sampling technique.作者: 值得尊敬 時(shí)間: 2025-3-26 05:43
Risk Assessment in Construction Businessessmall. Such feature makes it very efficient for interactive mining. The algorithm we proposed has been implemented and its performance is compared with re-running Eclat, a vertical mining algorithm, under different minsup. Experimental results show that our algorithm is over two orders of magnitude faster than the latter in average.作者: 使激動(dòng) 時(shí)間: 2025-3-26 11:55 作者: tattle 時(shí)間: 2025-3-26 15:54
Modifications of the Counting Scheme, SOAM is given to acquire OWL ontology automatically as much as possible. Different from existing methods, the implementation method not only can acquire OWL ontology from relational database directly without demanding a middle model, but also can refine obtained ontology according to existing lexical knowledge repositories semi-automatically.作者: Directed 時(shí)間: 2025-3-26 19:46 作者: 龍卷風(fēng) 時(shí)間: 2025-3-27 00:03
A Soft Real-Time Web News Classification System with Double Control Loopsis and experiments result further prove its effectiveness: the variation range of the average response time is kept within ± 3% of the desired value; the computational resource is dynamically reallocated and reclaimed.作者: chemoprevention 時(shí)間: 2025-3-27 04:05 作者: Osteoarthritis 時(shí)間: 2025-3-27 08:59 作者: AVOID 時(shí)間: 2025-3-27 13:20
An Efficient Approach for Interactive Mining of Frequent Itemsetssmall. Such feature makes it very efficient for interactive mining. The algorithm we proposed has been implemented and its performance is compared with re-running Eclat, a vertical mining algorithm, under different minsup. Experimental results show that our algorithm is over two orders of magnitude faster than the latter in average.作者: 女歌星 時(shí)間: 2025-3-27 14:45
An Ontology Based Approach to Construct Behaviors in Web Information Systemsween domain ontology and behavior ontology with rule sets; (4) Implements a tool named WISE Builder with four algorithms to help users building behavior ontology with domain ontology; (5)Shows the feasibility of this technique in a real application case.作者: Mangle 時(shí)間: 2025-3-27 18:45 作者: explicit 時(shí)間: 2025-3-27 22:47 作者: characteristic 時(shí)間: 2025-3-28 04:40
Integrity Theory for Resource Space Model and Its Applicationerconnection environment. In parallel with the integrity theories of relational and XML-based data models, this keynote presents the integrity theory for the RSM, including the entity integrity constraints based on the key system of the RSM, the membership integrity constraints, the referential inte作者: hallow 時(shí)間: 2025-3-28 07:21 作者: POWER 時(shí)間: 2025-3-28 11:17 作者: 運(yùn)動(dòng)吧 時(shí)間: 2025-3-28 16:09 作者: obsolete 時(shí)間: 2025-3-28 19:42
An Effective and Efficient Approach for Keyword-Based XML Retrievalhe target XML document before constructing a query. For a keyword-based search engine for XML document, the key issue is how to return some sets of meaningfully related nodes to user’s query efficiently. An ordinary solution of current approaches is to store the relationship of each pair of nodes in作者: 小木槌 時(shí)間: 2025-3-29 02:29
Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Documentmatches the subgraph of graph structured XML document on some given schema. The query processing of graph-structured XML document brings new challenges..In this paper, for the processing of subgraph query, we design a subgraph join algorithm based on reachability coding. Using efficient data structu作者: 特別容易碎 時(shí)間: 2025-3-29 05:16 作者: Substance 時(shí)間: 2025-3-29 10:18 作者: 花束 時(shí)間: 2025-3-29 13:43
Self-adaptive Statistics Management for Efficient Query Processingtomated Statistics management is an important step towards a self-tuning DBMS and plays a key role in improving the quality of execution plans generated by the optimizer, and hence leads to shorter query processing times. In this paper, we present SASM, a framework for Self-Adaptive Statistics Manag作者: 夾克怕包裹 時(shí)間: 2025-3-29 19:28 作者: 抓住他投降 時(shí)間: 2025-3-29 23:10
Importance-Based Web Page Classification Using Cost-Sensitive SVMin content and quality, just as PageRank suggested. Typical machine learning algorithms take advantage of positive and negative examples to train a classifier; however, it has been neglected that each instance has a different weight, which can be user pre-defined. This paper presents an effective al作者: 走調(diào) 時(shí)間: 2025-3-30 03:49
An Efficient Approach for Interactive Mining of Frequent Itemsets interactive circumstances where users often change minimum support threshold (minsup) because the change of minsup may invalidate existing frequent itemsets or introduce new frequent itemsets. In this paper, we propose an efficient interactive mining technique based on a novel vertical itemset tree作者: kidney 時(shí)間: 2025-3-30 04:56
Similarity Search with Implicit Object Features object are not pre-computed/evaluated. As the existing similarity search techniques are not applicable, a novel and efficient algorithm is developed in this paper to approach the problem. The R-tree based algorithm consists of two steps: feature evaluation and similarity search. Our performance eva作者: 賞心悅目 時(shí)間: 2025-3-30 11:59
An Improved FloatBoost Algorithm for Na?ve Bayes Text Classificationin text classification exercises so far. FloatBoost learning uses a backtrack mechanism after each iteration of AdaBoost learning to minimize the error rate directly, rather than minimizing an exponential function of the margin as in the traditional AdaBoost algorithm. This paper presents an improve作者: 變白 時(shí)間: 2025-3-30 12:39 作者: 航海太平洋 時(shí)間: 2025-3-30 17:16 作者: fibroblast 時(shí)間: 2025-3-30 22:26
An Ontology Based Approach to Construct Behaviors in Web Information Systemsents or manage innumerous data while developing WIS behaviors. People appeal to a smart tool for implementing the WIS behaviors. This article makes the following contributions: (1) Proposes the concept of domain ontology and behavior ontology to describe the contents and operations of WIS; (2) Exten作者: interrogate 時(shí)間: 2025-3-31 01:20 作者: 使痛苦 時(shí)間: 2025-3-31 07:47
https://doi.org/10.1007/978-3-662-55244-5nted quantity and range of data, and the speed and ease of communication of all forms of scientific data has increased hugely. This change has come at a price. Web and database technology no longer support some of the desirable properties of paper publication, and it has introduced new problems in m作者: 收養(yǎng) 時(shí)間: 2025-3-31 09:55
,Comparison of Pt–Fe and Pt–Ni Catalysts,erconnection environment. In parallel with the integrity theories of relational and XML-based data models, this keynote presents the integrity theory for the RSM, including the entity integrity constraints based on the key system of the RSM, the membership integrity constraints, the referential inte作者: 逗它小傻瓜 時(shí)間: 2025-3-31 13:50
,Comparison of Pt–Fe and Pt–Ni Catalysts,ional grid computing projects come into attention. Although lots of fruitful results are obtained through such huge projects, grid computing is still far way from what we expect, using all kinds of resources and services over the internet just as using public utilities like water and electricity. Th作者: depreciate 時(shí)間: 2025-3-31 20:19
https://doi.org/10.1007/978-3-662-55244-5e popular method is to code each node in the XML document tree. However, its main problem is that either lacks the ability to support XML documents update or need huge storage space. This paper proposes a new update-supporting coding scheme based on binary-tree to identify the ancestor-descendant re作者: Debility 時(shí)間: 2025-3-31 21:44
https://doi.org/10.1007/978-3-662-55244-5articipated in computing. In this paper, we propose a novel filter strategy to reduce the number of candidate nodes based on the structure of XML data. All nodes are clustered based on their labels, and path information of each node is kept in bit vectors. Our filter technology mainly depends on hig作者: 保存 時(shí)間: 2025-4-1 02:43 作者: 產(chǎn)生 時(shí)間: 2025-4-1 08:36 作者: guzzle 時(shí)間: 2025-4-1 11:55
