Evolutionary Nonnegative Matrix Factorization Algorithms for Community Detection in Dynamic Networks

2017 ◽  
Vol 29 (5) ◽  
pp. 1045-1058 ◽  
Author(s):  
Xiaoke Ma ◽  
Di Dong
Keyword(s):  
Community Detection ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Dynamic Networks ◽  
Nonnegative Matrix ◽  
Factorization Algorithms

Community Detection Based on Modularized Deep Nonnegative Matrix Factorization

2020 ◽  
pp. 2159006
Author(s):  
Jin Huang ◽  
Tinghua Zhang ◽  
Weihao Yu ◽  
Jia Zhu ◽  
Ercong Cai
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Complex Data ◽  
Original Matrix ◽  
Latent Features ◽  
Topology Information ◽  
Structure Properties

Community detection is a well-established problem and nontrivial task in complex network analysis. The goal of community detection is to discover community structures in complex networks. In recent years, many existing works have been proposed to handle this task, particularly nonnegative matrix factorization-based method, e.g. HNMF, BNMF, which is interpretable and can learn latent features of complex data. These methods usually decompose the original matrix into two matrixes, in one matrix, each column corresponds to a representation of community and each column of another matrix indicates the membership between overall pairs of communities and nodes. Then they discover the community by updating the two matrices iteratively and learn the shallow feature of the community. However, these methods either ignore the topological structure characteristics of the community or ignore the microscopic community structure properties. In this paper, we propose a novel model, named Modularized Deep NonNegative Matrix Factorization (MDNMF) for community detection, which preserves both the topology information and the instinct community structure properties of the community. The experimental results show that our proposed models can significantly outperform state-of-the-art approaches on several well-known dataset.

scholarly journals Matrix Factorization Algorithms for the Identification of Muscle Synergies: Evaluation on Simulated and Experimental Data Sets

2006 ◽  
Vol 95 (4) ◽  
pp. 2199-2212 ◽  
Author(s):  
Matthew C. Tresch ◽  
Vincent C. K. Cheung ◽  
Andrea d'Avella
Keyword(s):  
Matrix Factorization ◽  
Muscle Activation ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Muscle Synergies ◽  
Data Sets ◽  
Data Set ◽  
Activation Patterns ◽  
Muscle Activation Patterns ◽  
Factorization Algorithms

Several recent studies have used matrix factorization algorithms to assess the hypothesis that behaviors might be produced through the combination of a small number of muscle synergies. Although generally agreeing in their basic conclusions, these studies have used a range of different algorithms, making their interpretation and integration difficult. We therefore compared the performance of these different algorithms on both simulated and experimental data sets. We focused on the ability of these algorithms to identify the set of synergies underlying a data set. All data sets consisted of nonnegative values, reflecting the nonnegative data of muscle activation patterns. We found that the performance of principal component analysis (PCA) was generally lower than that of the other algorithms in identifying muscle synergies. Factor analysis (FA) with varimax rotation was better than PCA, and was generally at the same levels as independent component analysis (ICA) and nonnegative matrix factorization (NMF). ICA performed very well on data sets corrupted by constant variance Gaussian noise, but was impaired on data sets with signal-dependent noise and when synergy activation coefficients were correlated. Nonnegative matrix factorization (NMF) performed similarly to ICA and FA on data sets with signal-dependent noise and was generally robust across data sets. The best algorithms were ICA applied to the subspace defined by PCA (ICAPCA) and a version of probabilistic ICA with nonnegativity constraints (pICA). We also evaluated some commonly used criteria to identify the number of synergies underlying a data set, finding that only likelihood ratios based on factor analysis identified the correct number of synergies for data sets with signal-dependent noise in some cases. We then proposed an ad hoc procedure, finding that it was able to identify the correct number in a larger number of cases. Finally, we applied these methods to an experimentally obtained data set. The best performing algorithms (FA, ICA, NMF, ICAPCA, pICA) identified synergies very similar to one another. Based on these results, we discuss guidelines for using factorization algorithms to analyze muscle activation patterns. More generally, the ability of several algorithms to identify the correct muscle synergies and activation coefficients in simulated data, combined with their consistency when applied to physiological data sets, suggests that the muscle synergies found by a particular algorithm are not an artifact of that algorithm, but reflect basic aspects of the organization of muscle activation patterns underlying behaviors.

Sign in / Sign up

Export Citation Format

Share Document