An incremental clustering algorithm based on hyperbolic smoothing

DOI10.1007/s10589-014-9711-7zbMath1309.90098OpenAlexW2077832370MaRDI QIDQ2340498

Burak Ordin, Gurkan Ozturk, Adilson Elias Xavier, Adil M. Bagirov

Publication date: 20 April 2015

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-014-9711-7

zbMATH Keywords

nonsmooth optimizationnonlinear programmingcluster analysissmoothing techniques

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (8)

Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ An efficient heuristic for the \(k\)-partitioning problem ⋮ Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ A novel optimization approach towards improving separability of clusters ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ A logic-based approach to incremental reasoning on multi-agent systems

Uses Software

• TSPLIB
• UCI-ml
• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Optimal covering of plane domains by circles via hyperbolic smoothing
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Cluster analysis and mathematical programming
• Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
• Variable neighborhood decomposition search
• A global optimization approach to classification
• A receding-horizon regulator for nonlinear systems and a neural approximation
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• The hyperbolic smoothing clustering method
• Hyperbolic smoothing function method for minimax problems
• Determination of the collapse load of plastic structures by the use of an upper bounding algorithm
• TSPLIB—A Traveling Salesman Problem Library
• A Branch and Bound Clustering Algorithm
• Cluster analysis by simulated annealing
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Evaluation of a Branch and Bound Algorithm for Clustering
• An algorithm for minimizing clustering functions
• A Dynamic Programming Algorithm for Cluster Analysis
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: An incremental clustering algorithm based on hyperbolic smoothing