An incremental clustering algorithm based on hyperbolic smoothing
From MaRDI portal
Publication:2340498
Recommendations
- The hyperbolic smoothing clustering method
- An algorithm for minimizing clustering functions
- An algorithm for clustering based on non-smooth optimization techniques
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- New diagonal bundle method for clustering problems in large data sets
Cites work
- A Branch and Bound Clustering Algorithm
- A Dynamic Programming Algorithm for Cluster Analysis
- A global optimization approach to classification
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A receding-horizon regulator for nonlinear systems and a neural approximation
- An algorithm for minimizing clustering functions
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Cluster analysis and mathematical programming
- Cluster analysis by simulated annealing
- Determination of the collapse load of plastic structures by the use of an upper bounding algorithm
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Evaluation of a Branch and Bound Algorithm for Clustering
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- scientific article; zbMATH DE number 5957421 (Why is no real title available?)
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 1535760 (Why is no real title available?)
- Hyperbolic smoothing function method for minimax problems
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Optimal covering of plane domains by circles via hyperbolic smoothing
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- The hyperbolic smoothing clustering method
- TSPLIB—A Traveling Salesman Problem Library
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Variable neighborhood decomposition search
Cited in
(12)- New diagonal bundle method for clustering problems in large data sets
- An incremental density-based clustering framework using fuzzy local clustering
- A logic-based approach to incremental reasoning on multi-agent systems
- Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- The hyperbolic smoothing clustering method
- An algorithm for clustering based on non-smooth optimization techniques
- An efficient heuristic for the \(k\)-partitioning problem
- Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations
- A novel optimization approach towards improving separability of clusters
- Dislocation hyperbolic kernel function
This page was built for publication: An incremental clustering algorithm based on hyperbolic smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340498)
