Latent semantic indexing: a probabilistic analysis
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the ninth international conference on Information and knowledge management
Information Retrieval
pSearch: information retrieval in structured overlays
ACM SIGCOMM Computer Communication Review
Using Linear Algebra for Intelligent Information Retrieval
Using Linear Algebra for Intelligent Information Retrieval
RCV1: A New Benchmark Collection for Text Categorization Research
The Journal of Machine Learning Research
Creating social networks to improve peer-to-peer networking
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
DHTs over Peer Clusters for Distributed Information Retrieval
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
A decision-theoretic model for decentralised query routing in hierarchical peer-to-peer networks
ECIR'07 Proceedings of the 29th European conference on IR research
Aggregation of a term vocabulary for P2P-IRtest: a DHT stress test
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Semantic overlay networks for p2p systems
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
Efficient super-peer-based queries routing
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Hi-index | 0.00 |
Current distributed IR approaches are not readily applicable for P2P scenarios. The high dynamics in these networks and the high cost for building and maintaining indices over Distributed Hashtables make full text indexing and information processing difficult to scale for large P2P networks. My work will propose new approaches for enabling distributed IR over P2P without limiting the network size or mutilating the IR. The basis of these approaches is an innovative distributed clustering algorithm, which can cluster peers in a P2P network based on their content similarity. This clustering enables significant network savings and enables new families of distributed IR algorithms.