skip to main content
10.1145/2567948.2579034acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article

ACRec: a co-authorship based random walk model for academic collaboration recommendation

Authors Info & Claims
Published:07 April 2014Publication History

ABSTRACT

Recent academic procedures have depicted that work involving scientific research tends to be more prolific through collaboration and cooperation among researchers and research groups. On the other hand, discovering new collaborators who are smart enough to conduct joint-research work is accompanied with both difficulties and opportunities. One notable difficulty as well as opportunity is the big scholarly data. In this paper, we satisfy the demand of collaboration recommendation through co-authorship in an academic network. We propose a random walk model using three academic metrics as basics for recommending new collaborations. Each metric is studied through mutual paper co-authoring information and serves to compute the link importance such that a random walker is more likely to visit the valuable nodes. Our experiments on DBLP dataset show that our approach can improve the precision, recall rate and coverage rate of recommendation, compared with other state-of-the-art approaches.

References

  1. L. Backstrom and J. Leskovec. Supervised random walks: Predicting and recommending links in social networks. In Proc. of ACM WSDM'11, pages 635--644, Hong Kong, China, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. M. Boyd and N. B. Ellison. Social network sites: Definition, history, and scholarship. Journal of Computer-Mediated Communication, 13(1):210--230, 2007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. A. Brandao, M. M. Moro, G. R. Lopes, and J. P. Oliveira. Using link semantics to recommend collaborations in academic social networks. In Proc. of WWW'13 Companion, pages 833--840, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. H.-H. Chen, L. Gou, X. Zhang, and C. L. Giles. Collabseer: A search engine for collaboration discovery. In Proc. of ACM/IEEE JCDL'11, pages 231--240, Ottawa, Ontario, Canada, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19(3):355--369, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Freyne, S. Berkovsky, E. M. Daly, and W. Geyer. Social networking feeds: Recommending items of interest. In Proc. of ACM RecSys'10, pages 277--280. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Jamali and M. Ester. Trustwalker: A random walk model for combining trust-based and item-based recommendation. In Proc. of ACM KDD'09, pages 397--406, Paris, France, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Lee and B. Bozeman. The impact of research collaboration on scientific productivity. Social Studies of Science, 35(5):673--702, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  9. M. Ley. Dblp: some lessons learned. Proceedings of the VLDB Endowment, 2(2):1493--1500, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. G. Lopes, M. M. Moro, L. K. Wives, and J. P. M. de Oliveira. Collaboration recommendation on academic social networks. In Advances in Conceptual Modeling IC Applications and Challenges, volume 6413 of Lecture Notes in Computer Science, pages 190--199. Springer Berlin Heidelberg, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. H. Ma, D. Zhou, C. Liu, M. R. Lyu, and I. King. Recommender systems with social regularization. In Proc. of ACM WSDM'11, pages 287--296, Hong Kong, China, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. E. J. Newman. Scientific collaboration networks. i. network construction and fundamental results. Physical Review E, 64(1):016131, Jun 2001.Google ScholarGoogle ScholarCross RefCross Ref
  13. S. Perugini, M. A. Goncalves, and E. A. Fox. Recommender systems research: A connection-centric survey. Journal of Intelligent Information Systems, 23(2):107--143, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Tang, S. Wu, J. Sun, and H. Su. Cross-domain collaboration recommendation. In Proc. of ACM KDD'12, pages 1285--1293, Beijing, China, 2012. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su. Arnetminer: extraction and mining of academic social networks. In Proc. of ACM KDD'08, pages 990--998, Las Vegas, Nevada, USA, 2008. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. H. Tong, C. Faloutsos, and J.-Y. Pan. Random walk with restart: Fast solutions and applications. Knowledge and Information Systems, 14(3):327--346, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. A. Toscher, M. Jahrer, and R. Legenstein. Improved neighborhood-based algorithms for large-scale recommender systems. In Proc. of NETFLIX'08, pages 4:1--4:6, Las Vegas, Nevada, 2008. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. ACRec: a co-authorship based random walk model for academic collaboration recommendation

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        WWW '14 Companion: Proceedings of the 23rd International Conference on World Wide Web
        April 2014
        1396 pages
        ISBN:9781450327459
        DOI:10.1145/2567948

        Copyright © 2014 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 7 April 2014

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,899of8,196submissions,23%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader