A fast spectral cluster algorithm based on bipartite graph.
Li-mao HanSen XuTian ZhouPublished in: EMEIT (2011)
Keyphrases
- bipartite graph
- learning algorithm
- np hard
- dynamic programming
- maximum matching
- k means
- data clustering
- matching algorithm
- maximum cardinality
- maximum weight
- hierarchical clustering
- ant colony optimization
- worst case
- search space
- graph clustering
- minimum weight
- lower bound
- mutual reinforcement
- training data
- hits algorithm
- social networks