Web linkage-matrix based ranking algorithms are the mainstream of current ranking algorithms of web information retrieval systems, which could be divided into three categories: random walks based algorithms、authority/hub based algorithms and hybrid algorithms. After discussing the basic principles, shortages and advantages of the typical algorithms of these three kinds, we show a hybrid algorithm based on linkage-matrix.
王非 . 基于Web链接矩阵的排序算法研究[J]. 现代图书情报技术, 2006, 1(3): 31-35.
Wang Fei . A Study of Web Linkage-matrix Based Ranking Algorithms. New Technology of Library and Information Service, 2006, 1(3): 31-35.
1S.Brin， L.Page. The pagerank citation ranking: Bring order to the web. In Technical Reporthttp://www-db.stanford.edu/pub/1999-66.pdf，1999
2S.Brin， L.Page. The Anatomy of a LargeScale Hypertextual Web Search Engine. In Technical Reporthttp://www-db.stanford.edu/pub/1998-68.pdf，1998
3Jon Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM， 46， 1999
4Monika R. Henzinger, Krishna Bharat. Improved algorithms for topic distillation in a hyperlinked environment. Proceedings of the 21’st International ACM SIGIR Conference on Research and Development in IR, August 1998
5Soumen Chakrabarti, et al. Automatic resource compilation by analyzing hyperlink structure and associated text. Proceedings of the 7th International WWW Conference, 1998
6Allan Borodin, et al. Finding Authorities and Hubs From Link Structures on the World Wide Web. Proceedings of the 10th International WWW Conference, 2001
7R.Lempel, S.Moran. The Stochastic Approach for LinkStructure Analysis (SALSA) and the TKC Effect. Proceedings of the 9th International World Wide WEB Conferrence, 2000
8Ricardo BaezaYates, et al. Modern information retrieval. P82. ADDISON WESLEY Press.1999
