Presentation is loading. Please wait.

Presentation is loading. Please wait.

Sam Somuah REU-DIMACS 2010 Mentor: James Abello

Published byAdelia Bruce Modified over 6 years ago

Similar presentations

Presentation on theme: "Sam Somuah REU-DIMACS 2010 Mentor: James Abello"— Presentation transcript:

1 Sam Somuah REU-DIMACS 2010 Mentor: James Abello
Graph Mining Sam Somuah REU-DIMACS 2010 Mentor: James Abello

2 Outline Converting Data to Graphs using similarity measures
Project Data REU Participant Surveys DIMACS Workshop Abstracts Challenges Choosing “good” similarity measures Visualizing and detecting “interesting clusters”

3 REU-Participant Data

4 Procedure Convert each record into a smaller representative vector
“Aggregate” similar weighted attributes Convert the remaining weighted attributes into 3 digit numbers Leave binary attributes alone

5 Creating Graphs Each record becomes one vertex in the graph, joined by a weighted edge between them. Edge-weights: The calculated similarity between two records. Vertex-weights: The distance between each vector and a reference vector(eg. Zero vector or …)

6 Similarity Measures for Edge-Weights
Hellinger Distance Euclidean Distance

7 Similarity Measures Math Math:1 Comp.Sci:1 Biology:0
Jaccard Coefficient Math:1 Comp.Sci:1 Biology:0 Math:1 Comp.Sci:0 Biology:0 Math

8 Similarity Measures Jaccard Coefficient

9 Creating the Graph Use the GraphView software to visualize the graph.
Significance of colours

10 Pruning Graphs One method is using a Minimum Spanning Tree(MST)

11 Clustering We will derive clusters from the MST
A Cluster C is a set of nodes that are more similar to each other than to its complement. Clusters

12 Conclusion We can transform attributed data ( i.e. collection of records on a set of attributes) into weighted graphs, using a variety of similarity measures among the records. Visualizations of the weighted graphs can then be used to locate similar records and devise algorithms that can automatically create clusters from such datasets. These methods will also be used on larger datasets such as the DIMACS Workshop Abstracts and Publications.

13 References James Abello, Frank van Ham, and Neeraj Krishnan ASK-GraphView : A Large Scale Graph Visualization System IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 12, NO. 5, SEPTEMBER/OCTOBER 2006 Zahn, Charles Graph Theoretical Methods for Detecting and Describing Gestalt Clusters IEEE TRANSACTIONS ON COMPUTERS VOL. C- 20 No.1 January 1971

Download ppt "Sam Somuah REU-DIMACS 2010 Mentor: James Abello"

Similar presentations

Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.

Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
DIFFERENTIAL PRIVACY REU Project Mentors: Darakhshan Mir James Abello Marco A. Perez.

DIFFERENTIAL PRIVACY REU Project Mentors: Darakhshan Mir James Abello Marco A. Perez.
Clustering.

Clustering.
Learning Trajectory Patterns by Clustering: Comparative Evaluation Group D.

Learning Trajectory Patterns by Clustering: Comparative Evaluation Group D.
Clustering Categorical Data The Case of Quran Verses

Clustering Categorical Data The Case of Quran Verses
Three things everyone should know to improve object retrieval

Three things everyone should know to improve object retrieval
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.

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 Techniques: Clustering

Data Mining Techniques: Clustering
CMU SCS 15-826: Multimedia Databases and Data Mining Lecture #16: Text - part III: Vector space model and clustering C. Faloutsos.

CMU SCS : Multimedia Databases and Data Mining Lecture #16: Text - part III: Vector space model and clustering C. Faloutsos.
Terminology species data = the measured variables we want to explain (response or dependent variables) environmental data = the variables we use for explaining.

Terminology species data = the measured variables we want to explain (response or dependent variables) environmental data = the variables we use for explaining.
Graph Algorithms: Minimum Spanning Tree 1 2 3 4 6 5 10 1 5 4 3 2 6 1 1 8 We are given a weighted, undirected graph G = (V, E), with weight function w:

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.

Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
Visual Mining of Communities in Complex Networks: Bringing Humans Into the Loop Perceptual Science and Technology REU Jack Murtagh & Florentina Ferati.

Visual Mining of Communities in Complex Networks: Bringing Humans Into the Loop Perceptual Science and Technology REU Jack Murtagh & Florentina Ferati.
University of CreteCS4831 The use of Minimum Spanning Trees in microarray expression data Gkirtzou Ekaterini.

University of CreteCS4831 The use of Minimum Spanning Trees in microarray expression data Gkirtzou Ekaterini.
Distinguishing Photographic Images and Photorealistic Computer Graphics Using Visual Vocabulary on Local Image Edges Rong Zhang,Rand-Ding Wang, and Tian-Tsong.

Distinguishing Photographic Images and Photorealistic Computer Graphics Using Visual Vocabulary on Local Image Edges Rong Zhang,Rand-Ding Wang, and Tian-Tsong.
Segmentation Graph-Theoretic Clustering.

Segmentation Graph-Theoretic Clustering.
1 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.

1 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.
Interactive Visualization of the Stock Market Graph Presented by Camilo Rostoker Department of Computer Science University of British.

Interactive Visualization of the Stock Market Graph Presented by Camilo Rostoker Department of Computer Science University of British.
Protein Encoding Optimization Student: Logan Everett Mentor: Endre Boros Funded by DIMACS REU 2004.

Protein Encoding Optimization Student: Logan Everett Mentor: Endre Boros Funded by DIMACS REU 2004.
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.

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.

Similar presentations

Ads by Google