Set partition by globally optimized cluster seed points

DOI10.1016/0377-2217(91)90152-LMaRDI QIDQ809887zbMATH OpenFDO

Authors Géza Pesti, János Pinter

Publication date 1991

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

zbMATH Keywords

global optimizationlocationset partitiondata classificationcluster seed points

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 3903782
• Particle swarm optimization algorithm for the set partition problem
• scientific article; zbMATH DE number 3862255
• scientific article; zbMATH DE number 4110468
• Optimum cut-based clustering

Cites work

• scientific article; zbMATH DE number 3672307 (Why is no real title available?)
• scientific article; zbMATH DE number 3718485 (Why is no real title available?)
• scientific article; zbMATH DE number 3485507 (Why is no real title available?)
• scientific article; zbMATH DE number 3609472 (Why is no real title available?)
• scientific article; zbMATH DE number 3617544 (Why is no real title available?)
• scientific article; zbMATH DE number 3800808 (Why is no real title available?)
• A Sequential Method Seeking the Global Maximum of a Function
• Algorithmic complexity: threeNP- hard problems in computational statistics
• Bicriterion Cluster Analysis
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• Cluster Analysis and Mathematical Programming
• Cluster Analysis: An Application of Lagrangian Relaxation
• Constrained global optimization: algorithms and applications
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application
• Extended univariate algorithms for \(n\)-dimensional global optimization
• Finding Groups in Data
• Global optimization on convex sets
• Globally convergent methods for n-dimensional multiextremal optimization
• Hierarchical clustering schemes
• Integer Programming and the Theory of Grouping
• Maximum sum-of-splits clustering
• Minimum sum of diameters clustering
• Printer graphics for clustering
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach

Cited in

(10)

• Genetic clustering algorithms.
• Globally optimized calibration of environmental models
• scientific article; zbMATH DE number 3862255 (Why is no real title available?)
• Convergence qualification of adaptive partition algorithms in global optimization
• scientific article; zbMATH DE number 3903782 (Why is no real title available?)
• Stochastic modelling and optimization for environmental management
• Optimal set-partitioning based on group quality likelihood using partition-growing algorithm
• A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
• On the convergence of adaptive partition algorithms in global optimization
• Optimal separable partitioning in the plane

Describes a project that uses

Uses Software

• Silhouettes
• clusfind

This page was built for publication: Set partition by globally optimized cluster seed points

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