mlsanityData to 14 Oct 2026

Unified Multi-View Orthonormal Non-Negative Graph Based Clustering Framework

arXiv 2211.02883 ↗First posted 3 Nov 2022cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Spectral clustering is an effective methodology for unsupervised learning. Most traditional spectral clustering algorithms involve a separate two-step procedure and apply the transformed new representations for the final clustering results. Recently, much progress has been made to utilize the non-negative feature property in real-world data and to jointly learn the representation and clustering results. However, to our knowledge, no previous work considers a unified model that incorporates the important multi-view information with those properties, which severely limits the performance of existing methods. In this paper, we formulate a novel clustering model, which exploits the non-negative feature property and, more importantly, incorporates the multi-view information into a unified joint learning framework: the unified multi-view orthonormal non-negative graph based clustering framework (Umv-ONGC). Then, we derive an effective three-stage iterative solution for the proposed model and provide analytic solutions for the three sub-problems from the three stages. We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features. Extensive experiments on three benchmark data sets demonstrate the effectiveness of the proposed method.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 45 references that are in the map. First posted on arXiv 3 Nov 2022.

Builds on

9 of 45 references.

References · 9

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  4. 2014Going Deeper with Convolutionscited by 4,241
  5. 2019Collecting and Analyzing Multidimensional Data with Local Differential Privacycited by 49
  6. 2019Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRankcited by 25
  7. 2017A generalized power iteration method for solving quadratic problem on the Stiefel manifoldcited by 15
  8. 2019Efficient Estimation of Heat Kernel PageRank for Local Clusteringcited by 9
  9. 2019PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphscited by 1

Built on by

Not cited yet.