Cluster analysis and mathematical programming
Hansen, Pierre
Jaumard, Brigitte

Date: 1997
Abstract: Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated. As many types of clustering and criteria for homogeneity or separation are of interest, this is a vast field. A survey is given from a mathematical programming viewpoint. Steps of a clustering study, types of clustering and criteria are discussed. Then algorithms for hierarchical, partitioning, sequential, and additive clustering are studied. Emphasis is on solution methods, i. e. , dynamic programming, graph theoretical algorithms, branch-and-bound, cutting planes, column generation and heuristics. .
Rights: Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.
Language: Anglès
Document: Article ; recerca ; Versió publicada
Subject: Cluster analysis ; Hierarchy ; Partition
Published in: Mathematical Programming, vol. 79 n. 1-3 (1997) p. 191-215, ISSN 0025-5610



25 p, 1.4 MB
 UAB restricted access

The record appears in these collections:
Articles > Research articles
Articles > Published articles

 Record created 2006-03-13, last modified 2024-12-07



   Favorit i Compartir