skip to main content
10.1145/2124295.2124373acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

When will it happen?: relationship prediction in heterogeneous information networks

Authors Info & Claims
Published:08 February 2012Publication History

ABSTRACT

Link prediction, i.e., predicting links or interactions between objects in a network, is an important task in network analysis. Although the problem has attracted much attention recently, there are several challenges that have not been addressed so far. First, most existing studies focus only on link prediction in homogeneous networks, where all objects and links belong to the same type. However, in the real world, heterogeneous networks that consist of multi-typed objects and relationships are ubiquitous. Second, most current studies only concern the problem of whether a link will appear in the future but seldom pay attention to the problem of when it will happen. In this paper, we address both issues and study the problem of predicting when a certain relationship will happen in the scenario of heterogeneous networks. First, we extend the link prediction problem to the relationship prediction problem, by systematically defining both the target relation and the topological features, using a meta path-based approach. Then, we directly model the distribution of relationship building time with the use of the extracted topological features. The experiments on citation relationship prediction between authors on the DBLP network demonstrate the effectiveness of our methodology.

References

  1. L. A. Adamic and E. Adar. Friends and neighbors on the web. SOCIAL NETWORKS, 25:211--230, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  2. A. L. Barabasi, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, and T. Vicsek. Evolution of the social network of scientific collaborations. arXiv:cond-mat/0104162v1, Apr 2001.Google ScholarGoogle Scholar
  3. A. P. Bradley. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition, 30(7):1145--1159, July 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. B. Bringmann, M. Berlingerio, F. Bonchi, and A. Gionis. Learning and predicting the evolution of social networks. IEEE Intelligent Systems, 25:26--35, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  5. A. J. Dobson. An Introduction to Generalized Linear Models, Second Edition. Chapman & Hall/CRC, November 2001.Google ScholarGoogle Scholar
  6. L. Getoor and C. P. Diehl. Link mining: a survey. SIGKDD Explor. Newsl., 7:3--12, December 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. A. Hasan, V. Chaoji, S. Salem, and M. Zaki. Link prediction using supervised learning. In Proc. of SDM '06 workshop on Link Analysis, Counterterrorism and Security, 2006.Google ScholarGoogle Scholar
  8. Z. Huang and D. K. J. Lin. The time-series link prediction problem with applications in communication surveillance. INFORMS J. on Computing, 21:286--303, April 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39--43, 1953.Google ScholarGoogle ScholarCross RefCross Ref
  10. V. Leroy, B. B. Cambazoglu, and F. Bonchi. Cold start link prediction. In KDD '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. W.-k. Leung, E.-P. Lim, D. Lo, and J. Weng. Mining interesting link formation rules in social networks. In CIKM '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM '03, pages 556--559, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. N. Lichtenwalter, J. T. Lussier, and N. V. Chawla. New perspectives and methods in link prediction. In KDD '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M. E. J. Newman. Clustering and preferential attachment in growing networks. Physical Review Letters E, 64, 2001.Google ScholarGoogle Scholar
  15. A. Popescul, R. Popescul, and L. H. Ungar. Statistical relational learning for link prediction. In Proc. of the Workshop on Learning Statistical Models from Relational Data at IJCAI-2003, 2003.Google ScholarGoogle Scholar
  16. Y. Sun, R. Barber, M. Gupta, C. C. Aggarwal, and J. Han. Co-author relationship prediction in heterogeneous bibliographic networks. In ASONAM'11, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu. Pathsim: Meta path-based top-k similarity search in heterogeneous information networks. In VLDB'11, 2011.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su. Arnetminer: extraction and mining of academic social networks. In KDD '08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. B. Taskar, M. fai Wong, P. Abbeel, and D. Koller. Link prediction in relational data. In NIP '03, 2003.Google ScholarGoogle Scholar
  20. T. Tylenda, R. Angelova, and S. Bedathur. Towards time-aware link prediction in evolving social networks. In Proceedings of the 3rd Workshop on Social Network Mining and Analysis, SNA-KDD '09, pages 9:1--9:10, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. C. Wang, V. Satuluri, and S. Parthasarathy. Local probabilistic models for link prediction. In ICDM '07, pages 322--331, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. When will it happen?: relationship prediction in heterogeneous information networks

    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
      WSDM '12: Proceedings of the fifth ACM international conference on Web search and data mining
      February 2012
      792 pages
      ISBN:9781450307475
      DOI:10.1145/2124295

      Copyright © 2012 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: 8 February 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate498of2,863submissions,17%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader