Minimization subproblems and heuristics for an applied clustering problem

DOI10.1016/S0377-2217(02)00208-4MaRDI QIDQ1869508zbMATH OpenFDO

Authors E. G. Birgin, J. M. Martínez, Débora P. Ronconi

Publication date 10 April 2003

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

clusteringclassificationheuristicsnonlinear programmingfixed points

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On a robust approach to search for cluster centers
• \(k\)-means algorithm
• Clustering to minimize the maximum intercluster distance
• Center-based \(l_1\)-clustering method
• An algorithm for minimizing clustering functions

Cites work

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• scientific article; zbMATH DE number 3497220 (Why is no real title available?)
• scientific article; zbMATH DE number 3537174 (Why is no real title available?)
• scientific article; zbMATH DE number 1472778 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A robust algorithm for automatic extraction of an unknown number of clusters from noisy data
• Algorithm 813
• Automatic differentiation and spectral projected gradient methods for optimal control problems
• Clusterwise linear regression
• Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
• Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
• Improved clustering using deterministic annealing with a gradient descent technique
• Integrating robust clustering techniques in S-PLUS
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• On the Barzilai and Borwein choice of steplength for the gradient method
• Part-family formation for cellular manufacturing: A case study at Harnischfeger
• Preconditioned spectral gradient method
• Qualitative robustness for stochastic processes
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• \(L_1\) cluster analysis
• c-means clustering with the l/sub l/ and l/sub infinity / norms

Cited in

(7)

• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system
• Hybrid spectral gradient method for the unconstrained minimization problem
• Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate
• Generalized order-value optimization
• On a robust approach to search for cluster centers
• Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering

Describes a project that uses

Uses Software

• SPG

This page was built for publication: Minimization subproblems and heuristics for an applied clustering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869508)