Cluster analysis and mathematical programming

DOI10.1007/BF02614317zbMath0887.90182OpenAlexW2010656511WikidataQ96289266 ScholiaQ96289266MaRDI QIDQ1365055

Brigitte Jaumard, Pierre Hansen

Publication date: 25 May 1998

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02614317

zbMATH Keywords

surveypartitioncluster analysishierarchy

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Integer programming (90C10) Dynamic programming (90C39)

Related Items (only showing first 100 items - show all)

Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems ⋮ Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections ⋮ Cluster graph modification problems ⋮ Clustering to minimize the sum of cluster diameters ⋮ An overview of graph covering and partitioning ⋮ The MIN PFS problem and piecewise linear model estimation ⋮ Investigation of a new GRASP-based clustering algorithm applied to biological data ⋮ A model for clustering data from heterogeneous dissimilarities ⋮ Solving the \(p\)-median problem with a semi-Lagrangian relaxation ⋮ An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors ⋮ Improved Conic Reformulations for $K$-means Clustering ⋮ A mixed integer linear model for clustering with variable selection ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach ⋮ Large neighborhood search applied to the software module clustering problem ⋮ Approximate functions in a problem of sets separation ⋮ Discrete dynamical system approaches for Boolean polynomial optimization ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ Sequential clustering with radius and split criteria ⋮ The hyperbolic smoothing clustering method ⋮ Computational study of large-scale \(p\)-median problems ⋮ Polynomial kernels for 3-leaf power graph modification problems ⋮ Integer programming models for the \(q\)-mode problem ⋮ Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions ⋮ Visual attractiveness in vehicle routing via bi-objective optimization ⋮ Some heuristic methods for solving \(p\)-median problems with a coverage constraint ⋮ Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering ⋮ Segmentation of scanning-transmission electron microscopy images using the ordered median problem ⋮ Capacitated clustering problems applied to the layout of IT-teams in software factories ⋮ Optimal hierarchical clustering on a graph ⋮ The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> ⋮ Distance geometry and data science ⋮ A Method for Clustering Surgical Cases to Allow Master Surgical Scheduling ⋮ On mathematical optimization for clustering categories in contingency tables ⋮ An optimising approach to alternative clustering schemes ⋮ Fixed set search applied to the clique partitioning problem ⋮ New and efficient DCA based algorithms for minimum sum-of-squares clustering ⋮ A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning ⋮ Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering ⋮ Dendrograms, minimum spanning trees and feature selection ⋮ Variable neighborhood search for harmonic means clustering ⋮ Dynamic clustering to minimize the sum of radii ⋮ Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters ⋮ Optimising sum-of-squares measures for clustering multisets defined over a metric space ⋮ Hierarchical clustering of continuous variables based on the empirical copula process and permutation linkages ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ Application of general semi-infinite programming to lapidary cutting problems ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Categorical data fuzzy clustering: an analysis of local search heuristics ⋮ Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems ⋮ Preprocessing for a map sectorization problem by means of mathematical programming ⋮ Complexity of the cluster deletion problem on subclasses of chordal graphs ⋮ Optimal partitioning of a data set based on the \(p\)-median model ⋮ An estimation algorithm using distance clustering of data. ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ Simulation and optimization approaches to scenario tree generation ⋮ Agglomerative hierarchical clustering of continuous variables based on mutual information ⋮ J-means and I-means for minimum sum-of-squares clustering on networks ⋮ Combinatorial optimisation and hierarchical classifications ⋮ Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction ⋮ An aggregation heuristic for large scale p-median problem ⋮ ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses ⋮ A heuristic method for large-scale multi-facility location problems ⋮ Sub-dominant theory in numerical taxonomy ⋮ Noising methods for a clique partitioning problem ⋮ Unnamed Item ⋮ Greedy random adaptive memory programming search for the capacitated clustering problem ⋮ A heuristic algorithm for solving the minimum sum-of-squares clustering problems ⋮ Spectral methods for graph clustering - a survey ⋮ Unnamed Item ⋮ A polynomial algorithm for balanced clustering via graph partitioning ⋮ Optimization problems for machine learning: a survey ⋮ A new method for solving capacitated location problems based on a set partitioning approach ⋮ Candidate groups search for K-harmonic means data clustering ⋮ Recent advances in cluster analysis ⋮ Identifying Multiple Cluster Structures in a Data Matrix ⋮ Cluster deletion on interval graphs and split related graphs ⋮ Affinity propagation and uncapacitated facility location problems ⋮ Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence ⋮ Unnamed Item ⋮ NP-hardness of Euclidean sum-of-squares clustering ⋮ DIVCLUS-T: a monothetic divisive hierarchical clustering method ⋮ A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering ⋮ Toward Optimal Community Detection: From Trees to General Weighted Networks ⋮ A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems ⋮ Hierarchical clustering based on the information bottleneck method using a control process ⋮ An Exact Algorithm for Blockmodeling of Two-Mode Network Data ⋮ An incremental clustering algorithm based on hyperbolic smoothing ⋮ Political districting to minimize cut edges ⋮ The capacitated centred clustering problem ⋮ Formulating logical implications in combinatorial optimisation ⋮ Fuzzy J-means: a new heuristic for fuzzy clustering ⋮ A clustering algorithm based on graph connectivity ⋮ Experiments with a Non-convex Variance-Based Clustering Criterion ⋮ A randomized algorithm for two-cluster partition of a set of vectors ⋮ Variable neighborhood search for minimum sum-of-squares clustering on networks ⋮ K-means clustering via a nonconvex optimization approach ⋮ A combinatorial approach to assess the separability of clusters ⋮ Vertex covering with capacitated trees

Uses Software

• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum sum of diameters clustering
• Maximum sum-of-splits clustering
• Enumeration of the partitions with minimum diameter
• Facets of the clique partitioning polytope
• Efficient algorithms for agglomerative hierarchical clustering methods
• A comparison of two dual-based procedures for solving the p-median problem
• NP-hard problems in hierarchical-tree clustering
• A recursive Lagrangian method for clustering problems
• On clustering problems with connected optima in Euclidean spaces
• Weak hierarchies associated with similarity measures - An additive clustering technique
• A cutting plane algorithm for a clustering problem
• Experiments in quadratic 0-1 programming
• Localizing combinatorial properties of partitions
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Minimizing the sum of diameters efficiently
• Some applications of graph theory to clustering
• Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
• Min-cut clustering
• Polynomial algorithms for nested univariate clustering
• A note on cluster analysis and dynamic programming
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Additive clustering and qualitative factor analysis methods for similarity matrices
• An improved algorithm for hierarchical clustering using strong components
• Extended formulations for the \(A\)-cut problem
• The basic algorithm for pseudo-Boolean programming revisited
• Nonserial dynamic programming
• Min and max hierarchical clustering using asymmetric similarity measures
• Espaliers: A generalization of dendrograms
• A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
• Mathematical classification and clustering
• Finding k points with minimum diameter and related problems
• A Linear Programming Approach to the Cutting-Stock Problem
• Geometric clusterings
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• A Survey of Recent Advances in Hierarchical Clustering Algorithms
• Routing with time windows by column generation
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• Smallest-last ordering and clustering and graph coloring algorithms
• Lower bounds to the graph partitioning problem through generalized linear programming and network flows
• A Dual-Based Procedure for Uncapacitated Facility Location
• Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
• Bicriterion Cluster Analysis
• Algorithmic complexity: threeNP- hard problems in computational statistics
• On the multiway cut polyhedron
• Finding Groups in Data
• A Branch and Bound Clustering Algorithm
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• Fast Clustering Algorithms
• A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
• Iterative projection strategies for the least‐squares fitting of tree structures to proximity data
• A Review of Hierarchical Classification
• Static and Dynamic Algorithms for k-Point Clustering Problems
• Integer Programming and the Theory of Grouping
• Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
• Evaluation of a Branch and Bound Algorithm for Clustering
• A Dynamic Programming Algorithm for Cluster Analysis
• Cluster Analysis and Mathematical Programming
• Problem Decomposition and Data Reorganization by a Clustering Technique

This page was built for publication: Cluster analysis and mathematical programming