paper-with-me

Papers

Composing Tree Graphical Models with Persistent Homology Features for Clustering Mixed-Type Data

2017-08-01 · ICML 2017 8 · Xiuyan Ni, Novi Quadrianto, Yusu Wang, Chao Chen

Clustering data with both continuous and discrete attributes is a challenging task. Existing methods lack a principled probabilistic formulation. In this paper, we propose a clustering method based on a tree-structured graphical model to describe the generation process of mixed-type data. Our tree-structured model factorized into a product of pairwise interactions, and thus localizes the interaction between feature variables of different types. To provide a robust clustering method based on the tree-model, we adopt a topographical view and compute peaks of the density function and their attractive basins for clustering. Furthermore, we leverage the theory from topology data analysis to adaptively merge trivial peaks into large ones in order to achieve meaningful clusterings. Our method outperforms state-of-the-art methods on mixed-type data.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

Analyzing Brain Tumor Connectomics using Graphs and Persistent Homology

2024-07-25 · Debanjali Bhattacharya, Ninad Aithal, Manish Jayswal, Neelam Sinha

Recent advances in molecular and genetic research have identified a diverse range of brain tumor sub-types, shedding light on differences in their molecular mechanisms, heterogeneity, and origins. The present study perfo…

Topological Data Analysis

A New Non-archimedean Metric on Persistent Homology

2020-12-04 · İsmail Güzel, Atabey Kaygun

In this article, we define a new non-archimedean metric structure, called cophenetic metric, on persistent homology classes of all degrees. We then show that zeroth persistent homology together with the cophenetic metric…

AllClustering

Algorithm for Interpretable Graph Features via Motivic Persistent Cohomology

2025-12-23 · Yoshihiro Maruyama arxiv

We present the Chromatic Persistence Algorithm (CPA), an event-driven method for computing persistent cohomological features of weighted graphs via graphic arrangements, a classical object in computational geometry. We e…

A Persistent Weisfeiler–Lehman Procedure for Graph Classification

2019-06-09 · Proceedings of the 36th International Conference on Machine Learning 2019 6 · Bastian Rieck, Christian Bock, Karsten Borgwardt

The Weisfeiler–Lehman graph kernel exhibits competitive performance in many graph classification tasks. However, its subtree features are not able to capture connected components and cycles, topological features known fo…

ClassificationGeneral ClassificationGraph ClassificationTopological Data Analysis

Atom-specific persistent homology and its application to protein flexibility analysis

2019-03-26

Recently, persistent homology has had tremendous success in biomolecular data analysis. It works by examining the topological relationship or connectivity of a group of atoms in a molecule at a variety of scales, then re…