Presentation is loading. Please wait.

Presentation is loading. Please wait.

Default coloring is average filter value

Published byYan Faria Modified over 5 years ago

Similar presentations

Presentation on theme: "Default coloring is average filter value"— Presentation transcript:

1

2 Default coloring is average filter value

3 Can also specify color by filter function via
point_color = f

4 point_color = data[:,0]

5 point_color = (data[:,0]**2 + data[:,1]**2)**0.5

6 name = ‘length’; point_color = (data[:,0]**2 + data[:,1]**2)**0.5

7 Alternatively, can specify node color

8 Choose how to color vertices in TDA mapper graph
In Jupyter notebook Choose how to color vertices in TDA mapper graph Output the color code for each node in TDA mapper graph

9 Choose how to color vertices in TDA mapper graph
In Jupyter notebook Choose how to color vertices in TDA mapper graph Output the color code for each node in TDA mapper graph

10

11

Download ppt "Default coloring is average filter value"

Similar presentations

Coloring Warm-Up. A graph is 2-colorable iff it has no odd length cycles 1: If G has an odd-length cycle then G is not 2- colorable Proof: Let v 0, …,

Coloring Warm-Up. A graph is 2-colorable iff it has no odd length cycles 1: If G has an odd-length cycle then G is not 2- colorable Proof: Let v 0, …,
Inverses of Functions Part 2

Inverses of Functions Part 2
Find the solutions. Find the Vertex and Max (-1, 0) (5, 0) (2, 10)

Find the solutions. Find the Vertex and Max (-1, 0) (5, 0) (2, 10)
Graphs: basic definitions and notation Definition A (undirected, unweighted) graph is a pair G = (V, E), where V = {v 1, v 2,..., v n } is a set of vertices,

Graphs: basic definitions and notation Definition A (undirected, unweighted) graph is a pair G = (V, E), where V = {v 1, v 2,..., v n } is a set of vertices,
Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,

Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
Programming project #2 1 CS502 Spring 2006 Programming Project #3 Page Replacement Algorithms CS-502 Operating Systems Spring 2006.

Programming project #2 1 CS502 Spring 2006 Programming Project #3 Page Replacement Algorithms CS-502 Operating Systems Spring 2006.
Task Management Software needlestack. Radial View Each process instance represented by a line Length of line indicates time on current task.

Task Management Software needlestack. Radial View Each process instance represented by a line Length of line indicates time on current task.
Backtracking Reading Material: Chapter 13, Sections 1, 2, 4, and 5.

Backtracking Reading Material: Chapter 13, Sections 1, 2, 4, and 5.
New Algorithm DOM for Graph Coloring by Domination Covering

New Algorithm DOM for Graph Coloring by Domination Covering
Advanced Topics in Algorithms and Data Structures 1 Two parallel list ranking algorithms An O (log n ) time and O ( n log n ) work list ranking algorithm.

Advanced Topics in Algorithms and Data Structures 1 Two parallel list ranking algorithms An O (log n ) time and O ( n log n ) work list ranking algorithm.
Discrete and Continuous Functions

Discrete and Continuous Functions
Inverses Graph {(1,2), (2,-4), (5,2), (2, 0), (-1, 4)} ? {(2, 1), (-4, 2), (2, 5), (0,2), (4, -1)} These graphs are called inverses of each other. Graph.

Inverses Graph {(1,2), (2,-4), (5,2), (2, 0), (-1, 4)} ? {(2, 1), (-4, 2), (2, 5), (0,2), (4, -1)} These graphs are called inverses of each other. Graph.
A Shortest Path Algorithm. Motivation Given a connected, positive weighted graph Find the length of a shortest path from vertex a to vertex z.

A Shortest Path Algorithm. Motivation Given a connected, positive weighted graph Find the length of a shortest path from vertex a to vertex z.
COMP108 Time Complexity of Pseudo Code. Example 1 sum = 0 for i = 1 to n do begin sum = sum + A[i] end output sum O(n)

COMP108 Time Complexity of Pseudo Code. Example 1 sum = 0 for i = 1 to n do begin sum = sum + A[i] end output sum O(n)
Functions. Warm Up Solve each equation. 1.2x – 6 = 22 2.3 + 5x = -32 3.X + 29 = 14 4.6x – 5 – 4x = 17 x = 14 x = - 7 x = -15 x = 11.

Functions. Warm Up Solve each equation. 1.2x – 6 = x = X + 29 = x – 5 – 4x = 17 x = 14 x = - 7 x = -15 x = 11.
How can we show information in a chart or graph? Bar Graphs Pie Charts.

How can we show information in a chart or graph? Bar Graphs Pie Charts.
Using Excel to collect data from a virtual environment.

Using Excel to collect data from a virtual environment.
Homework Text p. 388, #8-22 evens and #19 8) domain: -2, -1, 0, 1; 8) domain: -2, -1, 0, 1; range: -9, 2, 4, 5 range: -9, 2, 4, 5 10) domain: -4, -3, 2,

Homework Text p. 388, #8-22 evens and #19 8) domain: -2, -1, 0, 1; 8) domain: -2, -1, 0, 1; range: -9, 2, 4, 5 range: -9, 2, 4, 5 10) domain: -4, -3, 2,
Math 71 2.2 – Graphs of Functions 1. Graph of a function: the graph of all the function’s ordered pairs 2.

Math – Graphs of Functions 1. Graph of a function: the graph of all the function’s ordered pairs 2.
Machine Learning (ML) with Weka Weka can classify data or approximate functions: choice of many algorithms.

Machine Learning (ML) with Weka Weka can classify data or approximate functions: choice of many algorithms.

Similar presentations

Ads by Google