Skip to main content
Log in

Exploiting community feedback for information retrieval in DHT networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

In this paper, we propose CYBER, a CommunitY Based sEaRch engine, for information retrieval utilizing community feedback information in a DHT network. In CYBER, each user is associated with a set of user profiles that capture his/her interests. Likewise, a document is associated with a set of profiles—one for each indexed term. A document profile is updated by users who query on the term and consider the document as a relevant answer. Thus, the profile acts as a consolidation of users feedback from the same community, and reflects their interests. In this way, as one user finds a document to be relevant, another user in the same community issuing a similar query will benefit from the feedback provided by the earlier user. Hence, the search quality in terms of both precision and recall is improved. Moreover, we further improve the effectiveness of CYBER by introducing an index tuning technique. By choosing the indexing terms more carefully, community-based relevance feedback is utilized in both building/refining indices and re-evaluating queries. We first propose a naive scheme, CYBER+, which involves an index tuning technique based on past queries only, and then re-evaluates queries in a separate step. We then propose a more complex scheme, CYBER+ +, which refines its index based on both past queries and relevance feedback. As the index is built with more selective and accurate terms, the search performance is further improved. We conduct a comprehensive experimental study and the results show the effectiveness of our schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. Terms that are not used in queries will not contribute to the similarity computation, so it is not necessary to keep them around.

  2. In this paper, we do not consider replication.

  3. The related terms appear in both the document and the past queries.

  4. If the increasing factor is set to a very large number, such as 100, then removing wrong indexing terms becomes impossible.

  5. Different from document profile update, user profile updating is a local process, and thus no optimization is needed.

References

  1. Beydoun G, Kultchitsky R, Manasseh G (2007) Evolving semantic web with social navigation. Expert Syst Appl 32(2):265–276

    Article  Google Scholar 

  2. Hersh W, Buckley C, Leone T, Hickam D (2004) Ohsumed: an interactive retrieval evaluation and new large test collection for research. In: SIGIR

  3. Lee DL, Chuang H, Seamons K (1997) Document ranking and the vector-space model. IEEE Softw 14:67–75

    Article  Google Scholar 

  4. Li J, Loo BT, Hellerstein J, Kaashoek F, Karger DR, Morris R (2003) On the feasibility of peer-to-peer web indexing and search. In: IPTPS

  5. Li YG, Jagadish HV, Tan KL (2007) Sprite: a learning-based text retrieval system in DHT networks. In: ICDE

  6. Liu L, Antonopoulos N, Mackin S (2008) Small-world peer-to-peer for resource discovery. In: Information networking. Towards Ubiquitous Networking and Services, vol 5200, pp 223–233

  7. Löser A, Staab S, Tempich C (2007) Semantic social overlay networks. IEEE JSAC

  8. Mislove A, Gummadi KP, Druschel P (2006) Exploiting social networks for internet search. In: HotNets

  9. Podnar I, Rajman M, Luu T, Klemm F, Aberer K (2007) Scalable peer-to-peer web retrieval with highly discriminative keys. In: ICDE

  10. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: SIGCOMM

  11. Shardanand U, Maes P (1995) Social information filtering: Algorithms for automating “word of mouth”. In: CHI

  12. Shen X, Tan B, Zhai C (2005) Implicit user modeling for personalized search. In: CIKM

  13. Skobeltsyn G, Luu T, Aberer K, Rajman M, Zarko IP (2007) Query-driven indexing for peer-to-peer text retrieval. In: WWW

  14. Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: SIGCOMM

  15. Tang C, Dwarkadas S (2004) Hybrid global–local indexing for efficient peer-to-peer information retrieval. In: NSDI

Download references

Acknowledgements

Yingguang Li and Kian-Lee Tan are partially supported by an MOE-funded research grant R-252-000-237-112.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yingguang Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, Y., Shou, L. & Tan, KL. Exploiting community feedback for information retrieval in DHT networks. Peer-to-Peer Netw. Appl. 4, 106–121 (2011). https://doi.org/10.1007/s12083-010-0068-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-010-0068-0

Keywords

Navigation