SCHAIN-IRAM: An Efficient and Effective Semi-Supervised Clustering Algorithm for Attributed Heterogeneous Information Networks

A heterogeneous information network (HIN) is one whose nodes model objects of different types and whose links model objects' relationships. To enrich its information, objects in an HIN are typically associated with additional attributes. We call such an HIN an Attributed HIN or AHIN. We study t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on knowledge and data engineering Vol. 34; no. 4; pp. 1980 - 1992
Main Authors: Li, Xiang, Wu, Yao, Ester, Martin, Kao, Ben, Wang, Xin, Zheng, Yudian
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
attributed heterogeneous information network
Clustering
Clustering algorithms
Computer science
Data mining
Data models
Eigenvectors
Facebook
Iterative methods
Linear programming
network structure
object attributes
Semi-supervised clustering
Task analysis
ISSN:1041-4347, 1558-2191
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A heterogeneous information network (HIN) is one whose nodes model objects of different types and whose links model objects' relationships. To enrich its information, objects in an HIN are typically associated with additional attributes. We call such an HIN an Attributed HIN or AHIN. We study the problem of clustering objects in an AHIN, taking into account objects' similarities with respect to both object attribute values and their structural connectedness in the network. We show how supervision signal, expressed in the form of a must-link set and a cannot-link set , can be leveraged to improve clustering results. We put forward the SCHAIN algorithm to solve the clustering problem, and two highly efficient variants, SCHAIN-PI and SCHAIN-IRAM, which employ the power iteration based method and the implicitly restarted Arnoldi method respectively to compute eigenvectors of a matrix. We conduct extensive experiments comparing SCHAIN-based algorithms with other state-of-the-art clustering algorithms. Our results show that SCHAIN-IRAM outperforms other competitors in terms of clustering effectiveness and is highly efficient.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2020.2997938