A Branch and Bound Clustering Algorithm

DOI10.1109/T-C.1975.224336zbMATH Open0308.68039OpenAlexW2073503732MaRDI QIDQ4066599FDOQ4066599

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)

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

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)