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 –

Slides:



Advertisements
Similar presentations
Clustering II.
Advertisements

Clustering.
Cluster Analysis: Basic Concepts and Algorithms
1 CSE 980: Data Mining Lecture 16: Hierarchical Clustering.
Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
Hierarchical Clustering, DBSCAN The EM Algorithm
Networks Prim’s Algorithm
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Data Mining Cluster Analysis: Basic Concepts and Algorithms
IKI 10100: Data Structures & Algorithms Ruli Manurung (acknowledgments to Denny & Ade Azurat) 1 Fasilkom UI Ruli Manurung (Fasilkom UI)IKI10100: Lecture10.
MINIMAL CONNECTOR PROBLEMS Problem: A cable TV company is installing a system of cables to connect all the towns in a region. The numbers in the network.
Introduction to Bioinformatics
Clustering and greedy algorithms — Part 2 Prof. Noah Snavely CS1114
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.
Chapter 9: Greedy Algorithms The Design and Analysis of Algorithms.
Chapter 9 Greedy Technique Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Cluster Analysis: Basic Concepts and Algorithms
Minimum Spanning Trees CIS 606 Spring Problem A town has a set of houses and a set of roads. A road connects 2 and only 2 houses. A road connecting.
An Interval MST Procedure Rebecca Nugent w/ Werner Stuetzle November 16, 2004.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Network Flow Models Chapter 7.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Introduction to Management Science
NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.
Minimum Spanning Trees What is a MST (Minimum Spanning Tree) and how to find it with Prim’s algorithm and Kruskal’s algorithm.
Minimum Spanning Tree Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2008.
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Graph Dr. Bernard Chen Ph.D. University of Central Arkansas.
1 Converting Categories to Numbers for Approximate Nearest Neighbor Search 嘉義大學資工系 郭煌政 2004/10/20.
COSC 2007 Data Structures II Chapter 14 Graphs III.
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
Graphs. Definitions A graph is two sets. A graph is two sets. –A set of nodes or vertices V –A set of edges E Edges connect nodes. Edges connect nodes.
A. Levitin “Introduction to the Design & Analysis of Algorithms,” 3rd ed., Ch. 9 ©2012 Pearson Education, Inc. Upper Saddle River, NJ. All Rights Reserved.
Minimal Spanning Tree Problems in What is a minimal spanning tree An MST is a tree (set of edges) that connects all nodes in a graph, using.
Clustering.
K-Means Algorithm Each cluster is represented by the mean value of the objects in the cluster Input: set of objects (n), no of clusters (k) Output:
1 Prim’s algorithm. 2 Minimum Spanning Tree Given a weighted undirected graph G, find a tree T that spans all the vertices of G and minimizes the sum.
1 Greedy Technique Constructs a solution to an optimization problem piece by piece through a sequence of choices that are: b feasible b locally optimal.
Lecture 19 Minimal Spanning Trees CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Flow cytometry data analysis: SPADE for cell population identification and sample clustering Narahara.
1 1 Slide © 2005 Thomson/South-Western Chapter 9 Network Models n Shortest-Route Problem n Minimal Spanning Tree Problem n Maximal Flow Problem.
Operations Research II Course,, September Part 2: Network Flow Operations Research II Dr. Aref Rashad.
Graph Search Applications, Minimum Spanning Tree
CSE 4705 Artificial Intelligence
Hierarchical Clustering: Time and Space requirements
Minimum Spanning Trees
Greedy Technique.
Minimum Spanning Trees
Data Clustering Michael J. Watts
Autumn 2016 Lecture 11 Minimum Spanning Trees (Part II)
Graph Algorithm.
Minimum Spanning Tree.
Connected Components Minimum Spanning Tree
Graph Algorithm.
Minimum Spanning Tree.
Autumn 2015 Lecture 11 Minimum Spanning Trees (Part II)
Autumn 2015 Lecture 10 Minimum Spanning Trees
Richard Anderson Lecture 10 Minimum Spanning Trees
ICS 353: Design and Analysis of Algorithms
Networks Prim’s Algorithm
Minimum spanning trees
Minimum Spanning Trees (MSTs)
Winter 2019 Lecture 11 Minimum Spanning Trees (Part II)
Hierarchical Clustering
Graph Algorithm.
Autumn 2019 Lecture 11 Minimum Spanning Trees (Part II)
Presentation transcript:

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. A ε-connected set is a set that any two points can be linked by an ε-chain. A ε-connected component is a maximal ε- connected subset.

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. A ε-connected set is a set that any two points can be linked by an ε-chain. A ε-connected component is a maximal ε- connected subset. ε

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) ε

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

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

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

Topological Data Analysis (TDA)

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

C

Geometry of Data Consider 10 6 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.

Point Cloud

Triangulation

Point Cloud

MRI

GIS – Elevation Model

GIS – Urban Environment