Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering
From MaRDI portal
Publication:2670543
Recommendations
- Exact \(k\)-component graph learning for image clustering
- Low-rank doubly stochastic matrix decomposition for cluster analysis
- Dominant-set clustering using multiple affinity matrices
- Similarity-based clustering by left-stochastic matrix factorization
- A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering
Cites work
- A cutting plane algorithm for a clustering problem
- A polynomial algorithm for balanced clustering via graph partitioning
- An Operation Partitioning Problem for Automated Assembly System Design
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Cluster Analysis
- Cluster analysis and mathematical programming
- Concerning nonnegative matrices and doubly stochastic matrices
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Fast Clustering Algorithms
- Functional Operators (AM-22), Volume 2
- scientific article; zbMATH DE number 3854180 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 2222601 (Why is no real title available?)
- scientific article; zbMATH DE number 3061616 (Why is no real title available?)
- Kernel methods in machine learning
- NP-hardness of Euclidean sum-of-squares clustering
- On Projection Algorithms for Solving Convex Feasibility Problems
- Projection matrices, generalized inverse matrices, and singular value decomposition.
- Proximal splitting methods in signal processing
- Scikit-learn: machine learning in Python
- Spectral methods for graph clustering - a survey
- Two Results Concerning Doubly Stochastic Matrices
Cited in
(5)- Exact \(k\)-component graph learning for image clustering
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing
- Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling
- A consistent and integrated network analysis framework for decoding interlinkages between sustainable development indicators at the global scale
This page was built for publication: Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670543)
