Learning Distilled Graph for Large-Scale Social Network Data Clustering
- 8 March 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 32 (7) , 1393-1404
Abstract
Spectral analysis is critical in social network analysis. As a vital step of the spectral analysis, the graph construction in many existing works utilizes content data only. Unfortunately, the content data often consists of noisy, sparse, and redundant features, which makes the resulting graph unstable and unreliable. In practice, besides the content data, social networks also contain link information, which provides additional information for graph construction. Some of previous works utilize the link data. However, the link data is often incomplete, which makes the resulting graph incomplete. To address these issues, we propose a Distilled Graph Clustering (DGC) method. It pursuits a distilled graph based on both the content data and the link data. The proposed algorithm alternates between two steps: in the feature selection step, it finds the most representative feature subset w.r.t. an intermediate graph initialized with link data; in graph distillation step, the proposed method updates and refines the graph based on only the selected features. The final resulting graph, which is referred to as the distilled graph, is then utilized for spectral clustering on the large-scale social network data. Extensive experiments demonstrate the superiority of the proposed method.Keywords
Funding Information
- Intelligence Advanced Research Projects Activity (D17PC00340)
This publication has 29 references indexed in Scilit:
- Unsupervised Streaming Feature Selection in Social Media2015
- Spectral Embedding of Signed Networks2015
- Graph-Based Semi-supervised Feature Selection for Social Media Data2014
- An Unsupervised Feature Selection Framework for Social Media DataIEEE Transactions on Knowledge and Data Engineering, 2014
- Unsupervised feature selection for linked social media data2012
- Towards feature selection in network2011
- Birds of a Feather: Homophily in Social NetworksAnnual Review of Sociology, 2001
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming ProblemsSIAM Journal on Optimization, 1993
- Network Studies of Social InfluenceSociological Methods & Research, 1993