A generalized Co-HITS algorithm and its application to bipartite graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2009, Pages 239-247

  Deng, Hongbo ^a   Lyu, Michael R ^a   King, Irwin ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Algorithms; Experimentation; Performance

Indexed keywords

BASELINE METHODS; BIPARTITE GRAPHS; CONTENT INFORMATION; DATA TYPE; EXPERIMENTATION; HITS ALGORITHMS; ITERATIVE FRAMEWORK; PAGERANK; PERFORMANCE; QUERY LOGS; QUERY SUGGESTION; REGULARIZATION FRAMEWORK; SCIENTIFIC LITERATURE; SEARCH APPLICATION;

ALGORITHMS;

GRAPH THEORY;

EID: 70350690500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557051     Document Type: Conference Paper

References (32)

1. R. Baeza-Yates and B. Ribeiro-Neto. Modern information retrieval. Addison-Wesley Harlow, 1999.
2. R. A. Baeza-Yates and A. Tiberi. Extracting semantic relations from query logs. In KDD, pages 76-85, 2007.
3. D. Beeferman and A. L. Berger. Agglomerative clustering of a search engine query log. In KDD, pages 407-416, 2000.
4. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1-7):107-117, 1998.
5. N. Craswell and M. Szummer. Random walks on the click graph. In SIGIR, pages 239-246, 2007.
6. T. Davis. Direct Methods for Sparse Linear Systems. Society for Industrial Mathematics, 2006.
7. H. Deng, M. R. Lyu, and I. King. Effective latent space graph-based re-ranking model with global consistency. In WSDM, pages 212-221, 2009.
8. F. Diaz. Regularizing ad hoc retrieval scores. In CIKM, pages 672-679, 2005.
9. C. H. Q. Ding, X. He, P. Husbands, H. Zha, and H. D. Simon. Pagerank, hits and a unified framework for link analysis. In SIGIR, pages 353-354, 2002.
10. T. Haveliwala, S. Kamvar, and G. Jeh. An analytical comparison of approaches to personalizing PageRank. Preprint, June, 2003.
11. R. Jones, B. Rey, O. Madani, and W. Greiner. Generating query substitutions. In WWW, pages 387-396, 2006.
12. J. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, 1999.
13. O. Kurland and L. Lee. Pagerank without hyperlinks: structural re-ranking using links induced by language models. In SIGIR, pages 306-313, 2005.
14. O. Kurland and L. Lee. Respect my authority!: Hits without hyperlinks, utilizing cluster-based language models. In SIGIR, pages 83{90, 2006.
15. X. Li, Y.-Y. Wang, and A. Acero. Learning query intent from regularized click graphs. In SIGIR, pages 339{346, 2008.
16. H. Ma, H. Yang, I. King, and M. R. Lyu. Learning latent semantic relations from clickthrough data for query suggestion. In CIKM, pages 709{718, 2008.
17. Q. Mei, D. Cai, D. Zhang, and C. Zhai. Topic modeling with network regularization. In WWW, pages 101{110, 2008.
18. E. Minkov, W. W. Cohen, and A. Y. Ng. Contextual search and name disambiguation in email using graphs. In SIGIR, pages 27{34, 2006.
19. Z. Nie, Y. Zhang, J.-R. Wen, and W.-Y. Ma. Object-level ranking: bringing order to web objects. In WWW, pages 567{574, 2005.
20. G. Pass, A. Chowdhury, and C. Torgeson. A picture of search. In Infoscale, 2006.
21. B. Poblete and R. A. Baeza-Yates. Query-sets: using implicit feedback and query patterns to organize web documents. In WWW, pages 41{50, 2008.
22. B. Poblete, C. Castillo, and A. Gionis. Dr. searcher and mr. browser: a unified hyperlink-click graph. In CIKM, pages 1123{1132, 2008.
23. J. M. Ponte and W. B. Croft. A language modeling approach to information retrieval. In SIGIR, pages 275{281, 1998.
24. T. Qin, T.-Y. Liu, et al. Learning to rank relational objects and its application to web search. In WWW, pages 407{416, 2008.
25. A. Smola and R. Kondor. Kernels and regularization on graphs. COLT, 2003.
26. X. Wang and C. Zhai. Learn from web search logs to organize search results. In SIGIR, pages 87{94, 2007.
27. C. Zhai and J. D. Lafferty. Two-stage language models for information retrieval. In SIGIR, pages 49{56, 2002.
28. C. Zhai and J. D. Lafferty. A study of smoothing methods for language models applied to information retrieval. ACM Trans. Inf. Syst., 22(2):179{214, 2004.
29. B. Zhang, H. Li, Y. Liu, L. Ji, W. Xi, W. Fan, Z. Chen, and W.-Y. Ma. Improving web search results using afinity graph. In SIGIR, pages 504{511, 2005.
30. D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. SchÄolkopf. Learning with local and global consistency. In NIPS, 2003.
31. D. Zhou, B. SchÄolkopf, and T. Hofmann. Semi-supervised learning on directed graphs. In NIPS, 2004.
32. X. Zhu, Z. Ghahramani, and J. D. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, pages 912{919, 2003.