Porovnať metódy
Prezrite si vybrané metódy vedľa seba; riadky, ktoré sa líšia, sú zvýraznené.
| Topologické hlboké učenie× | Algoritmus Mapper× | |
|---|---|---|
| Odbor | Topológia | Topológia |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 2023 | 2007 |
| Tvorca≠ | Topological deep learning literature | Singh, Mémoli & Carlsson |
| Typ≠ | Higher-order message-passing framework | Graph-based topological summarization |
| Pôvodný zdroj≠ | 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 ↗ |
| Ďalšie názvy | TDL, Topological Neural Networks, Higher-Order Deep Learning, Topolojik Derin Öğrenme | Topological Mapper, TDA Mapper, Reeb Graph Approximation, Eşleyici Algoritma |
| Príbuzné≠ | 3 | 2 |
| Zhrnutie≠ | 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. |
| ScholarGateDátová sada ↗ |
|
|