Relevance Search via Bipolar Label Diffusion on Bipartite Graphs
Keywords:
Relevance search, ranking, graph diffusion, bipartite graphs
Abstract
The task of relevance search is to find relevant items to some given queries which can be viewed either as an information retrieval problem or as a semi-supervised learning problem In order to combine both of their advantages we develop a new relevance search method using label diffusion on bipartite graphs And we propose a heat diffusion-based algorithm namely bipartite label diffusion BLD Our method yields encouraging experimental results on a number of relevance search problems
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2012-01-15
Issue
Section
License
Copyright (c) 2012 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.