Kernel method for persistence diagrams via kernel embedding and weight factor
원문 초록
Topological data analysis is an emerging mathematical concept for characterizing shapes in multi-scale data. In this field, persistence diagrams are widely used as a descriptor of the input data, and can distinguish robust and noisy topological properties. Nowadays, it is highly desired to develop a statistical framework on persistence diagrams to deal with practical data. This paper proposes a kernel method on persistence diagrams. A theoretical contribution of our method is that the proposed kernel allows one to control the effect of persistence, and, if necessary, noisy topological properties can be discounted in data analysis. Furthermore, the method provides a fast approximation technique. The method is applied into several problems including practical data in physics, and the results show the advantage compared to the existing kernel method on persistence diagrams.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
CliquePH: Higher-Order Information for Graph Neural Networks through Persistent Homology on Clique Graphs
Dynamic Neural Dowker Network: Approximating Persistent Homology in Dynamic Directed Graphs
GEFL: Extended Filtration Learning for Graph Classification
Density-aware Walks for Coordinated Campaign Detection
Positional Encoding meets Persistent Homology on Graphs
Improving the Effective Receptive Field of Message-Passing Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.