Academic Paper Recommendation Based on Community Detection in Citation-Collaboration Networks

Academic search engine plays an important role for science research activities. One of the most important issues of academic search is paper recommendation, which intends to recommend the most valuable literature in a domain area to the users. In this paper, we show that exploring the relationship of collaboration between authors and the citation between publications can reveal implicit relevance between papers. By studying the community structure of the citation-collaboration network, we propose two paper recommendation algorithms called Adaptive and Random Walk, which comprehensively consider several metrics such as textural similarity, author similarity, closeness, and influence for paper recommendation. We implement an academic paper recommendation system based on the dataset from Microsoft Academic Graph. Performance evaluation based on the assessments of 20 volunteers show that the proposed paper recommendation methods outperform the conventional search engine algorithm such as PageRank. The efficiency of the proposed algorithms are verified by evaluation.

[1]  Yangyang Li,et al.  An improved memetic algorithm for community detection in complex networks , 2012, 2012 IEEE Congress on Evolutionary Computation.

[2]  Marti A. Hearst TileBars: visualization of term distribution information in full text information access , 1995, CHI '95.

[3]  Maoguo Gong,et al.  Memetic algorithm for community detection in networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Taher H. Haveliwala Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[5]  L. Freeman Centrality in social networks conceptual clarification , 1978 .

[6]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[7]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[8]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[12]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1999, SODA '98.

[13]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[14]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Otis Gospodnetic,et al.  Lucene in Action (In Action series) , 2004 .