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, <i>heterogeneous networks</i> that consist of multi-typed objects and relationships are ubiquitous. Second, most current studies only concern the problem of <i>whether</i> a link will appear in the future but seldom pay attention to the problem of <i>when</i> it will happen. In this paper, we address both issues and study the problem of <i>predicting when a certain relationship will happen in the scenario of heterogeneous networks</i>. 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.
%0 Conference Paper
%1 sun2012happen
%A Sun, Yizhou
%A Han, Jiawei
%A Aggarwal, Charu C.
%A Chawla, Nitesh V.
%B Proceedings of the fifth ACM international conference on Web search and data mining
%C New York, NY, USA
%D 2012
%I ACM
%K heterogeneous link multigraph prediction
%P 663--672
%R 10.1145/2124295.2124373
%T When will it happen?: relationship prediction in heterogeneous information networks
%U http://doi.acm.org/10.1145/2124295.2124373
%X 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, <i>heterogeneous networks</i> that consist of multi-typed objects and relationships are ubiquitous. Second, most current studies only concern the problem of <i>whether</i> a link will appear in the future but seldom pay attention to the problem of <i>when</i> it will happen. In this paper, we address both issues and study the problem of <i>predicting when a certain relationship will happen in the scenario of heterogeneous networks</i>. 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.
%@ 978-1-4503-0747-5
@inproceedings{sun2012happen,
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, <i>heterogeneous networks</i> that consist of multi-typed objects and relationships are ubiquitous. Second, most current studies only concern the problem of <i>whether</i> a link will appear in the future but seldom pay attention to the problem of <i>when</i> it will happen. In this paper, we address both issues and study the problem of <i>predicting when a certain relationship will happen in the scenario of heterogeneous networks</i>. 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.},
acmid = {2124373},
added-at = {2013-01-22T15:27:54.000+0100},
address = {New York, NY, USA},
author = {Sun, Yizhou and Han, Jiawei and Aggarwal, Charu C. and Chawla, Nitesh V.},
biburl = {https://www.bibsonomy.org/bibtex/2840161462e8772545ccee683dd9b2c62/folke},
booktitle = {Proceedings of the fifth ACM international conference on Web search and data mining},
description = {When will it happen?},
doi = {10.1145/2124295.2124373},
interhash = {b3183e3aea153b51352b0820bf12227f},
intrahash = {840161462e8772545ccee683dd9b2c62},
isbn = {978-1-4503-0747-5},
keywords = {heterogeneous link multigraph prediction},
location = {Seattle, Washington, USA},
numpages = {10},
pages = {663--672},
publisher = {ACM},
series = {WSDM '12},
timestamp = {2013-01-22T15:27:54.000+0100},
title = {When will it happen?: relationship prediction in heterogeneous information networks},
url = {http://doi.acm.org/10.1145/2124295.2124373},
year = 2012
}