Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem

DOI10.1007/s11336-009-9126-zzbMath1179.62086OpenAlexW2046021437MaRDI QIDQ1048651

Michael J. Brusco, Hans-Friedrich Köhn

Publication date: 7 January 2010

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11336-009-9126-z

zbMATH Keywords

heuristicsclusteringsimulated annealingtabu searchneighborhood searchequivalence relationclique partitioning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to social sciences (62P25) Applications of graph theory (05C90) Mathematical programming (90C99)

Related Items

Multi-attribute community detection in international trade network, A three-phased local search approach for the clique partitioning problem, Solving the clique partitioning problem as a maximally diverse grouping problem, An efficient heuristic for the \(k\)-partitioning problem, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem, New bounds and constraint propagation techniques for the clique partitioning problem, A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices, Lagrangian relaxation and pegging test for the clique partitioning problem, Redundant constraints in the standard formulation for the clique partitioning problem, The biclique partitioning polytope, The Branch and Cut Method for the Clique Partitioning Problem

Uses Software

• J-MEANS
• UCI-ml
• CPLEX
• AS 136
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Algorithm AS 136: A K-Means Clustering Algorithm
• Facets of the clique partitioning polytope
• Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
• Analyse qualitativer Daten: Einführung und Übersicht. I
• Analyse qualitativer Daten: Einführung und Übersicht. II
• Optimal partitioning of a data set based on the \(p\)-median model
• Design of hybrids for the minimum sum-of-squares clustering problem
• Metric and Euclidean properties of dissimilarity coefficients
• A cutting plane algorithm for a clustering problem
• The median procedure in cluster analysis and social choice theory
• Cliques and clustering: A combinatorial approach
• Variable neighborhood search
• Hierarchical clustering schemes
• A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
• Noising methods for a clique partitioning problem
• Variable neighborhood search for the linear ordering problem
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• Clustering of microarray data via clique partitioning
• The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
• Finding Groups in Data
• Tabu Search—Part I
• Tabu Search—Part II
• Variable neighborhood search for the p-median
• Fast Clustering Algorithms
• A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
• The clique partitioning problem: Facets and patching facets
• Note: A local-search heuristic for large set-covering problems
• Improving Personnel Scheduling at Airline Stations
• Approximating Symmetric Relations by Equivalence Relations
• Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
• J-MEANS: A new local search heuristic for minimum sum of squares clustering