HeteClass: A Meta-path based framework for transductive classification of objects in heterogeneous information networks

2017 ◽  
Vol 68 ◽  
pp. 106-122 ◽  
Author(s):  
Mukul Gupta ◽  
Pradeep Kumar ◽  
Bharat Bhasker
2016 ◽  
Vol 13 (10) ◽  
pp. 6747-6753
Author(s):  
Pingjian Ding ◽  
Xiangtao Chen ◽  
Zipin Guan

The goal of inductive classification approaches is to infer the correct mapping from test set to labels, while the goal of transductive inference is to predict the correct labels for the given unlabeled data. Hence, the increased unlabeled samples can’t be classified by transductive classification. In this paper, we focus on studying the inductive classification problems in heterogeneous networks, which involve multiple types of objects interconnected by multiple types of links. Moreover, the objects and the links are gradually increasing over time. To accommodate characteristics of heterogeneous networks, a meta-path-based heterogeneous inductive classification (Hic) was proposed. First, the different sub-networks were constructed according to the selected meta-path. Second, the characteristic paths of each sub-network were extracted via the specified minimum support, and were assigned appropriate weights. Then, Hic model based on characteristic path was built. Finally, the Hic scores of each classification label for each test sample was calculated via links between test samples and sub-networks. Experiments on the DBLP showed that the proposed method significantly improves the accuracy and stability over the existing state-of-the-art methods for classification in dynamic heterogeneous network.


Author(s):  
Phuc Do

Meta-path is an important concept of heterogeneous information networks (HINs). Meta-paths were used in many tasks such as information retrieval, decision making, and product recommendation. Normally meta-paths were proposed by human experts. Recently, works on meta-path discovery have proposed in-memory solutions that fit in one computer. With large HINs, the whole HIN cannot be loaded in the memory. In this chapter, the authors proposed distributed algorithms to discover meta-paths of large HINs on cloud. They develop the distributed algorithms to discover the significant meta-path, maximal significant meta-path, and top-k meta-paths between two vertices of HIN. Calculation of the support of meta-paths or performing breadth first search can be computational costly in very large HINs. Conveniently, the distributed algorithms utilize the GraphFrames library of Apache Spark on cloud computing environment to efficiently query large HINs. The authors conduct the experiments on large DBLP dataset to prove the performance of our algorithms on cloud.


2020 ◽  
Vol 127 ◽  
pp. 101790
Author(s):  
Jinli Zhang ◽  
Zongli Jiang ◽  
Yongping Du ◽  
Tong Li ◽  
Yida Wang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document