A standardized pipeline converts time series to graphs, computes persistence diagrams, and extracts features that classify UCR benchmarks, with diffusion distance outperforming shortest-path metrics and performance varying by graph type.
Perea and John Harer
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
Hybrid models that add persistent-homology features from fixation time series to traditional statistical features outperform purely statistical baselines for dyslexia detection on the Copenhagen Corpus.
citing papers explorer
-
Persistent Homology of Time Series through Complex Networks
A standardized pipeline converts time series to graphs, computes persistence diagrams, and extracts features that classify UCR benchmarks, with diffusion distance outperforming shortest-path metrics and performance varying by graph type.
-
Fixation Sequences as Time Series: A Topological Approach to Dyslexia Detection
Hybrid models that add persistent-homology features from fixation time series to traditional statistical features outperform purely statistical baselines for dyslexia detection on the Copenhagen Corpus.