Persistent reachability homology in machine learning applications
By: Luigi Caputi, Nicholas Meadows, Henri Riihimäki
Potential Business Impact:
Finds brain patterns to detect epilepsy.
We explore the recently introduced persistent reachability homology (PRH) of digraph data, i.e. data in the form of directed graphs. In particular, we study the effectiveness of PRH in network classification task in a key neuroscience problem: epilepsy detection. PRH is a variation of the persistent homology of digraphs, more traditionally based on the directed flag complex (DPH). A main advantage of PRH is that it considers the condensations of the digraphs appearing in the persistent filtration and thus is computed from smaller digraphs. We compare the effectiveness of PRH to that of DPH and we show that PRH outperforms DPH in the classification task. We use the Betti curves and their integrals as topological features and implement our pipeline on support vector machine.
Similar Papers
Frequent subgraph-based persistent homology for graph classification
Machine Learning (CS)
Finds hidden patterns in connected data better.
Graphical Model-based Inference on Persistent Homology
Methodology
Finds hidden patterns in brain scans.
Graphical Model-based Inference on Persistent Homology
Methodology
Finds where brain differences start in Alzheimer's.