Cargando…
On a two-truths phenomenon in spectral graph clustering
Clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering—clustering the vertices of a graph based on their spectral embedding—is commonly approached via K-means (or, more generally, Gaussian mixture model) clustering comp...
Autores principales: | Priebe, Carey E., Park, Youngser, Vogelstein, Joshua T., Conroy, John M., Lyzinski, Vince, Tang, Minh, Athreya, Avanti, Cape, Joshua, Bridgeford, Eric |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
National Academy of Sciences
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6442630/ https://www.ncbi.nlm.nih.gov/pubmed/30850525 http://dx.doi.org/10.1073/pnas.1814462116 |
Ejemplares similares
-
Inference for Multiple Heterogeneous Networks with a Common Invariant Subspace
por: Arroyo, Jesús, et al.
Publicado: (2021) -
Fast Approximate Quadratic Programming for Graph Matching
por: Vogelstein, Joshua T., et al.
Publicado: (2015) -
The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks
por: Pantazis, Konstantinos, et al.
Publicado: (2022) -
Discovering and deciphering relationships across disparate data modalities
por: Vogelstein, Joshua T, et al.
Publicado: (2019) -
Generative network modeling reveals quantitative definitions of bilateral symmetry exhibited by a whole insect brain connectome
por: Pedigo, Benjamin D, et al.
Publicado: (2023)