Exact k-component graph learning for image clustering
Summary: The performance of graph-based clustering methods highly depends on the quality of the data affinity graph as a good affinity graph can approximate well the pairwise similarity between data samples. To a large extent, existing graph-based clustering methods construct the affinity graph based on a fixed distance metric, which is often not an accurate representation of the underlying data structure. Also, they require postprocessing on the affinity graph to obtain clustering results. Thus, the results are sensitive to the particular graph construction methods. To address these two drawbacks, we propose a \(k\)-component graph clustering \((k\)-GC) approach to learn an intrinsic affinity graph and to obtain clustering results simultaneously. Specifically, \(k\)-GC learns the data affinity graph by assigning the adaptive and optimal neighbors for each data point based on the local distances. Efficient iterative updating algorithms are derived for \(k\)-GC, along with proofs of convergence. Experiments on several benchmark datasets have demonstrated the effectiveness of \(k\)-GC.
- A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering
- Nonnegative self-representation with a fixed rank constraint for subspace clustering
- Learning robust affinity graph representation for multi-view clustering
- Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering
- Graph clustering with graph capsule network
- A clustering ensemble framework based on elite selection of weighted clusters
- A clustering ensemble framework based on selection of fuzzy weighted clusters in a locally adaptive clustering algorithm
- Convex Sparse Spectral Clustering: Single-View to Multi-View
- Depth-First Search and Linear Graph Algorithms
- Fast projection onto the simplex and the l₁ ball
- Feature Interaction Augmented Sparse Learning for Fast Kinect Motion Detection
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3061616 (Why is no real title available?)
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Robust path-based spectral clustering
- Spectral clustering with eigenvector selection
- Image clustering based on sparse patch alignment framework
- Simultaneous learning coefficient matrix and affinity graph for multiple kernel clustering
- Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering
- Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets
- scientific article; zbMATH DE number 2043372 (Why is no real title available?)
- Graph clustering with graph capsule network
- Graph refinement via simultaneously low-rank and sparse approximation
- Joint consensus kernel learning and adaptive hypergraph regularization for graph-based clustering
This page was built for publication: Exact \(k\)-component graph learning for image clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196940)
