Block clustering based on difference of convex functions (DC) programming and DC algorithms
From MaRDI portal
Publication:5378276
DOI10.1162/NECO_A_00490zbMATH Open1418.62253OpenAlexW2122929847WikidataQ44534622 ScholiaQ44534622MaRDI QIDQ5378276FDOQ5378276
Authors: Le Thi Hoai An, Pham Dinh Tao, van Ngai Huynh, H. M. Le 
Publication date: 12 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00490
Recommendations
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- Optimization based DC programming and DCA for hierarchical clustering
- DCA-based algorithms for DC fitting
- A new efficient algorithm based on DC programming and DCA for clustering
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Block clustering with Bernoulli mixture models: comparison of different approaches
- A classification EM algorithm for clustering and two stochastic versions
- Clustering Criteria and Multivariate Normal Mixtures
- Model-Based Gaussian and Non-Gaussian Clustering
- The Concave-Convex Procedure
- On ψ-Learning
- Optimization strategies for two-mode partitioning
- Title not available (Why is that?)
- Two-mode clustering methods: astructuredoverview
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Multicategory ψ-Learning
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A new efficient algorithm based on DC programming and DCA for clustering
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A DC programming approach for feature selection in support vector machines learning
- Optimization based DC programming and DCA for hierarchical clustering
- DC Programming and DCA for General DC Programs
- Exact penalty and error bounds in DC programming
- Prior Learning and Convex-Concave Regularization of Binary Tomography
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
Cited In (12)
- A fast permuation-based algorithm for block clustering
- DC Programming and DCA for General DC Programs
- DC programming and DCA: thirty years of developments
- Clustering via d. c. optimization.
- DC approximation approaches for sparse optimization
- Self-organizing maps by difference of convex functions optimization
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- Open issues and recent advances in DC programming and DCA
- Efficient Nonnegative Matrix Factorization by DC Programming and DCA
- A new efficient algorithm based on DC programming and DCA for clustering
- Optimization based DC programming and DCA for hierarchical clustering
- Sparse Covariance Matrix Estimation by DCA-Based Algorithms
This page was built for publication: Block clustering based on difference of convex functions (DC) programming and DC algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378276)
