Scalable Multi-view Clustering with Graph Filtering
With the explosive growth of multi-source data, multi-view clustering has attracted great attention in recent years. Most existing multi-view methods operate in raw feature space and heavily depend on the quality of original feature representation. Moreover, they are often designed for feature data and ignore the rich topology structure information. Accordingly, in this paper, we propose a generic framework to cluster both attribute and graph data with heterogeneous features. It is capable of exploring the interplay between feature and structure. Specifically, we first adopt graph filtering technique to eliminate high-frequency noise to achieve a clustering-friendly smooth representation. To handle the scalability challenge, we develop a novel sampling strategy to improve the quality of anchors. Extensive experiments on attribute and graph benchmarks demonstrate the superiority of our approach with respect to state-of-the-art approaches.
Code (1)
Tasks
AttributeClusteringSimilar Papers 제목 키워드 기반
Smoothed Multi-View Subspace Clustering
In recent years, multi-view subspace clustering has achieved impressive performance due to the exploitation of complementary imformation across multiple views. However, multi-view data can be very complicated and are not…
ClusteringMulti-view Subspace ClusteringMulti-view Contrastive Graph Clustering
With the explosive growth of information technology, multi-view graph data have become increasingly prevalent and valuable. Most existing multi-view clustering techniques either focus on the scenario of multiple graphs o…
ClusteringContrastive LearningGraph ClusteringCross-Contrastive Clustering for Multimodal Attributed Graphs with Dual Graph Filtering
Multimodal Attributed Graphs (MMAGs) are an expressive data model for representing the complex interconnections among entities that associate attributes from multiple data modalities (text, images, etc.). Clustering over…
Representation LearningContrastive LearningCommunity DetectionGraph ClusteringStructured Graph Learning for Scalable Subspace Clustering: From Single-view to Multi-view
Graph-based subspace clustering methods have exhibited promising performance. However, they still suffer some of these drawbacks: encounter the expensive time overhead, fail in exploring the explicit clusters, and cannot…
ClusteringGraph LearningScalable Incomplete Multi-View Clustering with Structure Alignment
The success of existing multi-view clustering (MVC) relies on the assumption that all views are complete. However, samples are usually partially available due to data corruption or sensor malfunction, which raises the re…
Clusteringgraph constructionGraph LearningIncomplete multi-view clustering