Skip to Main content Skip to Navigation
Journal articles

Robust and Scalable Learning of Complex Intrinsic Dataset Geometry via ElPiGraph

Abstract : Multidimensional datapoint clouds representing large datasets are frequently characterized by non-trivial low-dimensional geometry and topology which can be recovered by unsupervised machine learning approaches, in particular, by principal graphs. Principal graphs approximate the multivariate data by a graph injected into the data space with some constraints imposed on the node mapping. Here we present ElPiGraph, a scalable and robust method for constructing principal graphs. ElPiGraph exploits and further develops the concept of elastic energy, the topological graph grammar approach, and a gradient descent-like optimization of the graph topology. The method is able to withstand high levels of noise and is capable of approximating data point clouds via principal graph ensembles. This strategy can be used to estimate the statistical significance of complex data features and to summarize them into a single consensus principal graph. ElPiGraph deals efficiently with large datasets in various fields such as biology, where it can be used for example with single-cell transcriptomic or epigenomic datasets to infer gene expression dynamics and recover differentiation landscapes.
Document type :
Journal articles
Complete list of metadatas

Cited literature [68 references]  Display  Hide  Download
Contributor : Andrei Zinovyev <>
Submitted on : Tuesday, October 20, 2020 - 12:02:46 AM
Last modification on : Thursday, January 14, 2021 - 3:14:12 PM
Long-term archiving on: : Thursday, January 21, 2021 - 6:27:02 PM


Publisher files allowed on an open archive



Luca Albergante, Evgeny Mirkes, Jonathan Bac, Huidong Chen, Alexis Martin, et al.. Robust and Scalable Learning of Complex Intrinsic Dataset Geometry via ElPiGraph. Entropy, MDPI, 2020, 22 (3), pp.296. ⟨10.3390/e22030296⟩. ⟨hal-02971955⟩



Record views


Files downloads