Identifying Smallest Unique Subgraphs in a Heterogeneous Social Network
Date Issued
2014
Date
2014
Author(s)
Wang, Yen-Kai
Abstract
This paper proposes to study a novel problem, discovering a Smallest Unique Subgraph (SUS) for any node of interest specified by user in a heterogeneous social network. The rationale of the SUS problem lies in how a person is different from any others in a social network, and how to represent the identity of a person using her surrounding relational structure in a social network. To deal with the proposed SUS problem, we develop an Ego-Graph Heuristic (EGH) method to efficiently solve the SUS problem in an approximated manner. EGH intelligently examine whether one graph is not isomorphic to the other, instead of using the conventional subgraph isomorphism test. We also prove SUS is a NP-complete problem through doing a reduction from Minimum Vertex Cover (MVC) in a homogeneous tree structure. Experimental results conducted on a real-world movie heterogeneous social network data show both the promising efficiency and compactness of our method.
Subjects
獨特
最小
子圖
異質性
全等
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-103-R01922023-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):da66a0fe0f16c2f04b4a76f2418965e2