skip to main content
10.1145/1348549.1348558acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

DBconnect: mining research community on DBLP data

Published:12 August 2007Publication History

ABSTRACT

Extracting information from large collections of structured, semi-structured or even unstructured data can be a considerable challenge when much of the hidden information is implicit within relationships among entities within the data. Social networks are such data collections in which relationships play a vital role in the knowledge these networks can convey. A bibliographic database is an essential tool for the research community, yet finding and making use of relationships comprised within such a social network is difficult. In this paper we introduce DBconnect, a prototype that exploits the social network coded within the DBLP database by drawing on a new random walk approach to reveal interesting knowledge about the research community and even recommend collaborations.

References

  1. Sergey Brin and Lawrence Page. The anatomy of a large-scale hypertextual web search engine. In Seventh International World Wide Web Conference, pages 107--117, Brisbane, Australia, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. DBLP Bibliography database. http://www.informatik.uni-trier.de/~ley/db/.Google ScholarGoogle Scholar
  3. AnHai Doan, Raghu Ramakrishnan, Fei Chen, Pedro DeRose, Yoonkyong Lee, Robert McCann, Mayssam Sayyadian, and Warren Shen. Community information management. IEEE Data Engineering Bulletin, Special Issue on Probabilistic Databases, 29(1), 2006.Google ScholarGoogle Scholar
  4. Michelle Girvan and M. E. J. Newman. Community structure in social and biological networks. In Proceedings of the National Academy of Science USA, 99:8271-8276, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  5. Taher H. Haveliwala. Topic-sensitive pagerank. In WWW: Proceedings of the 11th international conference on World Wide Web, pages 517--526, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Jingrui He, Mingjing Li, Hong-Jiang Zhang, Hanghang Tong, and Changshui Zhang. Manifold-ranking based image retrieval. In MULTIMEDIA: Proceedings of the 12th annual ACM international conference on Multimedia, pages 9--16, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. Holme, M. Huss, and H. Jeong. Subnetwork hierarchies of biochemical pathways. Bioinformatics, 19:532--538, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  8. Glen Jeh and Jennifer Widom. Simrank: a measure of structural-context similarity. In KDD, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. George Karypis and Vipin Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distriuted Computing, 48(1):96--129, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49:291--307, 1970.Google ScholarGoogle ScholarCross RefCross Ref
  11. Stefan Klink, Patrick Reuther, Alexander Weber, Bernd Walter, and Michael Ley. Analysing social networks within bibliographical data. In DEXA, pages 234--243, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Michael Ley. The DBLP computer science bibliography: Evolution, research issues, perspectives. In SPIRE, pages 1--10, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Sillvio Cesar Cazella and Luis Otavio Campos Alvares. An architecture based on multi-agent system and data mining for recommending research papers and researchers. In Proc. of the 18th International Conference on Software Engineering and Knowledge Engineering (SEKE), pages 67--72, 2006.Google ScholarGoogle Scholar
  14. Mario A. Nascimento, Joorg Sander, and Jeffrey Pound. Analysis of sigmod's co-authorship graph. SIGMOD Record, 32(2):57--58, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167--256, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web. In Technical report, Stanford University Database Group, 1998.Google ScholarGoogle Scholar
  17. Jia-Yu Pan, Hyung-Jeong Yang, Christos Faloutsos, and Pinar Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653--658, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Pothen, H. Simon, and K. P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11:430--452, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Filippo Radicchi, Claudio Castellano, Federico Cecconi, Vittorio Loreto, and Domenico Parisi. Defining and identifying communities in networks. PROC.NATL.ACAD.SCI.USA, 101:2658, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  20. A. F. Smeaton, G. Keogh, C. Gurrin, K. McDonald, and T. Sodring. Analysis of papers from twenty-five years of sigir conferences: What have we been doing for the last quarter of a century. SIGIR Forum, 36(2):39--43, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Gilbert Strang. Introduction to linear algebra, Wellesley-Cambridge Press, 3 Edition, 1998.Google ScholarGoogle Scholar
  22. Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, and Christos Faloutsos. Neighborhood formation and anomaly detection in bipartite graphs. In ICDM, pages 418--425, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Hanghang Tong, Christos Faloutsos, and Jia-Yu Pan. Fast random walk with restart and its applications. In ICDM, pages 613--622, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Joshua R. Tyler, Dennis M. Wilkinson, and Bernardo A. Huberman. Email as spectroscopy: automated discovery of community structure within organizations. Communities and technologies, pages 81--96, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. S. Wasserman and K. Faust. Social network analysis: Methods and applications, Cambridge University Press, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  1. DBconnect: mining research community on DBLP data

    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
      WebKDD/SNA-KDD '07: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
      August 2007
      125 pages
      ISBN:9781595938480
      DOI:10.1145/1348549

      Copyright © 2007 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: 12 August 2007

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Upcoming Conference

      KDD '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader