{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Com_NP-hard - On Modularity Clustering Presented by Group...

Info icon This preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
On Modularity Clustering Presented by: Group III (Ying Xuan, Swati Gambhir & Ravi Tiwari)
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Modularity y A quality index for clustering a graph G=(VE) A quality index for clustering a graph G=(V,E) 2 ' ( ) ( , ') ( ) ( ) : 2 C C C C C E C E C C E C q m m + = This is equivalent to: 2 deg( ) ( ) ( ) v C C v E C ) : 2 C C q m m =
Image of page 2
Contribution of the Paper y Integer Linear Program Formulation y Fundamental Observations & Counterintuitive Behavior y NP C l t f M i i i M d l it P bl NP- Completeness of Maximizing Modularity Problem y A Greedy Algorithm y Optimality Results
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon