Results 11 to 20 of about 1,917,955 (191)
Adaptive computation of the Symmetric Nonnegative Matrix Factorization (SymNMF)
Nonnegative Matrix Factorization (NMF), first proposed in 1994 for data analysis, has received successively much attention in a great variety of contexts such as data mining, text clustering, computer vision, bioinformatics, etc. In this paper the case of a symmetric matrix is considered and the symmetric nonnegative matrix factorization (SymNMF) is ...
P. Favati +3 more
openaire +4 more sources
On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices [PDF]
Let \(V\) be a nonnegative matrix. The nonnegative matrix factorization problem consists of finding nonnegative matrix factors \(W \in \mathbb{R}^{m,r}\) and \(H \in \mathbb{R}^{r,n}\) such that \(V \approx WH\). \textit{D. D. Lee} and \textit{H. S. Seung} [Unsupervised learning by convex and conic coding, Adv. Neural Inf. Process. Syst.
Catral, M. +3 more
openaire +2 more sources
Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
Given a symmetric nonnegative matrix $A$ , symmetric nonnegative matrix factorization (symNMF) is the problem of finding a nonnegative matrix $H$ , usually with much fewer columns than $A$ , such that $A \approx HH^T$ . SymNMF can be used for data analysis and in particular for various clustering tasks.
Nicolas Gillis +2 more
exaly +3 more sources
WSNMF: Weighted Symmetric Nonnegative Matrix Factorization for attributed graph clustering
In recent times, Symmetric Nonnegative Matrix Factorization (SNMF), a derivative of Nonnegative Matrix Factorization (NMF), has surfaced as a promising technique for graph clustering. Nevertheless, when applied to attributed graph clustering, it confronts notable challenges.
Razieh Sheikhpour +2 more
exaly +3 more sources
Block Sparse Symmetric Nonnegative Matrix Factorization Based on Constrained Graph Regularization [PDF]
The existing algorithms based on symmetric nonnegative matrix factorization(SymNMF) are mostly rely on initial data to construct affinity matrices,and neglect the limited pairwise constraints,so these methods are unable to effectively distinguish similar
LIU Wei, DENG Xiuqin, LIU Dongdong, LIU Yulan
doaj +1 more source
Off-diagonal symmetric nonnegative matrix factorization [PDF]
Symmetric nonnegative matrix factorization (symNMF) is a variant of nonnegative matrix factorization (NMF) that allows to handle symmetric input matrices and has been shown to be particularly well suited for clustering tasks. In this paper, we present a new model, dubbed off-diagonal symNMF (ODsymNMF), that does not take into account the diagonal ...
Moutier, François +2 more
openaire +5 more sources
Self-Supervised Symmetric Nonnegative Matrix Factorization [PDF]
Symmetric nonnegative matrix factorization (SNMF) has demonstrated to be a powerful method for data clustering. However, SNMF is mathematically formulated as a non-convex optimization problem, making it sensitive to the initialization of variables. Inspired by ensemble clustering that aims to seek a better clustering result from a set of clustering ...
Yuheng Jia +4 more
openaire +3 more sources
A network is an efficient tool to organize complicated data. The Laplacian graph has attracted more and more attention for its good properties and has been applied to many tasks including clustering, feature selection, and so on.
Junmin Zhao, Yuanyuan Ma, Lifang Liu
doaj +1 more source
A Provable Splitting Approach for Symmetric Nonnegative Matrix Factorization
The symmetric Nonnegative Matrix Factorization (NMF), a special but important class of the general NMF, has found numerous applications in data analysis such as various clustering tasks. Unfortunately, designing fast algorithms for the symmetric NMF is not as easy as for its nonsymmetric counterpart, since the latter admits the splitting property that ...
Xiao Li 0009 +3 more
openaire +3 more sources
Orthogonal Symmetric Nonnegative Matrix Tri-Factorization
Nicolas Gillis
exaly +2 more sources

