เปรียบเทียบวิธี
ดูวิธีที่เลือกเทียบกันแบบเคียงข้าง แถวที่ต่างกันจะถูกเน้นไว้
| การเรียนรู้เชิงลึกเชิงทอพอโลยี× | อัลกอริทึม Mapper× | |
|---|---|---|
| สาขาวิชา | ทอพอโลยี | ทอพอโลยี |
| ตระกูล | Machine learning | Machine learning |
| ปีกำเนิด≠ | 2023 | 2007 |
| ผู้ริเริ่ม≠ | Topological deep learning literature | Singh, Mémoli & Carlsson |
| ประเภท≠ | Higher-order message-passing framework | Graph-based topological summarization |
| แหล่งต้นตำรับ≠ | Hajij, M., et al. (2023). Topological deep learning: Going beyond graph data. arXiv preprint. link ↗ | 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. DOI ↗ |
| ชื่อเรียกอื่น | TDL, Topological Neural Networks, Higher-Order Deep Learning, Topolojik Derin Öğrenme | Topological Mapper, TDA Mapper, Reeb Graph Approximation, Eşleyici Algoritma |
| ที่เกี่ยวข้อง≠ | 3 | 2 |
| สรุป≠ | Topological Deep Learning (TDL) is a framework that extends deep learning beyond graphs to higher-order topological domains such as simplicial complexes, cell complexes, and hypergraphs. Formalized by Hajij et al. (2023), TDL provides a unified mathematical language for defining message-passing schemes across cells of different ranks, enabling neural networks to model multi-way interactions that pairwise graph edges cannot capture. It is relevant to researchers working with relational, geometric, or biological data exhibiting group-level dependencies. | 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. |
| ScholarGateชุดข้อมูล ↗ |
|
|