Correspondence analysis, spectral clustering and graph embedding: applications to ecology and economic complexity
Abstract Identifying structure underlying high-dimensional data is a common challenge across scientific disciplines. We revisit correspondence analysis (CA), a classical method revealing such structures, from a network perspective. We present the poorly-known equivalence of CA to spectral clustering...
Main Authors: | Alje van Dam, Mark Dekker, Ignacio Morales-Castilla, Miguel Á. Rodríguez, David Wichmann, Mara Baudena |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Publishing Group
2021-04-01
|
Series: | Scientific Reports |
Online Access: | https://doi.org/10.1038/s41598-021-87971-9 |
Similar Items
-
Constrained spectral clustering via multi–layer graph embeddings on a grassmann manifold
by: Trokicić Aleksandar, et al.
Published: (2019-03-01) -
Spectral Embedded Deep Clustering
by: Yuichiro Wada, et al.
Published: (2019-08-01) -
Spectral Nonlinearly Embedded Clustering Algorithm
by: Mingming Liu, et al.
Published: (2016-01-01) -
Properties and Applications of the Eigenvector Corresponding to the Laplacian Spectral Radius of a Graph
by: Haizhou Song, et al.
Published: (2013-01-01) -
Multi-View Spectral Clustering With Incomplete Graphs
by: Wenzhang Zhuge, et al.
Published: (2020-01-01)