Results 21 to 30 of about 21,847 (188)
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
Constraint-Induced Symmetric Nonnegative Matrix Factorization for Accurate Community Detection
Zhigang Liu +3 more
semanticscholar +2 more sources
A Constraints Fusion-induced Symmetric Nonnegative Matrix Factorization Approach for Community Detection [PDF]
Community is a fundamental and critical characteristic of an undirected social network, making community detection be a vital yet thorny issue in network representation learning.
Zhigang Liu, Xin Luo
semanticscholar +1 more source
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
Robust Community Detection in Graphs
Community detection in network-type data provides a powerful tool in analyzing and understanding real-world systems. In fact, community detection approaches aim to reduce the network’s dimensionality and partition it into a set of disjoint ...
Esraa M. Al-Sharoa +2 more
doaj +1 more source
Some upper and lower bounds on PSD-rank [PDF]
Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds
de Wolf, Ronald, Lee, Troy, Wei, Zhaohui
core +10 more sources
Community detection is a critical issue in the field of complex networks. Recently, the nonnegative matrix factorization (NMF) method has successfully uncovered the community structure in the complex networks.
Hong Lu +3 more
doaj +1 more source
Inexact Block Coordinate Descent Methods for Symmetric Nonnegative Matrix Factorization [PDF]
Symmetric nonnegative matrix factorization (SNMF) is equivalent to computing a symmetric nonnegative low rank approximation of a data similarity matrix. It inherits the good data interpretability of the well-known nonnegative matrix factorization technique and have better ability of clustering nonlinearly separable data.
Shi, Qingjiang +4 more
openaire +2 more sources
Approximate cone factorizations and lifts of polytopes [PDF]
In this paper we show how to construct inner and outer convex approximations of a polytope from an approximate cone factorization of its slack matrix.
Gouveia, João +2 more
core +1 more source
Overlapping clustering is a fundamental and widely studied subject that identifies all densely connected groups of vertices and separates them from other vertices in complex networks.
Mingqing Huang +3 more
semanticscholar +1 more source

