An algorithmic way to generate simplexes for topological data analysis

Krzysztof Rykaczewski; Piotr Wisniewski; Krzysztof Stencel

An algorithmic way to generate simplexes for topological data analysis

Krzysztof Rykaczewski
, Piotr Wisniewski
, Krzysztof Stencel

Research output: Contribution to journal › Conference article › peer-review

Abstract

In this article we present a new algorithm for creating simplicial Vietoris-Rips complexes that is easily parallelizable using computation models like MapReduce and Apache Spark. The algorithm does not involve any computation in homology spaces.

Original language	English
Pages (from-to)	180-188
Number of pages	9
Journal	CEUR Workshop Proceedings
Volume	1698
State	Published - 2016
Externally published	Yes
Event	25th International Workshop on Concurrency, Specification and Programming, CS and P 2016 - Rostock, Germany Duration: Sep 28 2016 → Sep 30 2016

Keywords

Data analysis
Simplicial complex
Topology

Cite this

@article{332acbcb8a22476ca39b3b7478cee33e,

title = "An algorithmic way to generate simplexes for topological data analysis",

abstract = "In this article we present a new algorithm for creating simplicial Vietoris-Rips complexes that is easily parallelizable using computation models like MapReduce and Apache Spark. The algorithm does not involve any computation in homology spaces.",

keywords = "Data analysis, Simplicial complex, Topology",

author = "Krzysztof Rykaczewski and Piotr Wisniewski and Krzysztof Stencel",

year = "2016",

language = "English",

volume = "1698",

pages = "180--188",

journal = "CEUR Workshop Proceedings",

issn = "1613-0073",

publisher = "CEUR Workshop Proceedings",

note = "25th International Workshop on Concurrency, Specification and Programming, CS and P 2016 ; Conference date: 28-09-2016 Through 30-09-2016",

}

TY - JOUR

T1 - An algorithmic way to generate simplexes for topological data analysis

AU - Rykaczewski, Krzysztof

AU - Wisniewski, Piotr

AU - Stencel, Krzysztof

PY - 2016

Y1 - 2016

N2 - In this article we present a new algorithm for creating simplicial Vietoris-Rips complexes that is easily parallelizable using computation models like MapReduce and Apache Spark. The algorithm does not involve any computation in homology spaces.

AB - In this article we present a new algorithm for creating simplicial Vietoris-Rips complexes that is easily parallelizable using computation models like MapReduce and Apache Spark. The algorithm does not involve any computation in homology spaces.

KW - Data analysis

KW - Simplicial complex

KW - Topology

UR - https://www.scopus.com/pages/publications/84992422371

M3 - Conference article

AN - SCOPUS:84992422371

SN - 1613-0073

VL - 1698

SP - 180

EP - 188

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

T2 - 25th International Workshop on Concurrency, Specification and Programming, CS and P 2016

Y2 - 28 September 2016 through 30 September 2016

ER -

An algorithmic way to generate simplexes for topological data analysis

Abstract

Keywords

Other files and links

Fingerprint

Cite this