Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Google scholar. http://scholar.google.com
Microsoft academic. https://academic.microsoft.com/
Aminer. https://aminer.org/
McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Ann. Rev. Sociol. 27(1), 415–444 (2001)
Filippo, R., Claudio, C.: Defining and identifying communities in networks. Proc. Nat. Acad. Sci. U.S.A 101(9), 2658–2663 (2004)
Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. U.S.A 99(12), 7821 (2002)
Darrin, E., Bo-June (Paul), H.: Microsoft academic graph. http://research.microsoft.com/en-us/projects/mag/
Newman, M.E.: Fast algorithm for detecting community structure in networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 69(6), 066 133 (2004)
Newman, M.E.J.: Detecting community structure in networks. Eur. Phys. J. B Condens. Matter Complex Syst. 38(2), 321–330 (2004)
Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Nat. Acad. Sci. U.S.A 105, 1118 (2008)
Bao, F., Licheng, J., Maoguo, G., Haifeng, D.: Memetic algorithm for community detection in networks (2011)
Usha Nandini, R., Reka, A., Soundar R T, K.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)
Pagerank: U.S. Patent 6 285 999
Jon, K.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999)
Haveliwala, T.H.: Topic-sensitive pagerank. In: Proceedings of the 11th International Conference on World Wide Web (WWW 2002), pp. 517–526. ACM, New York (2002)
Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1978)
Hatcher, E., Gospodnetic, O.: Lucene in action (in action series) (2004)
Hearst, M.A.: Tilebars: visualization of term distribution information in full text information access. In: Sigchi Conference on Human Factors in Computing Systems, pp. 631 – 637 (1995)
Page, L.: The pagerank citation ranking: Bringing order to the web. In: Stanford InfoLab, pp. 1–14 (1998)
Acknowledgements
This work was partially supported by the National Natural Science Foundation of China (Grant Nos. 61373128, 91218302, 61321491), the Key Project of Jiangsu Research Program Grant (No. BE2013116), the EU FP7 IRSES MobileCloud Project (Grant No. 612212).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, Q., Li, W., Zhang, X., Lu, S. (2016). Academic Paper Recommendation Based on Community Detection in Citation-Collaboration Networks. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds) Web Technologies and Applications. APWeb 2016. Lecture Notes in Computer Science(), vol 9932. Springer, Cham. https://doi.org/10.1007/978-3-319-45817-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-45817-5_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45816-8
Online ISBN: 978-3-319-45817-5
eBook Packages: Computer ScienceComputer Science (R0)