Thu, 21 Aug 2008 09:51:02 BST CiteULike: k12u's library [29 articles] http://www.citeulike.org/user/k12u CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/k12u/article/561562 <i>Knowledge and Data Engineering, IEEE Transactions on, Vol. 17, No. 12. (2005), pp. 1721-1736.</i><br /><br />The knowledge grid needs to operate with a scalable platform to provide large-scale intelligent services. A key function of such a platform is to efficiently support various complex queries in a dynamic large-scale network environment. This paper proposes a platform to support index-based path queries by incorporating a semantic overlay with an underlying structured P2P network that provides object location and management services. Various distributed indexing structures can be dynamically formed by publishing, semantic objects as indexing nodes. Queries are forwarded along the chains of semantic object pointers to search for objects. We investigate the deployment of a scalable distributed trie index for broadcast queries on key strings, propose a decentralized load balancing method for solving the problem of uneven load distribution incurred by heterogeneity of loads and node capacities and by the distributed trie index, and give an approach for improving the availability of the semantic overlay and its trie index. Experiments demonstrate the scalability of the proposed platform. A scalable P2P platform for the knowledge grid Hai Zhuge Xiaoping Sun Jie Liu Erlin Yao Xue Chen Knowledge and Data Engineering, IEEE Transactions on, Vol. 17, No. 12. (2005), pp. 1721-1736. 2006-03-23T19:15:41-00:00 2005 Knowledge and Data Engineering, IEEE Transactions on 17 12 1721 1736 no-tag http://www.citeulike.org/user/k12u/article/561560 <i>Knowledge and Data Engineering, IEEE Transactions on, Vol. 16, No. 7. (2004), pp. 813-826.</i><br /><br />Most existing peer-to-peer (P2P) systems support only title-based searches and are limited in functionality when compared to today's search engines. We present the design of a distributed P2P information sharing system that supports semantic-based content searches of relevant documents. First, we propose a general and extensible framework for searching similar documents in P2P network. The framework is based on the novel concept of hierarchical summary structure. Second, based on the framework, we develop our efficient document searching system by effectively summarizing and maintaining all documents within the network with different granularity. Finally, an experimental study is conducted on a real P2P prototype, and a large-scale network is further simulated. The results show the effectiveness, efficiency, and scalability of the proposed system. Efficient semantic-based content search in P2P network HT Shen Y Shu B Yu Knowledge and Data Engineering, IEEE Transactions on, Vol. 16, No. 7. (2004), pp. 813-826. 2006-03-23T19:06:26-00:00 2004 Knowledge and Data Engineering, IEEE Transactions on 16 7 813 826 no-tag http://www.citeulike.org/user/k12u/article/561559 <i>Knowledge and Data Engineering, IEEE Transactions on, Vol. 16, No. 7. (2004), pp. 858-869.</i><br /><br />Identification is an essential building block for many services in distributed information systems. The quality and purpose of identification may differ, but the basic underlying problem is always to bind a set of attributes to an identifier in a unique and deterministic way. Name/directory services, such as DNS, X.500, or UDDI, are a well-established concept to address this problem in distributed information systems. However, none of these services addresses the specific requirements of peer-to-peer systems with respect to dynamism, decentralization, and maintenance. We propose the implementation of directories using a structured peer-to-peer overlay network and apply this approach to support self-contained maintenance of routing tables with dynamic IP addresses in structured P2P systems. Thus, we keep routing tables intact without affecting the organization of the overlay networks, making it logically independent of the underlying network infrastructure. Even though the directory is self-referential, since it uses its own service to maintain itself, we show that it is robust due to a self-healing capability. For security, we apply a combination of PGP-like public key distribution and a quorum-based query scheme. We describe the algorithm as implemented in the P-Grid P2P lookup system (http:// www.p-grid.org/) and give a detailed analysis and simulation results demonstrating the efficiency and robustness of our approach. Efficient, self-contained handling of identity in peer-to-peer systems K Aberer A Datta M Hauswirth Knowledge and Data Engineering, IEEE Transactions on, Vol. 16, No. 7. (2004), pp. 858-869. 2006-03-23T19:06:01-00:00 2004 Knowledge and Data Engineering, IEEE Transactions on 16 7 858 869 no-tag http://www.citeulike.org/user/k12u/article/561558 <i>Knowledge and Data Engineering, IEEE Transactions on, Vol. 16, No. 6. (2004), pp. 754-769.</i><br /><br />Proxy hit ratios tend to decrease as the demand and supply of Web contents are becoming more diverse. By case studies, we quantitatively confirm this trend and observe significant document duplications among a proxy and its client browsers' caches. One reason behind this trend is that the client/server Web caching model does not support direct resource sharing among clients, causing the Web contents and the network bandwidths among clients to be relatively underutilized. To address these limits and improve Web caching performance, we have extensively enhanced and deployed our browsers-aware framework, a peer-to-peer Web caching management scheme. We make the browsers and their proxy share the contents to exploit the neglected but rich data locality in browsers and reduce document duplications among the proxy and browsers' caches to effectively utilize the Web contents and network bandwidth among clients. The objective of our scheme is to improve the scalability of proxy-based caching both in the number of connected clients and in the diversity of Web documents. We show that building such a caching system with considerations of sharing contents among clients, minimizing document duplications, and achieving data integrity and communication anonymity is not only feasible but also highly effective. Building a large and efficient hybrid peer-to-peer Internet caching system L Xiao X Zhang A Andrzejak S Chen doi:10.1109/TKDE.2004.1 Knowledge and Data Engineering, IEEE Transactions on, Vol. 16, No. 6. (2004), pp. 754-769. 2006-03-23T19:04:39-00:00 2004 Knowledge and Data Engineering, IEEE Transactions on 16 6 754 769 no-tag http://www.citeulike.org/user/k12u/article/418399 <i>Neural Comp., Vol. 17, No. 12. (1 December 2005), pp. 2602-2634.</i><br /><br />Locally weighted projection regression (LWPR) is a new algorithm for incremental nonlinear function approximation in high-dimensional spaces with redundant and irrelevant input dimensions. At its core, it employs nonparametric regression with locally linear models. In order to stay computationally efficient and numerically robust, each local model performs the regression analysis with a small number of univariate regressions in selected directions in input space in the spirit of partial least squares regression. We discuss when and how local learning techniques can successfully work in high-dimensional spaces and review the various techniques for local dimensionality reduction before finally deriving the LWPR algorithm. The properties of LWPR are that it (1) learns rapidly with second-order learning methods based on incremental training, (2) uses statistically sound stochastic leave-one-out cross validation for learning without the need to memorize training data, (3) adjusts its weighting kernels based on only local information in order to minimize the danger of negative interference of incremental learning, (4) has a computational complexity that is linear in the number of inputs, and (5) can deal with a large number of--possibly redundant--inputs, as shown in various empirical evaluations with up to 90 dimensional data sets. For a probabilistic interpretation, predictive variance and confidence intervals are derived. To our knowledge, LWPR is the first truly incremental spatially localized learning method that can successfully and efficiently operate in very high-dimensional spaces. Incremental Online Learning in High Dimensions Sethu Vijayakumar Aaron D'Souza Stefan Schaal Neural Comp., Vol. 17, No. 12. (1 December 2005), pp. 2602-2634. 2005-12-01T14:25:31-00:00 2005 Neural Comp. 17 12 2602 2634 tod vector-space http://www.citeulike.org/user/k12u/article/266187 <i>Science, Vol. 290, No. 5500. (22 December 2000), pp. 2319-2323.</i><br /><br />Scientists working with large volumes of high-dimensional data, such as global climate patterns, stellar spectra, or human gene distributions, regularly confront the problem of dimensionality reduction: finding meaningful low-dimensional structures hidden in their high-dimensional observations. The human brain confronts the same problem in everyday perception, extracting from its high-dimensional sensory inputs-30,000 auditory nerve fibers or 10(6) optic nerve fibers-a manageably small number of perceptually relevant features. Here we describe an approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set. Unlike classical techniques such as principal component analysis (PCA) and multidimensional scaling (MDS), our approach is capable of discovering the nonlinear degrees of freedom that underlie complex natural observations, such as human handwriting or images of a face under different viewing conditions. In contrast to previous algorithms for nonlinear dimensionality reduction, ours efficiently computes a globally optimal solution, and, for an important class of data manifolds, is guaranteed to converge asymptotically to the true structure. A global geometric framework for nonlinear dimensionality reduction. JB Tenenbaum V de Silva JC Langford doi:10.1126/science.290.5500.2319 Science, Vol. 290, No. 5500. (22 December 2000), pp. 2319-2323. 2005-07-27T21:06:11-00:00 2000 Science 0036-8075 290 5500 2319 2323 tod vector-space http://www.citeulike.org/user/k12u/article/416880 <i>Journal of the American Society for Information Science, Vol. 37, No. 5. (7 January 1999), pp. 279-287.</i><br /><br />Notations and definitions necessary to identify the concepts and relationships that are important in modelling information retrieval objects and processes in the context of vector spaces are presented. Earlier work on the use of vector model is evaluated in terms of the concepts introduced and certain problems and inconsistencies are identified. More importantly, this investigation should lead to a clear understanding of the issues and problems in using the vector space model in information retrieval. © 1986 John Wiley & Sons, Inc. A critical analysis of vector space model for information retrieval Vijay Raghavan SKM Wong doi:10.1002/(SICI)1097-4571(198609)37:5<279::AID-ASI1>3.0.CO;2-Q Journal of the American Society for Information Science, Vol. 37, No. 5. (7 January 1999), pp. 279-287. 2005-12-01T05:33:38-00:00 1999 Journal of the American Society for Information Science 1097-4571 37 5 279 287 ir vector-space http://www.citeulike.org/user/k12u/article/416489 <i>J. Mach. Learn. Res., Vol. 5 (2004), pp. 73-99.</i> Dimensionality Reduction for Supervised Learning with Reproducing Kernel Hilbert Spaces Kenji Fukumizu Francis Bach Michael Jordan J. Mach. Learn. Res., Vol. 5 (2004), pp. 73-99. 2005-11-30T19:47:47-00:00 2004 J. Mach. Learn. Res. 1533-7928 5 73 99 MIT Press tod vector-space http://www.citeulike.org/user/k12u/article/3645 <i>(2004), pp. 96-103.</i> Locality preserving indexing for document representation Xiaofei He Deng Cai Haifeng Liu Wei-Ying Ma doi:10.1145/1008992.1009012 (2004), pp. 96-103. 2004-12-15T03:58:46-00:00 2004 96 103 ACM Press tod vector-space http://www.citeulike.org/user/k12u/article/416488 <i>(1993), pp. 301-310.</i> Geometry theorem proving in vector spaces by means of Gr&ouml;bner bases Sabine Stifter doi:10.1145/164081.164144 (1993), pp. 301-310. 2005-11-30T19:45:34-00:00 1993 301 310 ACM Press tod vector-space http://www.citeulike.org/user/k12u/article/416487 <i>J. Mach. Learn. Res., Vol. 6 (2005), pp. 37-53.</i> Dimension Reduction in Text Classification with Support Vector Machines Hyunsoo Kim Peg Howland Haesun Park J. Mach. Learn. Res., Vol. 6 (2005), pp. 37-53. 2005-11-30T19:44:26-00:00 2005 J. Mach. Learn. Res. 1533-7928 6 37 53 MIT Press tod vector-space http://www.citeulike.org/user/k12u/article/416419 <i>(2000), pp. 12-19.</i> Fast supervised dimensionality reduction algorithm with applications to document categorization & retrieval George Karypis Eui-Hong Han doi:10.1145/354756.354772 (2000), pp. 12-19. 2005-11-30T19:42:24-00:00 2000 12 19 ACM Press tod vector-space http://www.citeulike.org/user/k12u/article/416422 <i>(2001), pp. 245-250.</i> Random projection in dimensionality reduction: applications to image and text data Ella Bingham Heikki Mannila doi:10.1145/502512.502546 (2001), pp. 245-250. 2005-11-30T19:42:27-00:00 2001 245 250 ACM Press tod vector-space http://www.citeulike.org/user/k12u/article/416418 <i>Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, Vol. 13, No. 3. (1994), pp. 353-358.</i><br /><br />A new approach for dynamic test vector compaction, for combinational logic circuits, called COMPACT, is proposed. A new data structure of test vectors permits easy verification of compactability between test vectors with minimal memory requirements. Experimental results obtained by adding the proposed algorithm to a simple PODEM program and applying it to the ISCAS-85 benchmark circuits are presented. The resulting test vector reduction is up to 40% for small circuits and around 50% for the large circuits (over 1000 gates) A new dynamic test vector compaction for automatic test pattern generation B Ayari B Kaminska Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, Vol. 13, No. 3. (1994), pp. 353-358. 2005-11-30T19:41:07-00:00 1994 Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on 13 3 353 358 tod vector-space http://www.citeulike.org/user/k12u/article/416417 <i>Computers, IEEE Transactions on, Vol. 40, No. 2. (1991), pp. 214-217.</i><br /><br />A pipelined vector-reduction method that is based on L.M. Ni and K. Hwang's (1985) symmetric and asymmetric reduction methods is discussed. It is shown that the proposed method is the fastest among known pipelined vector-reduction methods An improved vector-reduction method HJ Sips H Lin Computers, IEEE Transactions on, Vol. 40, No. 2. (1991), pp. 214-217. 2005-11-30T19:40:38-00:00 1991 Computers, IEEE Transactions on 40 2 214 217 tod vector-space http://www.citeulike.org/user/k12u/article/416383 <i>(2004), pp. 112-121.</i> On scaling latent semantic indexing for large peer-to-peer systems Chunqiang Tang Sandhya Dwarkadas Zhichen Xu doi:10.1145/1008992.1009014 (2004), pp. 112-121. 2005-11-30T19:33:16-00:00 2004 112 121 ACM Press ir lsi p2p vector-space http://www.citeulike.org/user/k12u/article/374641 <i>(JanuaryJuly--FebruaryJanuary 1994), pp. 23-32.</i><br /><br />GLIMPSE, which stands for GLobal IMPlicit SEarch, provides indexing and query schemes for file systems. The novelty of glimpse is that it uses a very small index --- in most cases 2-4% of the size of the text --- and still allows very flexible full-text retrieval including Boolean queries, approximate matching (i.e., allowing misspelling) , and even searching for regular expressions. In a sense, glimpse extends agrep to entire file systems, while preserving most of its functionality and... GLIMPSE: A Tool to Search Through Entire File Systems U Manber S Wu (JanuaryJuly--FebruaryJanuary 1994), pp. 23-32. 2005-11-01T09:44:37-00:00 1994 23 32 ir http://www.citeulike.org/user/k12u/article/349715 <i>(2005), pp. 577-588.</i> Cache-conscious frequent pattern mining on a modern processor Amol Ghoting Gregory Buehrer Srinivasan Parthasarathy Daehyun Kim Anthony Nguyen Yen-Kuang Chen Pradeep Dubey (2005), pp. 577-588. 2005-10-13T07:39:16-00:00 2005 577 588 VLDB Endowment general http://www.citeulike.org/user/k12u/article/300420 <i>Inf. Process. Manage., Vol. 24, No. 5. (1988), pp. 513-523.</i> Term-weighting approaches in automatic text retrieval Gerard Salton Christopher Buckley doi:10.1016/0306-4573(88)90021-0 Inf. Process. Manage., Vol. 24, No. 5. (1988), pp. 513-523. 2005-08-22T15:29:12-00:00 1988 Inf. Process. Manage. 0306-4573 24 5 513 523 Pergamon Press, Inc. ir tfidf http://www.citeulike.org/user/k12u/article/270732 <i>Commun. ACM, Vol. 18, No. 11. (November 1975), pp. 613-620.</i> A vector space model for automatic indexing G Salton A Wong CS Yang doi:10.1145/361219.361220 Commun. ACM, Vol. 18, No. 11. (November 1975), pp. 613-620. 2005-08-01T11:57:21-00:00 1975 Commun. ACM 0001-0782 18 11 613 620 ACM Press ir vector-space http://www.citeulike.org/user/k12u/article/163711 <i>(1997), pp. 355-364.</i> Improving retrieval performance by relevance feedback Gerard Salton Chris Buckley (1997), pp. 355-364. 2005-04-19T01:41:28-00:00 1997 355 364 Morgan Kaufmann Publishers Inc. ir tfidf http://www.citeulike.org/user/k12u/article/78280 <i>Journal of the American Society of Information Science, Vol. 41, No. 6. (1990), pp. 391-407.</i><br /><br />A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents ("semantic structure") in order to improve the detection of relevant documents on the basis of terms found in queries. The particular technique used is singular-value decomposition, in which a large term by document matrix is decomposed into a set of ca 100 orthogonal factors from which the original matrix can be... Indexing by Latent Semantic Analysis Scott Deerwester Susan Dumais Thomas Landauer George Furnas Richard Harshman Journal of the American Society of Information Science, Vol. 41, No. 6. (1990), pp. 391-407. 2005-01-14T11:59:51-00:00 1990 Journal of the American Society of Information Science 41 6 391 407 ir lsi http://www.citeulike.org/user/k12u/article/203957 <i>Journal of the American Society for Information Science, Vol. 41, No. 6. (7 January 1999), pp. 391-407.</i><br /><br />A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (<IMG SRC="/giflibrary/12/ldquo.gif" BORDER="0">semantic structure<IMG SRC="/giflibrary/12/rdquo.gif" BORDER="0">) in order to improve the detection of relevant documents on the basis of terms found in queries. The particular technique used is singular-value decomposition, in which a large term by document matrix is decomposed into a set of ca. 100 orthogonal factors from which the original matrix can be approximated by linear combination. Documents are represented by ca. 100 item vectors of factor weights. Queries are represented as pseudo-document vectors formed from weighted combinations of terms, and documents with supra-threshold cosine values are returned. Initial tests find this completely automatic method for retrieval to be promising. © 1990 John Wiley & Sons, Inc. Indexing by latent semantic analysis Scott Deerwester Susan Dumais George Furnas Thomas Landauer Richard Harshman doi:10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9 Journal of the American Society for Information Science, Vol. 41, No. 6. (7 January 1999), pp. 391-407. 2005-05-18T22:36:14-00:00 1999 Journal of the American Society for Information Science 1097-4571 41 6 391 407 ir lsi http://www.citeulike.org/user/k12u/article/313681 <i>(2004)</i> An Implementation of a Semantic Associative Search Space for Medical Document Databases Minoru Kawamoto Yasushi Kiyoki Naofumi Yoshida Seitaro Fujishima Sadakazu Aiso (2004) 2005-09-08T08:06:28-00:00 2004 IEEE Computer Society mmm http://www.citeulike.org/user/k12u/article/313680 <i>SIGMOD Rec., Vol. 23, No. 4. (December 1994), pp. 34-41.</i> A metadatabase system for semantic image search by a mathematical model of meaning Yasushi Kiyoki Takashi Kitagawa Takanari Hayama doi:10.1145/190627.190639 SIGMOD Rec., Vol. 23, No. 4. (December 1994), pp. 34-41. 2005-09-08T08:05:07-00:00 1994 SIGMOD Rec. 0163-5808 23 4 34 41 ACM Press mmm http://www.citeulike.org/user/k12u/article/305824 <i>System Sciences, 2005. HICSS '05. Proceedings of the 38th Annual Hawaii International Conference on (2005), pp. 99a-99a.</i><br /><br />This paper presents the results of a genre analysis of two web-based collaborative authoring environments, Wikipedia and Everything2, both of which are intended as repositories of encyclopedic knowledge and are open to contributions from the public. Using corpus linguistic methods and factor analysis of word counts for features of formality and informality, we show that the greater the degree of post-production editorial control afforded by the system, the more formal and standardized the language of the collaboratively-authored documents becomes, analogous to that found in traditional print encyclopedias. Paradoxically, users who faithfully appropriate such systems create homogeneous entries, at odds with the goal of open-access authoring environments to create diverse content. The findings shed light on how users, acting through mechanisms provided by the system, can shape (or not) features of content in particular ways. We conclude by identifying sub-genres of web-based collaborative authoring environments based on their technical affordances. Collaborative Authoring on the Web: A Genre Analysis of Online Encyclopedias W Emigh SC Herring System Sciences, 2005. HICSS '05. Proceedings of the 38th Annual Hawaii International Conference on (2005), pp. 99a-99a. 2005-08-27T21:47:43-00:00 2005 System Sciences, 2005. HICSS '05. Proceedings of the 38th Annual Hawaii International Conference on 99a 99a wikis http://www.citeulike.org/user/k12u/article/76591 <i>(2002), pp. 149-149.</i> Self-assembling hypertexts, weblogs, and wikis Stuart Moulthrop Mark Bernstein Sean Carton doi:10.1145/513338.513342 (2002), pp. 149-149. 2005-01-13T06:50:34-00:00 2002 149 149 ACM Press wikis http://www.citeulike.org/user/k12u/article/162871 <i>Medical Informatics & the Internet in Medicine;, Vol. 28, No. 4. (December 2003), p231.</i> From data to knowledge in e-health applications: an integrated system for medical information modelling and retrieval Fefie Dotsika doi:doi:10.1080/14639230310001617832 Medical Informatics & the Internet in Medicine;, Vol. 28, No. 4. (December 2003), p231. 2005-04-17T04:02:09-00:00 2003 Medical Informatics & the Internet in Medicine; 28 4 p231 ir medical http://www.citeulike.org/user/k12u/article/102131 <i>ACM Comput. Surv., Vol. 36, No. 4. (December 2004), pp. 335-371.</i> A survey of peer-to-peer content distribution technologies Stephanos Androutsellis-Theotokis Diomidis Spinellis doi:10.1145/1041680.1041681 ACM Comput. Surv., Vol. 36, No. 4. (December 2004), pp. 335-371. 2005-02-23T21:52:29-00:00 2004 ACM Comput. Surv. 0360-0300 36 4 335 371 ACM Press p2p survey