A Branch and Bound Clustering Algorithm

DOI10.1109/T-C.1975.224336zbMath0308.68039OpenAlexW2073503732MaRDI QIDQ4066599

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

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)

Related Items

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