{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/robust-and-scalable-learning-of-complex","title":"Robust And Scalable Learning Of Complex Dataset Topologies Via Elpigraph","arxiv_id":"1804.07580","date":"2018-04-20","proceeding":null,"authors":["Luca Albergante","Evgeny M. Mirkes","Huidong Chen","Alexis Martin","Louis Faure","Emmanuel Barillot","Luca Pinello","Alexander N. Gorban","Andrei Zinovyev"],"abstract":"Large datasets represented by multidimensional data point clouds often\npossess non-trivial distributions with branching trajectories and excluded\nregions, with the recent single-cell transcriptomic studies of developing\nembryo being notable examples. Reducing the complexity and producing compact\nand interpretable representations of such data remains a challenging task. Most\nof the existing computational methods are based on exploring the local data\npoint neighbourhood relations, a step that can perform poorly in the case of\nmultidimensional and noisy data. Here we present ElPiGraph, a scalable and\nrobust method for approximation of datasets with complex structures which does\nnot require computing the complete data distance matrix or the data point\nneighbourhood graph. This method is able to withstand high levels of noise and\nis capable of approximating complex topologies via principal graph ensembles\nthat can be combined into a consensus principal graph. ElPiGraph deals\nefficiently with large and complex datasets in various fields from biology,\nwhere it can be used to infer gene dynamics from single-cell RNA-Seq, to\nastronomy, where it can be used to explore complex structures in the\ndistribution of galaxies.","url_abs":"http://arxiv.org/abs/1804.07580v2","url_pdf":"http://arxiv.org/pdf/1804.07580v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"robust-and-scalable-learning-of-complex","repo_url":"https://github.com/j-bac/ElPiGraph_Python","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"robust-and-scalable-learning-of-complex","repo_url":"https://github.com/j-bac/elpigraph-python","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"astronomy","task_name":"Astronomy"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1804.07580","atlas_url":"https://app.syntology.ai/?focus=1804.07580","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1804.07580"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1804.07580\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1804.07580"},"call":"get_concepts_for_paper(arxiv_id=\"1804.07580\")"}],"by_repo":[{"repo":"j-bac/ElPiGraph_Python","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"j-bac/elpigraph-python","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"87a6cf105bed1784d2f4d19f46c107c083a4827cd4c450e09c529c9fbb7c23e5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}