قارن الطرق

	خوارزمية Mapper	الهومولوجيا المستمرة	التجميع الطيفي (Spectral Clustering)
المجال	الطوبولوجيا	الطوبولوجيا	تعلم الآلة
العائلة	Machine learning	Machine learning	Machine learning
سنة النشأة	2007	2002	2002
صاحب الطريقة	Singh, Mémoli & Carlsson	Edelsbrunner, Letscher & Zomorodian	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
النوع	Graph-based topological summarization	Topological feature extraction algorithm	Graph-based clustering (spectral method)
المصدر التأسيسي	Singh, G., Mémoli, F., & Carlsson, G. (2007). Topological methods for the analysis of high dimensional data sets and 3D object recognition. Eurographics Symposium on Point-Based Graphics, 91–100.	Edelsbrunner, H., Letscher, D., & Zomorodian, A. (2002). Topological persistence and simplification. Discrete & Computational Geometry, 28(4), 511–533.	Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856.
الأسماء البديلة	Topological Mapper, TDA Mapper, Reeb Graph Approximation, Eşleyici Algoritma	Topological Persistence, Persistence Barcodes, Persistent Betti Numbers, Kalıcı Homoloji	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
ذات صلة	2	2	5
الملخص	The Mapper algorithm is a method in topological data analysis (TDA) that produces a graph-based summary of the shape of high-dimensional point cloud data. Introduced by Singh, Mémoli, and Carlsson in 2007 at the Eurographics Symposium on Point-Based Graphics, Mapper constructs a simplicial complex — typically a graph — that captures the global topological and geometric structure of a dataset without requiring a fixed embedding or metric assumption.	Persistent homology is a method in topological data analysis that quantifies the multi-scale topological structure of data by tracking connected components, loops, and voids as a scale parameter varies. Introduced by Edelsbrunner, Letscher, and Zomorodian in 2002, it encodes topological features through their birth and death scales, producing persistence diagrams or barcodes that serve as compact, coordinate-free descriptors of shape. The approach is robust to noise and provides a mathematically rigorous bridge between discrete data and algebraic topology.	Spectral Clustering is a graph-based unsupervised learning algorithm, formalized by Ng, Jordan, and Weiss in 2002, that maps data points into a low-dimensional eigenspace derived from the similarity graph's Laplacian before applying k-means. This spectral embedding makes it possible to recover clusters of arbitrary shape — rings, crescents, interleaved spirals — that Euclidean distance-based methods consistently fail to separate.