Cargando…
Visualization of very large high-dimensional data sets as minimum spanning trees
The chemical sciences are producing an unprecedented amount of large, high-dimensional data sets containing chemical structures and associated properties. However, there are currently no algorithms to visualize such data while preserving both global and local features with a sufficient level of deta...
Autores principales: | Probst, Daniel, Reymond, Jean-Louis |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7015965/ https://www.ncbi.nlm.nih.gov/pubmed/33431043 http://dx.doi.org/10.1186/s13321-020-0416-x |
Ejemplares similares
-
HAMSTER: visualizing microarray experiments as a set of minimum spanning trees
por: Wan, Raymond, et al.
Publicado: (2009) -
Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants
por: Carvalho, Iago A., et al.
Publicado: (2023) -
Minimum Spanning vs. Principal Trees for Structured Approximations of Multi-Dimensional Datasets
por: Chervov, Alexander, et al.
Publicado: (2020) -
Minimum spanning tree analysis of the human connectome
por: van Dellen, Edwin, et al.
Publicado: (2018) -
Quantifying Data Dependencies with Rényi Mutual Information and Minimum Spanning Trees
por: Eggels, Anne, et al.
Publicado: (2019)