Set partition by globally optimized cluster seed points

DOI10.1016/0377-2217(91)90152-LzbMath0732.90050MaRDI QIDQ809887

János D. Pintér, Géza Pesti

Publication date: 1991

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

zbMATH Keywords

global optimization; location; set partition; data classification; cluster seed points

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C27: Combinatorial optimization

90B80: Discrete location and assignment

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Genetic clustering algorithms., Stochastic modelling and optimization for environmental management, Globally optimized calibration of environmental models, Convergence qualification of adaptive partition algorithms in global optimization, Optimal separable partitioning in the plane, On the convergence of adaptive partition algorithms in global optimization

Uses Software

• Silhouettes
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum sum of diameters clustering
• Maximum sum-of-splits clustering
• Extended univariate algorithms for \(n\)-dimensional global optimization
• Global optimization on convex sets
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Constrained global optimization: algorithms and applications
• Hierarchical clustering schemes
• Cluster Analysis: An Application of Lagrangian Relaxation
• Globally convergent methods for n-dimensional multiextremal optimization
• The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• Bicriterion Cluster Analysis
• Algorithmic complexity: threeNP- hard problems in computational statistics
• Finding Groups in Data
• Printer graphics for clustering
• Integer Programming and the Theory of Grouping
• Cluster Analysis and Mathematical Programming
• A Sequential Method Seeking the Global Maximum of a Function