Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Persistent cohomology and circular coordinates
Department of Mathematics, Stanford University, California.ORCID iD: 0000-0001-6322-7542
2009 (English)In: Proceedings of the 25th annual symposium on Computational geometry, Association for Computing Machinery (ACM), 2009, 227-236 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2009. 227-236 p.
Keyword [en]
dimensionality reduction, computational topology, persistent homology, persistent cohomology
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-150364DOI: 10.1145/1542362.1542406ISI: 000267982900035Scopus ID: 2-s2.0-70849131458OAI: oai:DiVA.org:kth-150364DiVA: diva2:742583
Conference
SoCG '09 25th Annual Symposium on Computational Geometry, Aarhus, Denmark — June 08 - 10, 2009
Note

QC 20140903

Available from: 2014-09-02 Created: 2014-09-02 Last updated: 2014-12-16Bibliographically approved

Open Access in DiVA

fulltext(1799 kB)23 downloads
File information
File name FULLTEXT01.pdfFile size 1799 kBChecksum SHA-512
428fafbc2fb730d7c9049837b0120ae127a6cdd2c3d22663cb733d537411c97d1f2acbc773bfa3691fafb49ce9a68465b9abfd93629bc524bb2581a12171bbbf
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusACM Digital library

Authority records BETA

Vejdemo-Johansson, Mikael

Search in DiVA

By author/editor
Vejdemo-Johansson, Mikael
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 23 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 30 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf