skip to main content
10.1145/1367497.1367722acmconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
poster

Extraction and mining of an academic social network

Published:21 April 2008Publication History

ABSTRACT

This paper addresses several key issues in extraction and mining of an academic social network: 1) extraction of a researcher social network from the existing Web; 2) integration of the publications from existing digital libraries; 3) expertise search on a given topic; and 4) association search between researchers. We developed a social network system, called ArnetMiner, based on proposed methods to the above problems. In total, 448,470 researcher profiles and 981,599 publications were extracted/integrated after the system having been in operation for two years. The paper describes the architecture and main features of the system. It also briefly presents the experimental results of the proposed methods.

References

  1. D. Blei, A. Ng, and M. Jordan. Latent Dirichlet Allocation. Journal of Machine Learning Research, 2003, 3, 993--1022. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Brickley and L. Miller, FOAF vocabulary specification, namespace document, 2004. http://xmlns.com/foaf/0.1/.Google ScholarGoogle Scholar
  3. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: probabilistic models for segmenting and labeling sequence data. Proc. of ICML'2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Y. F. Tan, M. Kan, and D. Lee. Search engine driven author disambiguation. Proc. of JCDL'2006. pp. 314--315. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Tang, D. Zhang, and L. Yao. Social network extraction of academic researchers. Proc. of ICDM'2007. pp. 292--301 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Zhang, J. Tang, J. Li, and K. Wang. A constraint-based probabilistic framework for name disambiguation. Proc. of CIKM'2007. pp. 1019--1022 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Zhang, J. Tang, L. Liu, and J. Li. A mixture model for expert finding. Proc. of PAKDD'2008. (to appear) Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Extraction and mining of an academic social network

        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 Conferences
          WWW '08: Proceedings of the 17th international conference on World Wide Web
          April 2008
          1326 pages
          ISBN:9781605580852
          DOI:10.1145/1367497

          Copyright © 2008 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: 21 April 2008

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • poster

          Acceptance Rates

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

          Upcoming Conference

          WWW '24
          The ACM Web Conference 2024
          May 13 - 17, 2024
          Singapore , Singapore

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader