Editing Graphs into Disjoint Unions of Dense Clusters.
Jiong GuoIyad A. KanjChristian KomusiewiczJohannes UhlmannPublished in: Algorithmica (2011)
Keyphrases
- graph clustering
- densely connected
- clustering algorithm
- arbitrary shape
- proximity graph
- pairwise
- weighted graph
- hierarchical clustering
- graph matching
- dense subgraphs
- quasi cliques
- dense regions
- pairwise similarities
- graph theoretic
- graph model
- graph theory
- bipartite graph
- cluster analysis
- subspace clustering
- graph databases
- spanning tree
- graph partitioning
- graph mining
- data objects
- data sets
- k means
- optical flow
- data points
- clustering method
- image editing
- graph kernels
- random graphs
- unsupervised clustering
- fuzzy clustering