Topological Data Analysis

44
Topological Data Analysis MATH 800 Fall 2011

description

Topological Data Analysis. MATH 800 Fall 2011. Topological Data Analysis (TDA). An ε -chain is a finite sequence of points x 1 , ..., x n such that |x i – x i +1 | < ε for all i =1,…,n-1 x and y are ε -connected if there is an ε - chain joining them. - PowerPoint PPT Presentation

Transcript of Topological Data Analysis

Page 1: Topological Data Analysis

Topological Data Analysis

MATH 800Fall 2011

Page 2: Topological Data Analysis

Topological Data Analysis (TDA)

• An ε-chain is a finite sequence of points x1, ..., xn such that |xi – xi+1 | < ε for all i=1,…,n-1

• x and y are ε-connected if there is an ε-chain joining them.

• A ε-connected set is a set that any two points can be linked by an ε-chain.

• A ε-connected component is a maximal ε-connected subset.

Page 3: Topological Data Analysis

Topological Data Analysis (TDA)

• An ε-chain is a finite sequence of points x1, ..., xn such that |xi – xi+1 | < ε for all i=1,…,n-1

• x and y are ε-connected if there is an ε-chain joining them.

• A ε-connected set is a set that any two points can be linked by an ε-chain.

• A ε-connected component is a maximal ε-connected subset.

ε

Page 4: Topological Data Analysis

Topological Data Analysis (TDA)

• Cε = the number of ε-connected components

• Dε = the maximum distance of the points in ε-connected components

• Iε = the number of component consisting of a single point (isolated points)

ε

Page 5: Topological Data Analysis

Minimal Spanning Tree (MST)• MST is the tree of minimum total branch length that

spans the data.• To construct the MST (Prim's algorithm)

– Start with any point and its nearest neighbor,– Add the closest point– Repeat until all points are in the tree

Page 6: Topological Data Analysis

Minimal Spanning Tree (MST)• MST is the tree of minimum total branch length that

spans the data.• To construct the MST (Prim's algorithm)

– Start with any point and its nearest neighbor,– Add the closest point– Repeat until all points are in the tree

Page 7: Topological Data Analysis

Minimal Spanning Tree (MST)• MST is the tree of minimum total branch length that

spans the data.• To construct the MST (Prim's algorithm)

– Start with any point and its nearest neighbor,– Add the closest point– Repeat until all points are in the tree

ε = 6

Page 8: Topological Data Analysis

Topological Data Analysis (TDA)

Page 9: Topological Data Analysis

Topological Data Analysis (TDA)

Page 10: Topological Data Analysis

Topological Data Analysis (TDA)

Page 11: Topological Data Analysis

Topological Data Analysis (TDA)

Page 12: Topological Data Analysis

Applications of TDA

• Cluster analysis: is the task of assigning a set of objects into groups so that the objects in the same cluster are more similar to each other than to those in other clusters.– connected components

• Outlier: is an observation that is numerically distant from the rest of the data.

• Noise: is an unwanted value in a data– isolated points

Page 13: Topological Data Analysis
Page 14: Topological Data Analysis
Page 15: Topological Data Analysis
Page 16: Topological Data Analysis
Page 17: Topological Data Analysis
Page 18: Topological Data Analysis
Page 19: Topological Data Analysis
Page 20: Topological Data Analysis
Page 21: Topological Data Analysis
Page 22: Topological Data Analysis
Page 23: Topological Data Analysis

C

Page 24: Topological Data Analysis
Page 25: Topological Data Analysis
Page 26: Topological Data Analysis
Page 27: Topological Data Analysis
Page 28: Topological Data Analysis

Geometry of Data

• Consider 106 points and each point is a string of 100 numbers.– Is it one piece or more? – Is there a tunnel? Or a void?

• Point clouds in 100-D Euclidean space.

Page 29: Topological Data Analysis

Point Cloud

Page 30: Topological Data Analysis

Point Cloud

Page 31: Topological Data Analysis

Point Cloud

Page 32: Topological Data Analysis

Point Cloud

Page 33: Topological Data Analysis

Point Cloud

Page 34: Topological Data Analysis

Point Cloud

Page 35: Topological Data Analysis
Page 36: Topological Data Analysis

Triangulation

Page 37: Topological Data Analysis

Triangulation

Page 38: Topological Data Analysis

Triangulation

Page 39: Topological Data Analysis

Triangulation

Page 40: Topological Data Analysis

Triangulation

Page 41: Topological Data Analysis

Point Cloud

Page 42: Topological Data Analysis

MRI

Page 43: Topological Data Analysis

GIS – Elevation Model

Page 44: Topological Data Analysis

GIS – Urban Environment