Graph Mining Rutgers University图挖掘罗格斯大学.pptVIP

Sam Somuah REU-DIMACS 2010 Mentor: James Abello 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” 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 Each record becomes one vertex in the graph, joined by a weighted edge between them. Edge-weights: The calculated similarity between two rec