Set partition by globally optimized cluster seed points

DOI10.1016/0377-2217(91)90152-LzbMATH Open0732.90050MaRDI QIDQ809887FDOQ809887

Authors: Géza Pesti, János Pinter 

Publication date: 1991

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

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

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)

Cites Work

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

Cited In (10)

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

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)