{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:57:15Z","timestamp":1782485835173,"version":"3.54.5"},"reference-count":27,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T00:00:00Z","timestamp":1712188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Appl. Math. Stat."],"abstract":"<jats:p>This article describes a non-parametric clustering algorithm with an outlier removal step. Our method is based on tools from topological data analysis: we define a new filtration on metric spaces which is a variant of the Vietoris\u2013Rips filtration that adds information about the points' nearest neighbor to the persistence diagram. We prove a stability theorem for this filtration, and evaluate our method on point cloud and graph datasets, showing that it can compete with state-of-the-art methods while being non-parametric.<\/jats:p>","DOI":"10.3389\/fams.2024.1260828","type":"journal-article","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T04:40:25Z","timestamp":1712205625000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Persistence-based clustering with outlier-removing filtration"],"prefix":"10.3389","volume":"10","author":[{"given":"Alexandre","family":"Bois","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brian","family":"Tervil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"Oudre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1965","published-online":{"date-parts":[[2024,4,4]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1016\/j.neucom.2017.06.053","article-title":"A review of clustering techniques and developments","volume":"267","author":"Saxena","year":"2017","journal-title":"Neurocomputing"},{"key":"B2","doi-asserted-by":"publisher","first-page":"e1219","DOI":"10.1002\/widm.1219","article-title":"Algorithms for hierarchical clustering: an overview","volume":"7","author":"Murtagh","year":"2017","journal-title":"Wiley Interdiscipl Rev Data Mining Knowl Discov"},{"key":"B3","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester","year":"1996","journal-title":"KDD"},{"key":"B4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3068335","article-title":"revisited, revisited: why and how you should (still) use DBSCAN","volume":"42","author":"Schubert","year":"2017","journal-title":"ACM Transact Database Syst"},{"key":"B5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535927","article-title":"Persistence-based clustering in Riemannian manifolds","volume":"60","author":"Chazal","year":"2013","journal-title":"J. ACM"},{"key":"B6","volume-title":"Computational Topology: An Introduction","author":"Edelsbrunner","year":"2022"},{"key":"B7","doi-asserted-by":"crossref","DOI":"10.1017\/9781108297806","volume-title":"Geometric and Topological Inference","author":"Boissonnat","year":"2018"},{"key":"B8","doi-asserted-by":"publisher","first-page":"667963","DOI":"10.3389\/frai.2021.667963","article-title":"An introduction to topological data analysis: fundamental and practical aspects for data scientists","volume":"4","author":"Chazal","year":"2021","journal-title":"Front Artif Intell"},{"key":"B9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10711-013-9937-z","article-title":"Persistence stability for geometric complexes","volume":"173","author":"Chazal","year":"2014","journal-title":"Geometriae Dedicata"},{"key":"B10","doi-asserted-by":"publisher","first-page":"2267","DOI":"10.1109\/TMI.2012.2219590","article-title":"Persistent brain network homology from the perspective of dendrogram","volume":"31","author":"Lee","year":"2012","journal-title":"IEEE Trans Med Imaging"},{"key":"B11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1089\/brain.2013.0218","article-title":"Brain networks engaged in audiovisual integration during speech perception revealed by persistent homology-based network filtration","volume":"5","author":"Kim","year":"2015","journal-title":"Brain Connect"},{"key":"B12","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1109\/TVCG.2017.2744321","article-title":"Clique community persistence: a topological visual analysis approach for complex networks","volume":"24","author":"Rieck","year":"2017","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"B13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0179-3","article-title":"Persistence homology of networks: methods and applications","volume":"4","author":"Aktas","year":"2019","journal-title":"Appl Netw Sci"},{"key":"B14","volume-title":"A Course in Metric Geometry","author":"Burago","year":"2022"},{"key":"B15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/TSMC.1979.4310076","article-title":"A threshold selection method from gray-level histograms","volume":"9","author":"Otsu","year":"1979","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"B16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","article-title":"Detecting community structure in networks","volume":"38","author":"Newman","year":"2004","journal-title":"Eur Phys J B"},{"key":"B17","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","article-title":"Objective criteria for the evaluation of clustering methods","volume":"66","author":"Rand","year":"1971","journal-title":"J Am Stat Assoc"},{"key":"B18","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech"},{"key":"B19","doi-asserted-by":"crossref","DOI":"10.25080\/TCWV9851","article-title":"Exploring Network Structure, Dynamics, and Function Using NetworkX","author":"Hagberg","year":"2008"},{"key":"B20","first-page":"1027","article-title":"K-means++ the advantages of careful seeding","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Arthur","year":"2007"},{"key":"B21","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by passing messages between data points","volume":"315","author":"Frey","year":"2007","journal-title":"Science"},{"key":"B22","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/34.1000236","article-title":"Mean shift: a robust approach toward feature space analysis","volume":"24","author":"Comaniciu","year":"2002","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"B23","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/ICCV.2003.1238361","article-title":"Multiclass spectral clustering","volume-title":"Proceedings Ninth IEEE International Conference on Computer Vision","year":"2003"},{"key":"B24","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-319-21903-5_8","volume-title":"Hierarchical Clustering. Introduction to HPC With MPI for Data Science","author":"Nielsen","year":"2016"},{"key":"B25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/304181.304187","article-title":"Optics: ordering points to identify the clustering structure","volume":"28","author":"Ankerst","year":"1999","journal-title":"ACM Sigmod Record"},{"key":"B26","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","article-title":"BIRCH: an efficient data clustering method for very large databases","volume":"25","author":"Zhang","year":"1996","journal-title":"ACM Sigmod Record"},{"key":"B27","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/79.543975","article-title":"The expectation-maximization algorithm","volume":"13","author":"Moon","year":"1996","journal-title":"IEEE Signal Process Mag"}],"container-title":["Frontiers in Applied Mathematics and Statistics"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fams.2024.1260828\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T17:08:14Z","timestamp":1731690494000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fams.2024.1260828\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,4]]},"references-count":27,"alternative-id":["10.3389\/fams.2024.1260828"],"URL":"https:\/\/doi.org\/10.3389\/fams.2024.1260828","relation":{},"ISSN":["2297-4687"],"issn-type":[{"value":"2297-4687","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,4]]},"article-number":"1260828"}}