{"id":"W2135957668","doi":"10.1109/tpami.2007.1115","title":"Weighted Graph Cuts without Eigenvectors A Multilevel Approach","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1038,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Cluster analysis; Correlation clustering; Spectral clustering; Rand index; Computer science; Pattern recognition (psychology); Kernel (algebra); Hierarchical clustering; Canopy clustering algorithm; Clustering coefficient; Graph partition; Computation; CURE data clustering algorithm; Graph; Algorithm; Mathematics; Artificial intelligence; Theoretical computer science; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null}