Guest lecturer: Isabel K. Darcy

Slides:



Advertisements
Similar presentations
What is a Flow Chart ? An organized combination of shapes, lines, and text that graphically illustrates a process or structure A pictorial representation.
Advertisements

QR Code Recognition Based On Image Processing
Lecture 1: The Euler characteristic of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific.

Network Routing Algorithms Patricia Désiré Marconi Academy, CPS IIT Research Mentor: Dr. Tricha Anjali This material is based upon work supported by the.
Numerical Methods Golden Section Search Method - Theory

Topological Data Analysis
Being Smart with Graphs This material is based upon work supported by the National Science Foundation under Grant No. DRL ==≠≠ == Any opinions,
Numerical Methods Multi Dimensional Direct Search Methods - Theory
Optional Lecture: A terse introduction to simplicial complexes in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305)
This work was partially supported by the Joint DMS/NIGMS Initiative to Support Research in the Area of Mathematical Biology (NSF ). Isabel K. Darcy.
Math – Graphs of Functions 1. Graph of a function: the graph of all the function’s ordered pairs 2.
Introduction to Pattern Recognition (การรู้จํารูปแบบเบื้องต้น)
Sketching By Brian Nettleton This material is based upon work supported by the National Science Foundation under Grant No Any opinions, findings.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Sept 9, 2013: Create your own homology. Fall 2013.
Welcome to MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Week 1: Introduction to Topological Data.
3D mesh watermarking Wu Dan Introduction Spatial domain (00 EG) Transformed domain (02 EG) K=D-A; (D ii is a degree of vertex v i, A is an.
Deepening Teacher Math Content Knowledge MMP Key Components of High Quality Professional Development DeAnn Huinker & Kevin McLeod University of Wisconsin-Milwaukee.
Sept 25, 2013: Applicable Triangulations.

Goals for Thursday’s lab (meet in basement B5 MLH):
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Nov 22, 2013: Topological methods for exploring low-density.
Simplifying Radical Expressions
Chapter 7 Absolute Value and Reciprocal Funtions
Hierarchical clustering
Hierarchical clustering
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
We propose a method which can be used to reduce high dimensional data sets into simplicial complexes with far fewer points which can capture topological.
Structural Properties of Networks: Introduction
Sept 23, 2013: Image data Application.
Main Project total points: 500
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Nov 22, 2013: Topological methods for exploring low-density.
Numerical Methods Multi Dimensional Direct Search Methods - Example
Discussion and Conclusion
2-1 Relations and Functions
Main Project total points: 500
Teaching Mathematics for Learning: Standards Aligned System
Object Recognition in the Dynamic Link Architecture
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
5.3. Mapper on 3D Shape Database
Greedy Algorithms / Interval Scheduling Yin Tat Lee
UMass Lowell Dept. of Computer Science  Graduate School of Education
Mapper.
See also mappersummary2a
4.2 Data Input-Output Representation
Clustering Via Persistent Homology
What is a Flow Chart ? An organized combination of shapes, lines, and text that graphically illustrates a process or structure A pictorial representation.
Nanotechnology & Society
Elliptic Partial Differential Equations – Direct Method
Guest lecturer: Isabel K. Darcy
Advanced Algorithms Analysis and Design
Nanotechnology & Society
Precalculus Essentials
Title of session For Event Plus Presenters 12/5/2018.
Nanotechnology & Society
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Filtering Things to take away from this lecture An image as a function
By Charlie Fractal Mentor: Dr. Vignesh Subbian
Project HW 6 (Due 3/4) points You are given the following dataset to analyze using TDA Mapper a.) What do you expect the output of TDA mapper to.
Numerical Methods Golden Section Search Method - Example
Nanotechnology & Society
Guest lecturer: Isabel K. Darcy
Numerical Methods Newton’s Method for One -Dimensional Optimization - Example
Topological Signatures For Fast Mobility Analysis
ESR in a Consulting Environment
This material is based upon work supported by the National Science Foundation under Grant #XXXXXX. Any opinions, findings, and conclusions or recommendations.
Presentation transcript:

Discussion and Summary Gurjeet Singh , Facundo Mémoli and Gunnar Carlsson’s Mapper Algorithm Guest lecturer: Isabel K. Darcy Mathematics Department/Applied Mathematical & Computational Sciences University of Iowa http://www.math.uiowa.edu/~idarcy/ This material is based upon work supported by the National Science Foundation under Grant No. DMS-1407216: EXTREEMS-QED: Large Data Analysis and Visualization at the University of Iowa Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.

http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

Example: Point cloud data representing a hand. A) Data Set Example: Point cloud data representing a hand. B) Function f : Data Set  R Example: x-coordinate f : (x, y, z)  x Put data into overlapping bins. Example: f-1(ai, bi) Cluster each bin & create network. Vertex = a cluster of a bin. Edge = nonempty intersection between clusters http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

Note: we made many, many choices It helps to know what you are doing when you make choices, so collaborating with others is highly recommended.

We chose how to model the data set A) Data Set Example: Point cloud data representing a hand. Be creative. Use ideas from pure and applied math (including stat) as well as area of application Missing data, noise http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

Chose filter function Function f : Data Set  R Ex 1: x-coordinate f : (x, y, z)  x Chose filter function http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

Chose filter function Function f : Data Set  R Ex 1: x-coordinate f : (x, y, z)  x Ex 2: y-coordinate g : (x, y, z)  y Chose filter function http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

f(x) = max{d(x, p) : p in data set} Function f : Data Set  R Ex 1: x-coordinate f : (x, y, z)  x Chose filter function Possible filter functions: Principle component analysis L-infinity centrality: f(x) = max{d(x, p) : p in data set} Norm: f(x) = ||x || = length of x Need distance Depends on what prop you want to explore Can also choose any co-domain http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

Put data into overlapping bins. Example: f-1(ai, bi) Chose bins Put data into overlapping bins. Example: f-1(ai, bi) If equal length intervals: Choose length. Choose % overlap. Need covering Resolution multiscale http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

Create overlapping bins: http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

Normally need a definition of distance between data points Chose how to cluster. Normally need a definition of distance between data points Cluster each bin & create network. Vertex = a cluster of a bin. Edge = nonempty intersection between clusters http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

Note: Many, many choices were made It helps to know what you are doing when you make choices, so collaborating with others is highly recommended.

Note: Many, many choices were made “It is useful to think of it as a camera, with lens adjustments and other settings. A different filter function may generate a network with a different shape, thus allowing one to explore the data from a different mathematical perspective.” http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

Note: we made many, many choices “It is useful to think of it as a camera, with lens adjustments and other settings. A different filter function may generate a network with a different shape, thus allowing one to explore the data from a different mathematical perspective.” False positives??? http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

False Positives will occur https://xkcd.com/882/

False positives vs. robustness Note: Many, many choices were made “It is useful to think of it as a camera, with lens adjustments and other settings. A different filter function may generate a network with a different shape, thus allowing one to explore the data from a different mathematical perspective.” False positives vs. robustness http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

No dependence on the coordinate system chosen. Three key ideas of topology that make extracting of patterns via shape possible. 1.) coordinate free. No dependence on the coordinate system chosen. Can compare data derived from different platforms 2.) invariant under “small” deformations. less sensitive to noise 3.) compressed representations of shapes. Input: dataset with thousands of points Output: network with 13 vertices and 12 edges. http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html

http://www.nature.com/srep/2013/130207/srep01236/full/srep01236.html