Partitioning networks into clusters and residuals with average association
DOI10.1063/1.3460360zbMath1459.82061OpenAlexW2058257001WikidataQ85119955 ScholiaQ85119955MaRDI QIDQ5250462
Publication date: 19 May 2015
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.3460360
Biomedical imaging and signal processing (92C55) Eigenvalues, singular values, and eigenvectors (15A18) Nonlinear oscillations and coupled oscillators for ordinary differential equations (34C15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items (2)
Cites Work
- The varimax criterion for analytic rotation in factor analysis
- A direct solution for pairwise rotations in Kaiser's varimax method
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- EIGENVALUE DECOMPOSITION AS A GENERALIZED SYNCHRONIZATION CLUSTER ANALYSIS
- Identification of network modules by optimization of ratio association
- An algorithm for information structuring and retrieval
- Lower Bounds for the Partitioning of Graphs
This page was built for publication: Partitioning networks into clusters and residuals with average association