Proceedings of The 8th Asian Conference on Machine Learning, PMLR 63:270-285, 2016.
Abstract
Link prediction in multi-relational social networks has attracted much attention. For instance, we may care the chance of two users being friends based on their contacts of other patterns, e.g., SMS and phone calls. In previous work, matrix factorization models are typically applied in single-relational networks; however, two challenges arise to extend it into multi-relational networks. First, the interaction of different relation types is hard to be captured. The second is the cold start problem, as the prediction of new entities in multi-relational networks becomes even more challenging. In this article we propose a novel method called Hierarchical Probabilistic Matrix Factorization with Network Topology (HPMFNT). Our model exploits the network topology by extending the Katz index into multi-relational settings, which could efficiently model the multidimensional interplay via the auxiliary information from other relationships. We also utilize the extended Katz index along with entitiy attributes to solve the cold-start problem. Experiments on two real world datasets have shown that our model outperforms the state-of-the-art with a significant margin.
@InProceedings{pmlr-v63-bai103,
title = {Hierarchical Probabilistic Matrix Factorization with Network Topology for Multi-relational Social Network},
author = {Haoli Bai and Zenglin Xu and Bin Liu and Yingming Li},
booktitle = {Proceedings of The 8th Asian Conference on Machine Learning},
pages = {270--285},
year = {2016},
editor = {Robert J. Durrant and Kee-Eung Kim},
volume = {63},
series = {Proceedings of Machine Learning Research},
address = {The University of Waikato, Hamilton, New Zealand},
month = {16--18 Nov},
publisher = {PMLR},
pdf = {http://proceedings.mlr.press/v63/bai103.pdf},
url = {http://proceedings.mlr.press/v63/bai103.html},
abstract = {Link prediction in multi-relational social networks has attracted much attention. For instance, we may care the chance of two users being friends based on their contacts of other patterns, e.g., SMS and phone calls. In previous work, matrix factorization models are typically applied in single-relational networks; however, two challenges arise to extend it into multi-relational networks. First, the interaction of different relation types is hard to be captured. The second is the cold start problem, as the prediction of new entities in multi-relational networks becomes even more challenging. In this article we propose a novel method called Hierarchical Probabilistic Matrix Factorization with Network Topology (HPMFNT). Our model exploits the network topology by extending the Katz index into multi-relational settings, which could efficiently model the multidimensional interplay via the auxiliary information from other relationships. We also utilize the extended Katz index along with entitiy attributes to solve the cold-start problem. Experiments on two real world datasets have shown that our model outperforms the state-of-the-art with a significant margin.}
}
%0 Conference Paper
%T Hierarchical Probabilistic Matrix Factorization with Network Topology for Multi-relational Social Network
%A Haoli Bai
%A Zenglin Xu
%A Bin Liu
%A Yingming Li
%B Proceedings of The 8th Asian Conference on Machine Learning
%C Proceedings of Machine Learning Research
%D 2016
%E Robert J. Durrant
%E Kee-Eung Kim
%F pmlr-v63-bai103
%I PMLR
%J Proceedings of Machine Learning Research
%P 270--285
%U http://proceedings.mlr.press
%V 63
%W PMLR
%X Link prediction in multi-relational social networks has attracted much attention. For instance, we may care the chance of two users being friends based on their contacts of other patterns, e.g., SMS and phone calls. In previous work, matrix factorization models are typically applied in single-relational networks; however, two challenges arise to extend it into multi-relational networks. First, the interaction of different relation types is hard to be captured. The second is the cold start problem, as the prediction of new entities in multi-relational networks becomes even more challenging. In this article we propose a novel method called Hierarchical Probabilistic Matrix Factorization with Network Topology (HPMFNT). Our model exploits the network topology by extending the Katz index into multi-relational settings, which could efficiently model the multidimensional interplay via the auxiliary information from other relationships. We also utilize the extended Katz index along with entitiy attributes to solve the cold-start problem. Experiments on two real world datasets have shown that our model outperforms the state-of-the-art with a significant margin.
TY - CPAPER
TI - Hierarchical Probabilistic Matrix Factorization with Network Topology for Multi-relational Social Network
AU - Haoli Bai
AU - Zenglin Xu
AU - Bin Liu
AU - Yingming Li
BT - Proceedings of The 8th Asian Conference on Machine Learning
PY - 2016/11/20
DA - 2016/11/20
ED - Robert J. Durrant
ED - Kee-Eung Kim
ID - pmlr-v63-bai103
PB - PMLR
SP - 270
DP - PMLR
EP - 285
L1 - http://proceedings.mlr.press/v63/bai103.pdf
UR - http://proceedings.mlr.press/v63/bai103.html
AB - Link prediction in multi-relational social networks has attracted much attention. For instance, we may care the chance of two users being friends based on their contacts of other patterns, e.g., SMS and phone calls. In previous work, matrix factorization models are typically applied in single-relational networks; however, two challenges arise to extend it into multi-relational networks. First, the interaction of different relation types is hard to be captured. The second is the cold start problem, as the prediction of new entities in multi-relational networks becomes even more challenging. In this article we propose a novel method called Hierarchical Probabilistic Matrix Factorization with Network Topology (HPMFNT). Our model exploits the network topology by extending the Katz index into multi-relational settings, which could efficiently model the multidimensional interplay via the auxiliary information from other relationships. We also utilize the extended Katz index along with entitiy attributes to solve the cold-start problem. Experiments on two real world datasets have shown that our model outperforms the state-of-the-art with a significant margin.
ER -
Bai, H., Xu, Z., Liu, B. & Li, Y.. (2016). Hierarchical Probabilistic Matrix Factorization with Network Topology for Multi-relational Social Network. Proceedings of The 8th Asian Conference on Machine Learning, in PMLR 63:270-285
This site last compiled Mon, 29 May 2017 07:40:01 +0000