Persistent Cohomology and Circular Coordinates
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE, and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of low-dimensional coordinates which represent the intrinsic structure of the data. This paradigm incorporates the assumption that real-valued coordinates provide a rich enough class of functions to represent the data faithfully and efficiently. On the other hand, there are simple structures which challenge this assumption: the circle, for example, is one-dimensional, but its faithful representation requires two real coordinates. In this work, we present a strategy for constructing circle-valued functions on a statistical data set. We develop a machinery of persistent cohomology to identify candidates for significant circle-structures in the data, and we use harmonic smoothing and integration to obtain the circle-valued coordinate functions themselves. We suggest that this enriched class of coordinate functions permits a precise NLDR analysis of a broader range of realistic data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Self-citationTopological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Barcodes: the persistent topology of data
Ghrist, R. (2007) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-07-01191-3 · Cited by 1,236
Cited by
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
Toroidal topology of population activity in grid cells
Gardner, R. J., Hermansen, E., Pachitariu, M., Burak, Y., Baas, N. A., Dunn, B. A., Moser, M.-B., & Moser, E. I. (2022) · Nature · doi:10.1038/s41586-021-04268-7 · Cited by 428
Learnable latent embeddings for joint behavioural and neural analysis
Schneider, S., Lee, J. H., & Mathis, M. W. (2023) · Nature · doi:10.1038/s41586-023-06031-6 · Cited by 348
Cang, Z., & Wei, G.-W. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005690 · Cited by 330
From Machine Learning to Explainable AI
Holzinger, A. (2018) · 2018 World Symposium on Digital Intelligence for Systems and Machines (DISA) · doi:10.1109/disa.2018.8490530 · Cited by 306
Metadata
- Authors
- de Silva, V., Morozov, D., & Vejdemo-Johansson, M.
- Venue
- Discrete & Computational Geometry
- Published
- 2011-03-30
- Volume
- 45
- Issue
- 4
- Pages
- 737-759
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W4233964287
- Cited by
- 97
- References
- 4
- FWCI
- 2.99
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Persistent Cohomology and Circular Coordinates. https://app.cochat.ai/papers/10.1007/s00454-011-9344-x
- The paper
- de Silva, V., Morozov, D., & Vejdemo-Johansson, M. (2011). Persistent Cohomology and Circular Coordinates. Discrete & Computational Geometry. https://doi.org/10.1007/s00454-011-9344-x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.