Community Detection  Definition: Community Detection  Girwan Newman Approach  Hierarchical Clustering.

Slides:

Advertisements

Similar presentations

Presenter: Guoliang Liu Date:4/25/2012. Background Introduction Definition Basic idea of partition Quality Function Classification Based On Algorithms.

Advertisements

Clustering k-mean clustering Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein.

Hierarchical Clustering

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

Introduction to Graph Cluster Analysis. Outline Introduction to Cluster Analysis Types of Graph Cluster Analysis Algorithms for Graph Clustering  k-Spanning.

Data Mining Cluster Analysis: Advanced Concepts and Algorithms

Data Mining Cluster Analysis: Basic Concepts and Algorithms

Agglomerative Hierarchical Clustering 1. Compute a distance matrix 2. Merge the two closest clusters 3. Update the distance matrix 4. Repeat Step 2 until.

Community Detection Algorithm and Community Quality Metric Mingming Chen & Boleslaw K. Szymanski Department of Computer Science Rensselaer Polytechnic.

© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ What is Cluster Analysis? l Finding groups of objects such that the objects in a group will.

© Tan,Steinbach, Kumar Introduction to Data Mining 1/17/ Data Mining Cluster Analysis: Advanced Concepts and Algorithms Figures for Chapter 9 Introduction.

Data Mining Cluster Analysis: Advanced Concepts and Algorithms Lecture Notes for Chapter 9 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach,

© Tan,Steinbach, Kumar Introduction to Data Mining 1/17/ Data Mining Cluster Analysis: Basic Concepts and Algorithms Figures for Chapter 8 Introduction.

© Tan,Steinbach, Kumar Introduction to Data Mining 1/17/ Data Mining Anomaly Detection Figures for Chapter 10 Introduction to Data Mining by Tan,

Fast algorithm for detecting community structure in networks.

Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,

Topologically biased random walks with application for community finding Vinko Zlatić Dep. Of Physics, “Sapienza”, Roma, Italia Theoretical Physics Division,

Introduction to Hierarchical Clustering Analysis Pengyu Hong 09/16/2005.

© Tan,Steinbach, Kumar Introduction to Data Mining 1/17/ Data Mining Classification: Alternative Techniques Figures for Chapter 5 Introduction to.

© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.

Fast Agglomerative Clustering for Rendering Bruce Walter, Kavita Bala, Cornell University Milind Kulkarni, Keshav Pingali University of Texas, Austin.

© Tan,Steinbach, Kumar Introduction to Data Mining 1/17/ Data Mining: Exploring Data Figures for Chapter 3 Introduction to Data Mining by Tan, Steinbach,

© Tan,Steinbach, Kumar Introduction to Data Mining 1/17/ Data Mining Association Analysis: Advanced Concepts Figures for Chapter 7 Introduction to.

Chapter 13 Genetic Algorithms. 2 Data Mining Techniques So Far… Chapter 5 – Statistics Chapter 6 – Decision Trees Chapter 7 – Neural Networks Chapter.

Graph preprocessing. Common Neighborhood Similarity (CNS) measures.

Community detection algorithms: a comparative analysis Santo Fortunato.

Discovering Community Structure

CSE5334 DATA MINING CSE4334/5334 Data Mining, Fall 2014 Department of Computer Science and Engineering, University of Texas at Arlington Chengkai Li (Slides.

Prepared by: Mahmoud Rafeek Al-Farra

Data Mining Cluster Analysis: Advanced Concepts and Algorithms Lecture Notes for Chapter 9 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach,

Communities. Questions 1.What is a community (intuitively)? Examples and fundamental hypothesis 2.What do we really mean by communities? Basic definitions.

Community Detection Algorithms: A Comparative Analysis Authors: A. Lancichinetti and S. Fortunato Presented by: Ravi Tiwari.

Spontaneous Formation of Dynamical Groups in an Adaptive Networked System Li Menghui, Guan Shuguang, Lai Choy-Heng Temasek Laboratories National University.

Hierarchical Clustering Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree like diagram that.

Data Mining Cluster Analysis: Advanced Concepts and Algorithms

Data Mining Cluster Analysis: Basic Concepts and Algorithms Lecture Notes for Chapter 8 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach,

Community Discovery in Social Network Yunming Ye Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology.

Hierarchical Clustering

Community detection via random walk Draft slides.

© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ Data Mining: Cluster Analysis This lecture node is modified based on Lecture Notes for Chapter.

Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”

Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems M. RosvallM. Rosvall and C. T. BergstromC.

James Hipp Senior, Clemson University.  Graph Representation G = (V, E) V = Set of Vertices E = Set of Edges  Adjacency Matrix  No Self-Inclusion (i.

Clustering Microarray Data based on Density and Shared Nearest Neighbor Measure CATA’06, March 23-25, 2006 Seattle, WA, USA Ranapratap Syamala, Taufik.

Data Mining Cluster Analysis: Basic Concepts and Algorithms Lecture Notes Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach, Kumar Introduction.

Data Mining Classification and Clustering Techniques Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach, Kumar Introduction to Data Mining.

Department of Computer and IT Engineering University of Kurdistan Social Network Analysis Communities By: Dr. Alireza Abdollahpouri.

Graph clustering to detect network modules

Hierarchical Agglomerative Clustering on graphs

Modularity Maximization

Community detection in graphs

Data Mining Cluster Analysis: Advanced Concepts and Algorithms

Chapter 17 Linked Lists.

Michael L. Nelson CS 495/595 Old Dominion University

CS223: Software Engineering

Polydactyly L.A. Lettice, et al. Proc. Natl. Acad. Sci. USA 2002; 99(11):

Noémi Gaskó, Rodica Ioana Lung, Mihai Alexandru Suciu

Copyright © 2011 Pearson Education, Inc

The 3D models in part a are reproduced with permission from Daum, B

3.3 Network-Centric Community Detection

Chapter 5 Algorithm Analysis.

Hierarchical Clustering

Introduction: Some Representative Problems

Hierarchical Clustering

Chapter 6 Dynamic Programming.

Chapter 2 Reference Types.

Chapter 4 Greedy Algorithms.

Copyright © 2011 Pearson Education, Inc

Presentation transcript:

Community Detection  Definition: Community Detection  Girwan Newman Approach  Hierarchical Clustering

Community Detection

Community Detection: Girvan Newman Approach

Girwan Newman Approach: Modularity

Variations of Girwan Newman Algorithm

Hierarchical Clustering Algorithms Important: 1.Clustering obtained by cutting the dendo-gram at a desired level. 2.Each connected component forms a cluster. 3.Basically we use some similarity threshold to get the clusters of desired quality.

Hierarchical Clustering Algorithms

Variations of Agglomerative clustering-1

Variations of Agglomerative clustering-2

Variations of Agglomerative clustering-3

Strength & Weaknesses Strengths of Hierarchical Clustering: Do not require information regarding number of clusters. Any desired number of clusters can be obtained by ‘cutting’ the dendogram at the proper level. Weaknesses: Not efficient -- the complexity is O(n^2). Once a decision is made to combine two clusters, it cannot be undone. No objective function is directly minimized.

Pseudo code – Agglomerative Clustering Source: Walter et. al.; Fast Agglomerative Clustering for Rendering

Pseudo code Pseudo code for Agglomerative Clustering, based on KD-Tree

References P.-N. Tan, M. Steinbach, and V. Kumar, editors. "Introduction to Data Mining." Pearson Addison Wesley, B. Walter, K. Bala, M. Kulkarni, and K. Pingali. "Fast Agglomerative Clustering for Rendering." IEEE Symposium on Interactive Ray Tracing, Girvan M. and Newman M. E. J., Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA 99, 7821– 7826 (2002) Andrea Lancichinetti and Santo Fortunato (2011). "Limits of modularity maximization in community detection". Physical Review E 84: arXiv: Survey article Communities in Networks (Notices of the American Mathematical Society.