A Branch and Bound Clustering Algorithm

DOI10.1109/T-C.1975.224336MaRDI QIDQ4066599zbMATH OpenOpenAlexFDO

Authors Warren L. G. Koontz, Patrenahalli M. Narendra, Keinosuke Fukunaga

Publication date 1975

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/t-c.1975.224336

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Cited in

(39)

• Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
• An exact algorithm for the two-mode \(KL\)-means partitioning problem
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• J-MEANS: A new local search heuristic for minimum sum of squares clustering
• A scatter search approach for the minimum sum-of-squares clustering problem
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• An algorithm for minimizing clustering functions
• A genetic approach to the automatic clustering problem
• The hyperbolic smoothing clustering method
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• A BRANCH AND BOUND ALGORITHM FOR FINDING THE MODES IN KERNEL DENSITY ESTIMATES
• Cluster analysis and mathematical programming
• Combinatorial particle swarm optimization (CPSO) for partitional clustering problem
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
• Clustering in non-stationary environments using a clan-based evolutionary approach
• An incremental clustering algorithm based on hyperbolic smoothing
• A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• Taxicab correspondence analysis
• Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
• Clusteranalyse - Überblick und neuere Entwicklungen
• Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
• An Exact Algorithm for Blockmodeling of Two-Mode Network Data
• A recursive Lagrangian method for clustering problems
• Genetic clustering for automatic evolution of clusters and application to image classification
• Pattern classification problems and fuzzy sets
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• Dual‐tree fast exact max‐kernel search
• Design of hybrids for the minimum sum-of-squares clustering problem
• Genetic algorithm for text clustering based on latent semantic indexing
• A global optimization RLT-based approach for solving the hard clustering problem
• Column generation bounds for numerical microaggregation
• An exact algorithm for semi-supervised minimum sum-of-squares clustering
• An improved column generation algorithm for minimum sum-of-squares clustering
• A mixed-integer programming approach to the clustering problem with an application in customer segmentation
• A mathematical programming approach to clusterwise regression model and its extensions
• Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
• An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems

This page was built for publication: A Branch and Bound Clustering Algorithm

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