Abstract：In order to enhance the accuracy of retrieved academic papers, so as to facilitate academic research extensively, a series of ranking strategies for academic paper retrieval problem were proposed. Firstly, the heuristic methods based on page ranking algorithm for paper index ranking were described, taking advantage of a Hash indexing technique to effectively reduce memory consumption of the sparse matrix computation. Secondly, the definition of intensive equilibrium value of reference relationship among papers was presented, at the same time, the correlation between iterations of different ranking algorithms and intensive equilibrium value was clarified by a large number of experiments. Finally, the proposed heuristic algorithms for paper index ranking were tested on the SCI index database, and compared with the classical citation descending sort results. The experimental results show that, in the proposed three kind of algorithms based on page ranking techniques, the stochastic process approach with link-structure analysis is much more suitable for the ranking of papers, which obtained by the searching results according to keywords in a certain field.
万晓松, 王志海, 原继东. 基于稀疏矩阵面向论文索引排名的启发式算法[J]. 计算机应用, 2015, 35(10): 2733-2736.
WAN Xiaosong, WANG Zhihai, YUAN Jidong. Heuristic algorithms for paper index ranking based on sparse matrix. Journal of Computer Applications, 2015, 35(10): 2733-2736.
[1] PAGE L, BRIN S, MOTWANI R, et al. The PageRank citation ranking: bringing order to the Web[EB/OL]. [2014-10-10]. http://ilpubs.stanford.edu/422/1/1999-66.pdf. [2] LANGVILLE A N, MEYER C D. Google's PageRank and beyond: the science of search engine rankings[M]. Princeton: Princeton University Press, 2011:1-4. [3] QIU Z, FU T, WANG X. Develop its own search engine[M]. 2nd ed. Beijing: People's Posts and Telecommunications Press, 2010:4-6.(邱哲,符滔滔,王学松.开发自己的搜索引擎[M].2版.北京:人民邮电出版社,2010: 4-6.) [4] BRIN S, PAGE L. The anatomy of a large-scale hypertextual Web search engine[J]. Computer Networks and ISDN Systems,1998, 30(1): 107-117. [5] KLEINBERG J M. Authoritative sources in a hyperlinked environment[J]. Journal of the ACM, 1999, 46(5): 604-632. [6] MIHALCEA R, TARAU P, FIGA E. PageRank on semantic networks, with application to word sense disambiguation[C]//COLING 2004: Proceedings of the 20th International Conference on Computational Linguistics. New York: ACM Press, 2004: 1126. [7] ESULI A, SEBASTIANI F. Pageranking WordNet synsets: an application to opinion mining[EB/OL]. [2014-10-10]. http://www.cl.uni-heidelberg.de/courses/ws10/graphs/elefterios.pdf. [8] RICCI F, ROKACH L, SHAPIRA B, et al. Recommender systems handbook[M]. Berlin: Springer-Verlag, 2011:1-10. [9] HAVELIWALA T H. Topic-sensitive Pagerank[C]//Proceedings of the 11th International Conference on World Wide Web. New York: ACM Press, 2002: 517-526. [10] ZHANG J. It is search engine: detailed core technology [M]. Beijing: Publishing House of Electronics Industry, 2012:146-162. (张俊林.这就是搜索引擎:核心技术详解[M].北京:电子工业出版社,2012:146-162.) [11] HUANG D, QI H. Pagerank algorithm research[J]. Computer Engineering, 2006, 32(4): 145-146. [12] KAMVAR S, HAVELIWALA T, GOLUB G. Adaptive methods for the computation of PageRank[EB/OL]. [2014-10-10]. http://ilpubs.stanford.edu:8090/774/1/2003-26.pdf. [13] FRANCESCHET M. PageRank: standing on the shoulders of giants[J]. Communications of the ACM, 2011,542(6): 92-101. [14] EASLEY D, KLEINBERG J. Networks crowds and markets: reasoning about a highly connected world[M].Cambridge: Cambridge University Press,2010:397-417. [15] KURLAND O, LEE L. PageRank without hyperlinks: Structural reranking using links induced by language models[J]. ACM Transactions on Information Systems, 2010,26(4): 18. [16] LEMPEL R, MORAN S. The Stochastic Approach for Link-Structure Analysis (SALSA) and the TKC effect[J]. Computer Networks, 2000,11(1): 387-401. [17] BERKHIN P. A survey on PageRank computing[J]. Internet Mathematics, 2005,2(1): 73-120. [18] GENG S, QU W, ZHANG L. Discrete mathematics [M]. Beijing: Tsinghua University Press, 2004:162. (耿素云,屈婉玲,张立昂.离散数学[M].北京:清华大学出版社,2004:162.) [19] HE X, WU Q, WU Z. Comparative analysis of HITS algorithm PageRank algorithm [J]. Journal of Information, 2004,23(2):85-86. (何晓阳,吴强,吴治蓉.HITS 算法与 PageRank算法比较分析[J].情报杂志,2004,23(2):85-86.) [20] WAN X. PageRank algorithm and its application [EB/OL]. [2015-02-06]. http://download.csdn.net/detail/waxdhgj/8428995. (万晓松.网页排名算法及其应用[EB/OL].[2015-02-06]. http://download.csdn.net/detail/waxdhgj/8428995.) [21] LUO G. Technical combat secret search engine: Lucene & Java essentials [M]. Beijing: Publishing House of Electronics Industry, 2011:33-58.(罗刚.揭秘搜索引擎的技术实战:Lucene&Java精华版[M].北京:电子工业出版社,2011:33-58.)
2015, Vol. 35 
