TY - JOUR
T1 - MixSp: A Framework for Embedding Heterogeneous Information Networks with Arbitrary Number of Node and Edge Types
AU - Xu, Linchuan
AU - Wang, Jing
AU - He, Lifang
AU - Cao, Jiannong
AU - Wei, Xiaokai
AU - Yu, Philip S.
AU - Yamanishi, Kenji
N1 - Funding Information:
This work was partially supported by JST KAKENHI 19H01114 and JST-AIP JPMJCR19U4, NSF under Grants III-1526499, III-1763325, III-1909323, and CNS-1930941, NSF of Guangdong Province through grant 2017A030313339, the HK RGC Collaborative Research Fund (CRF), Project No. C5026-18G, the HK RGC Collaborative Research Fund (CRF), Project No. C6030-18G, the HK RGC General Research Fund (GRF), PolyU 152199/17E.
Publisher Copyright:
© 1989-2012 IEEE.
PY - 2021/6/1
Y1 - 2021/6/1
N2 - Heterogeneous information network (HIN) embedding is to encode network structure into node representations with the heterogeneous semantics of different node and edge types considered. However, since each HIN may have a unique nature, e.g., a unique set of node and edge types, a model designed for one type of networks may not be applicable to or effective on another type. In this article, we thus attempt to propose a framework for HINs with arbitrary number of node and edge types. The proposed framework constructs a novel mixture-split representation of an HIN, and hence is named as MixSp. The mixture sub-representation and the split sub-representation serve as two different views of the network. Compared with existing models which only learn from the original view, MixSp thus may exploit more comprehensive information. Node representations in each view are learned by embedding the respective network structure. Moreover, the node representations are further refined through cross-view co-regularization. The framework is instantiated in three models which differ from each other in the co-regularization. Extensive experiments on three real-world datasets show MixSp outperforms several recent models in both node classification and link prediction tasks even though MixSp is not designed for a particular type of HINs.
AB - Heterogeneous information network (HIN) embedding is to encode network structure into node representations with the heterogeneous semantics of different node and edge types considered. However, since each HIN may have a unique nature, e.g., a unique set of node and edge types, a model designed for one type of networks may not be applicable to or effective on another type. In this article, we thus attempt to propose a framework for HINs with arbitrary number of node and edge types. The proposed framework constructs a novel mixture-split representation of an HIN, and hence is named as MixSp. The mixture sub-representation and the split sub-representation serve as two different views of the network. Compared with existing models which only learn from the original view, MixSp thus may exploit more comprehensive information. Node representations in each view are learned by embedding the respective network structure. Moreover, the node representations are further refined through cross-view co-regularization. The framework is instantiated in three models which differ from each other in the co-regularization. Extensive experiments on three real-world datasets show MixSp outperforms several recent models in both node classification and link prediction tasks even though MixSp is not designed for a particular type of HINs.
KW - heterogeneous information networks
KW - link prediction
KW - multi-label classification
KW - Network embedding
UR - http://www.scopus.com/inward/record.url?scp=85094676791&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2019.2955945
DO - 10.1109/TKDE.2019.2955945
M3 - Journal article
AN - SCOPUS:85094676791
SN - 1041-4347
VL - 33
SP - 2627
EP - 2639
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 6
M1 - 8913597
ER -