Optimization based DC programming and DCA for hierarchical clustering
A hierarchical clustering of a set of objects can be described as a tree, in which the leaves are precisely the objects to be clustered. In this work different mathematical programs have been proposed for the bilevel hierarchical clustering problem. The proposed approach is based on DC (Difference of Convex functions) programming ``which deals with DC programs, i.e., the minimization of a DC function over a convex set and DC optimization Algorithm called DCA. They are all nonconvex, nonsmooth optimization problems that can be reformulated as DC programs in a suitable matrix space for which the resulting DCA schemes are all explicit, and very inexpensive. Numerical results on some artificial and real-world databases demonstrate that the proposed algorithms are more efficient than some existing optimization based clustering algorithms.
- A new efficient algorithm based on DC programming and DCA for clustering
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Block clustering based on difference of convex functions (DC) programming and DC algorithms
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- Clustering via d. c. optimization.
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Survey of Recent Advances in Hierarchical Clustering Algorithms
- Combinatorial Image Analysis
- Combined SVM-based feature selection and classification
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Exact penalty in d. c. programming
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1149424 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- On solving linear complementarity problems by DC programming and DCA
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- DC programming and DCA: thirty years of developments
- Visualizing data as objects by DC (difference of convex) optimization
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- A subgradient-based convex approximations method for DC programming and its applications
- A new efficient algorithm based on DC programming and DCA for clustering
- Binary classification via spherical separator by DC programming and DCA
- A DC programming approach for feature selection in support vector machines learning
- Optimality-based clustering: an inverse optimization approach
- Clustering via d. c. optimization.
- Learning sparse classifiers with difference of convex functions algorithms
- DC approximation approaches for sparse optimization
- A DC programming approach for sparse linear discriminant analysis
- Exact penalty and error bounds in DC programming
- Clustering and multifacility location with constraints via distance function penalty methods and DC programming
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- A flexible ILP formulation for hierarchical clustering
- DCA based algorithms for feature selection in multi-class support vector machine
- A DC programming approach for sparse estimation of a covariance matrix
- Block clustering based on difference of convex functions (DC) programming and DC algorithms
- Efficient nonnegative matrix factorization by DC programming and DCA
- Sparse covariance matrix estimation by DCA-based algorithms
- A DC Programming Approach for Finding Communities in Networks
- Dynamic clustering based on universal gravitation model
- A DC optimization approach for constrained clustering with _1-norm
- Open issues and recent advances in DC programming and DCA
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Novel quadratic programming approach for time series clustering with biomedical application
This page was built for publication: Optimization based DC programming and DCA for hierarchical clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643938)
