Proceedings of the AAAI Conference on Artificial Intelligence · 2024 · 13 citations · 27 references
ComputingData ScienceBig Data AnalyticsData VisualizationFeature EngineeringDimensionality ReductionGraph Feature EngineeringGraph MiningGraph-based LearningMatrix FactorizationCluster AssignmentClusteringClustering For Large-scale DataEmbedding LearningGraph Feature SelectionGraph-based Feature SelectionLarge-scale Data ProcessingMulti-view Clustering
Recently, anchor graph-based multi-view clustering has been proven to be highly efficient for large-scale data processing. However, most existing anchor graph-based clustering methods necessitate post-processing to obtain clustering labels and are unable to effectively utilize the information within anchor graphs. To solve these problems, we propose an Embedded Feature Selection on Graph-Based Multi-View Clustering (EFSGMC) approach to improve the clustering performance. Our method decomposes anchor graphs, taking advantage of memory efficiency, to obtain clustering labels in a single step without the need for post-processing. Furthermore, we introduce the l2,p-norm for graph-based feature selection, which selects the most relevant data for efficient graph factorization. Lastly, we employ the tensor Schatten p-norm as a tensor rank approximation function to capture the complementary information between different views, ensuring similarity between cluster assignment matrices. Experimental results on five real-world datasets demonstrate that our proposed method outperforms state-of-the-art approaches.
27
UCI Machine Learning Repository
Arthur Asuncion · Medical Entomology and Zoology · 2007 · 24.4K citations
Orthogonal nonnegative matrix t-factorizations for clustering
Chris Ding, Tao Li, Wei Peng et al. · 2006 · 1.2K citations
Co-regularized Multi-view Spectral Clustering
Abhishek Kumar, Piyush Rai, Hal Daumé · 2011 · 933 citations