scholarly journals A Noval Weighted Meta Graph Method for Classification in Heterogeneous Information Networks

2020 ◽  
Vol 10 (5) ◽  
pp. 1603
Author(s):  
Jinli Zhang ◽  
Tong Li ◽  
Zongli Jiang ◽  
Xiaohua Hu ◽  
Ali Jazayeri
Keyword(s):  
Real World ◽  
Structural Features ◽  
Information Networks ◽  
Heterogeneous Information ◽  
Heterogeneous Information Networks ◽  
Real World Applications ◽  
Different Types ◽  
Multiple Challenges ◽  
Real World Datasets

There has been increasing interest in the analysis and mining of Heterogeneous Information Networks (HINs) and the classification of their components in recent years. However, there are multiple challenges associated with distinguishing different types of objects in HINs in real-world applications. In this paper, a novel framework is proposed for the weighted Meta graph-based Classification of Heterogeneous Information Networks (MCHIN) to address these challenges. The proposed framework has several appealing properties. In contrast to other proposed approaches, MCHIN can fully compute the weights of different meta graphs and mine the latent structural features of different nodes by using these weighted meta graphs. Moreover, MCHIN significantly enlarges the training sets by introducing the concept of Extension Meta Graphs in HINs. The extension meta graphs are used to augment the semantic relationship among the source objects. Finally, based on the ranking distribution of objects, MCHIN groups the objects into pre-specified classes. We verify the performance of MCHIN on three real-world datasets. As is shown and discussed in the results section, the proposed framework can effectively outperform the baselines algorithms.

scholarly journals Multityped Community Discovery in Time-Evolving Heterogeneous Information Networks Based on Tensor Decomposition

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jibing Wu ◽  
Lianfei Yu ◽  
Qun Zhang ◽  
Peiteng Shi ◽  
Lihua Liu ◽  
...  
Keyword(s):  
Real World ◽  
Tensor Decomposition ◽  
Information Networks ◽  
Community Discovery ◽  
Star Network ◽  
Heterogeneous Information ◽  
Heterogeneous Information Networks ◽  
General Network ◽  
Real World Datasets ◽  
Discovery Method

The heterogeneous information networks are omnipresent in real-world applications, which consist of multiple types of objects with various rich semantic meaningful links among them. Community discovery is an effective method to extract the hidden structures in networks. Usually, heterogeneous information networks are time-evolving, whose objects and links are dynamic and varying gradually. In such time-evolving heterogeneous information networks, community discovery is a challenging topic and quite more difficult than that in traditional static homogeneous information networks. In contrast to communities in traditional approaches, which only contain one type of objects and links, communities in heterogeneous information networks contain multiple types of dynamic objects and links. Recently, some studies focus on dynamic heterogeneous information networks and achieve some satisfactory results. However, they assume that heterogeneous information networks usually follow some simple schemas, such as bityped network and star network schema. In this paper, we propose a multityped community discovery method for time-evolving heterogeneous information networks with general network schemas. A tensor decomposition framework, which integrates tensor CP factorization with a temporal evolution regularization term, is designed to model the multityped communities and address their evolution. Experimental results on both synthetic and real-world datasets demonstrate the efficiency of our framework.

scholarly journals Introduction to the special issue on multilayer networks

2017 ◽  
Vol 5 (2) ◽  
pp. 141-143 ◽  
Author(s):  
MATTEO MAGNANI ◽  
STANLEY WASSERMAN
Keyword(s):  
Social Networks ◽  
Social Systems ◽  
Information Networks ◽  
Special Issue ◽  
Heterogeneous Information ◽  
Heterogeneous Information Networks ◽  
Wide Range ◽  
Different Types ◽  
Interconnected Networks ◽  
Multi Level

During the last century, networks of several types have been used to model a wide range of physical, biological and social systems. For example, Moreno (1934) studied social networks with multiple types of ties, later called multiplex networks (Verbrugge, 1979; Minor, 1983; Lazega & Pattison, 1999) as well as networks with multiple types of actors. Networks with multiple types of actors and relational ties have often been used together: relevant examples are the extensions of two-mode networks studied by Wasserman & Iacobucci (1991), multi-level networks (Lazega & Snijders, 2016), and heterogeneous information networks (Sun et al., 2012). More recently, researchers in physics and computer science have developed models for different types of interconnected networks known as networks of networks (Buldyrev et al., 2010; D'Agostino & Scala, 2014), multilayer social networks (Magnani & Rossi, 2011), and interconnected networks (Dickison et al., 2012).

Hierarchy construction and classification of heterogeneous information networks based on RSDAEf

2020 ◽  
Vol 127 ◽  
pp. 101790
Author(s):  
Jinli Zhang ◽  
Zongli Jiang ◽  
Yongping Du ◽  
Tong Li ◽  
Yida Wang ◽  
...  
Keyword(s):  
Information Networks ◽  
Heterogeneous Information ◽  
Heterogeneous Information Networks ◽  
Hierarchy Construction

scholarly journals TransPath: Representation Learning for Heterogeneous Information Networks via Translation Mechanism

2018 ◽  
Author(s):  
Yang Fang ◽  
Xiang Zhao ◽  
Zhen Tan
Keyword(s):  
Large Scale ◽  
Representation Learning ◽  
Information Networks ◽  
Heterogeneous Information ◽  
Structure Information ◽  
Heterogeneous Information Networks ◽  
Network Representation ◽  
Meta Path ◽  
Translation Mechanism ◽  
Real World Datasets

In this paper, we propose a novel network representation learning model TransPath to encode heterogeneous information networks (HINs). Traditional network representation learning models aim to learn the embeddings of a homogeneous network. TransPath is able to capture the rich semantic and structure information of a HIN via meta-paths. We take advantage of the concept of translation mechanism in knowledge graph which regards a meta-path, instead of an edge, as a translating operation from the first node to the last node. Moreover, we propose a user-guided meta-path sampling strategy which takes users' preference as a guidance, which could explore the semantics of a path more precisely, and meanwhile improve model efficiency via the avoidance of other noisy and meaningless meta-paths. We evaluate our model on two large-scale real-world datasets DBLP and YELP, and two benchmark tasks similarity search and node classification. We observe that TransPath outperforms other state-of-the-art baselines consistently and significantly.

scholarly journals A Tensor CP Decomposition Method for Clustering Heterogeneous Information Networks via Stochastic Gradient Descent Algorithms

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Jibing Wu ◽  
Zhifei Wang ◽  
Yahui Wu ◽  
Lihua Liu ◽  
Su Deng ◽  
...  
Keyword(s):  
Real World ◽  
Decomposition Method ◽  
Gradient Descent ◽  
Stochastic Gradient ◽  
Information Networks ◽  
Stochastic Gradient Descent ◽  
Heterogeneous Information ◽  
Descent Algorithms ◽  
Heterogeneous Information Networks ◽  
Cp Decomposition

Clustering analysis is a basic and essential method for mining heterogeneous information networks, which consist of multiple types of objects and rich semantic relations among different object types. Heterogeneous information networks are ubiquitous in the real-world applications, such as bibliographic networks and social media networks. Unfortunately, most existing approaches, such as spectral clustering, are designed to analyze homogeneous information networks, which are composed of only one type of objects and links. Some recent studies focused on heterogeneous information networks and yielded some research fruits, such as RankClus and NetClus. However, they often assumed that the heterogeneous information networks usually follow some simple schemas, such as bityped network schema or star network schema. To overcome the above limitations, we model the heterogeneous information network as a tensor without the restriction of network schema. Then, a tensor CP decomposition method is adapted to formulate the clustering problem in heterogeneous information networks. Further, we develop two stochastic gradient descent algorithms, namely, SGDClus and SOSClus, which lead to effective clustering multityped objects simultaneously. The experimental results on both synthetic datasets and real-world dataset have demonstrated that our proposed clustering framework can model heterogeneous information networks efficiently and outperform state-of-the-art clustering methods.

scholarly journals Link Trustworthiness Evaluation over Multiple Heterogeneous Information Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Meng Wang ◽  
Xu Qin ◽  
Wei Jiang ◽  
Chunshu Li ◽  
Guilin Qi
Keyword(s):  
Real World ◽  
Evaluation Model ◽  
Information Networks ◽  
Information Network ◽  
Training Procedure ◽  
Heterogeneous Information Network ◽  
Heterogeneous Information ◽  
Heterogeneous Information Networks ◽  
Proposed Model ◽  
Downstream Analysis

Link trustworthiness evaluation is a crucial task for information networks to evaluate the probability of a link being true in a heterogeneous information network (HIN). This task can significantly influence the effectiveness of downstream analysis. However, the performance of existing evaluation methods is limited, as they can only utilize incomplete or one-sided information from a single HIN. To address this problem, we propose a novel multi-HIN link trustworthiness evaluation model that leverages information across multiple related HINs to accomplish link trustworthiness evaluation tasks inherently and efficiently. We present an effective method to evaluate and select informative pairs across HINs and an integrated training procedure to balance inner-HIN and inter-HIN trustworthiness. Experiments on a real-world dataset demonstrate that our proposed model outperforms baseline methods and achieves the best accuracy and F1-score in downstream tasks of HINs.

A flexible aggregation framework on large-scale heterogeneous information networks

2016 ◽  
Vol 43 (2) ◽  
pp. 186-203 ◽  
Author(s):  
Dan Yin ◽  
Hong Gao
Keyword(s):  
Large Scale ◽  
Linear Time ◽  
Information Networks ◽  
Heterogeneous Information ◽  
Heterogeneous Information Networks ◽  
Aggregation Problem ◽  
On Line ◽  
Real World Datasets ◽  
Two Phases ◽  
Time And Space Complexity

OLAP (On-line Analytical Processing) can provide users with aggregate results from different perspectives and granularities. With the advent of heterogeneous information networks that consist of multi-type, interconnected nodes, such as bibliographic networks and knowledge graphs, it is important to study flexible aggregation in such networks. The aggregation results by existing work are limited to one type of node, which cannot be applied to aggregation on multi-type nodes, and relations in large-scale heterogeneous information networks. In this paper, we investigate the flexible aggregation problem on large-scale heterogeneous information networks, which is defined on multi-type nodes and relations. Moreover, by considering both attributes and structures, we propose a novel function based on graph entropy to measure the similarities of nodes. Further, we prove that the aggregation problem based on the function is NP-hard. Therefore, we develop an efficient heuristic algorithm for aggregation in two phases: informational aggregation and structural aggregation. The algorithm has linear time and space complexity. Extensive experiments on real-world datasets demonstrate the effectiveness and efficiency of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document