Graph clustering by congruency approximation

Graph clustering by congruency approximation

The authors consider the general problem of graph clustering. Graph clustering manipulates the graph‐based data structure and the entries of the solution vectors are only allowed to take non‐negative discrete values. Finding the optimal solution is NP‐hard, so relaxations are usually considered. Spe...

Full description

Bibliographic Details
Main Authors: Weiya Ren, Guohui Li, Dan Tu
Format: Article
Language:English
Published: Wiley 2015-12-01
Series:IET Computer Vision
Subjects:
congruency approximation
graph-based data structure
solution vectors
nonnegative discrete values
NP-hard optimal solution
spectral clustering
Online Access:https://doi.org/10.1049/iet-cvi.2014.0131

Internet

https://doi.org/10.1049/iet-cvi.2014.0131

Similar Items