Scalable Multi-view Clustering via Explicit Kernel Features Maps
Not on the map. Why?
Abstract (arXiv)
The proliferation of high-dimensional data from sources such as social media, sensor networks, and online platforms has created new challenges for clustering algorithms. Multi-view clustering, which integrates complementary information from multiple data perspectives, has emerged as a powerful solution. However, existing methods often struggle with scalability and efficiency, particularly on large attributed networks. In this work, we address these limitations by leveraging explicit kernel feature maps and a non-iterative optimization strategy, enabling efficient and accurate clustering on datasets with millions of points.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 56 references that are in the map. First posted on arXiv 7 Feb 2024.
Builds on
10 of 56 references.
References · 10
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2020Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlationcited by 420
- 2020Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyondcited by 107
- 2021Multi-view Contrastive Graph Clusteringcited by 76
- 2019Large-scale Multi-view Subspace Clustering in Linear Timecited by 66
- 2016Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clusteringcited by 18
- 2022Seeking Commonness and Inconsistencies: A Jointly Smoothed Approach to Multi-view Subspace Clusteringcited by 13
Built on by
Not cited yet.