paper-with-me

홈 › Papers

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

2022-11-03 · Liangchen Liu, Qiuhong Ke, Chaojie Li, Feiping Nie, Yingying Zhu

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.

📄 PDF Abstract BibTeX arXiv:2211.02883

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Methods 이 논문이 사용한 방법론

Spectral Clustering Spectral clustering has attracted increasing attention due to the promising ability in dealing with nonlinearly separable datasets [15], [16]. In spectral clustering, the…

Similar Papers 제목 키워드 기반

Learning on graphs using Orthonormal Representation is Statistically Consistent

2014-12-01 · NeurIPS 2014 12 · Rakesh Shivanna, Chiranjib Bhattacharyya

Existing research \cite{reg} suggests that embedding graphs on a unit sphere can be beneficial in learning labels on the vertices of a graph. However the choice of optimal embedding remains an open issue. \emph{Orthonorm…

Graph-based Clustering Revisited: A Relaxation of Kernel $k$-Means Perspective

2025-09-23 · Wenlong Lyu, Yuheng Jia, Hui Liu, Junhui Hou arxiv

The well-known graph-based clustering methods, including spectral clustering, symmetric non-negative matrix factorization, and doubly stochastic normalization, can be viewed as relaxations of the kernel $k$-means approac…

Multi-view Orthonormalized Partial Least Squares: Regularizations and Deep Extensions

2020-07-09 · Li Wang, Ren-cang Li, Wen-Wei

We establish a family of subspace-based learning method for multi-view learning using the least squares as the fundamental basis. Specifically, we investigate orthonormalized partial least squares (OPLS) and study its im…

Cross-Modal RetrievalMULTI-VIEW LEARNINGRetrieval

Signal Processing on Directed Graphs

2020-08-02 · Antonio G. Marques, Santiago Segarra, Gonzalo Mateos

This paper provides an overview of the current landscape of signal processing (SP) on directed graphs (digraphs). Directionality is inherent to many real-world (information, transportation, biological) networks and it sh…

Causal Inference

eGHWT: The Extended Generalized Haar-Walsh Transform

2021-07-11 · Naoki Saito, Yiqun Shao

Extending computational harmonic analysis tools from the classical setting of regular lattices to the more general setting of graphs and networks is very important and much research has been done recently. The Generalize…