返回
Persistence codebooks for topological data analysis
DOI:10.1007/s10462-020-09897-4.png)
摘要
En 中文
Persistent homology is a rigorous mathematical theory that provides a robust descriptor of data in the form of persistence diagrams (PDs) which are 2D multisets of points. Their variable size makes them, however, difficult to combine with typical machine learning workflows. In this paper we introduce persistence codebooks, a novel expressive and discriminative fixed-size vectorized representation of PDs that adapts to the inherent sparsity of persistence diagrams. To this end, we adapt bag-of-words, vectors of locally aggregated descriptors and Fischer vectors for the quantization of PDs. Persistence codebooks represent PDs in a convenient way for machine learning and statistical analysis and have a number of favorable practical and theoretical properties including 1-Wasserstein stability. We evaluate the presented representations on several heterogeneous datasets and show their (high) discriminative power. Our approach yields comparable-and partly even higher-performance in much less time than alternative approaches.
Keyword:
Persistent homology
Machine learning
Persistence diagrams
Bag of words
VLAD
Fisher vectors
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.2K
被引数:
3.0W
机构
引用论文
Synthesis, magnetic properties and theoretical calculations of novel nitronyl nitroxide and imino nitroxide diradicals grafted on terpyridine moiety
Polyhedron
IF0

