Please use this identifier to cite or link to this item:
|Title:||A distributed ranking strategy in peer-to-peer based information retrieval systems|
|Citation:||Lu, Z., Ling, B., Qian, W., Ng, W.S., Zhou, A. (2004). A distributed ranking strategy in peer-to-peer based information retrieval systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3007 : 279-284. ScholarBank@NUS Repository.|
|Abstract:||The state of the art of P2P-based information retrieval is still at its infant stage and confronted with many challenges. One of the most urgent problems is how to rank the results retrieved from different peers. In this paper, we propose a fully distributed strategy to address this challenge. First, we identify the underlying diathesis resulting in the problem. Then we propose a fully distributed strategy to rank and merge results retrieved from different sites, including fully distributed statistics management and distributed ranking processing. Finally, we conduct an extensive experimental study to evaluate the strategy and the results verify the effectiveness of our solution. © Springer-Verlag Berlin Heidelberg 2004.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 5, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.