Exact \(k\)-component graph learning for image clustering

DOI10.1155/2020/5175210zbMath1459.68172OpenAlexW3047322147MaRDI QIDQ2196940

Yaonan Zhang, Yufang Min

Publication date: 4 September 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/5175210

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Image analysis in multivariate analysis (62H35) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10)

Uses Software

• COIL-20

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast projection onto the simplex and the \(l_1\) ball
• 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
• Robust path-based spectral clustering
• Spectral clustering with eigenvector selection
• On the Sum of the Largest Eigenvalues of a Symmetric Matrix
• Convex Sparse Spectral Clustering: Single-View to Multi-View
• Feature Interaction Augmented Sparse Learning for Fast Kinect Motion Detection
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Exact \(k\)-component graph learning for image clustering