Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis

DOI10.1080/03610910701723559MaRDI QIDQ5451111zbMATH OpenOpenAlexFDO

Authors Haibo Wang, Tom Obremski, Bahram Alidaee, Gary A. Kochenberger

Publication date 18 March 2008

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610910701723559

zbMATH Keywords

metaheuristicstabu searchlatent class modelingsilhouette coefficients

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Recommendations

• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• Cliques and clustering: A combinatorial approach
• Fast Clustering Algorithms
• scientific article; zbMATH DE number 4007495
• A cutting plane algorithm for a clustering problem

Cites work

• A cutting plane algorithm for a clustering problem
• A unified modeling and solution framework for combinatorial optimization problems
• Adaptive memory tabu search for binary quadratic programs
• Cliques and clustering: A combinatorial approach
• Clustering of microarray data via clique partitioning
• Finding Groups in Data
• Handbook of metaheuristics
• How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
• Methods of Nonlinear 0-1 Programming
• The clique partitioning problem: Facets and patching facets

Cited in

(6)

• Solving the clique partitioning problem as a maximally diverse grouping problem
• Gaussian model-based partitioning using iterated local search
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• Multi-attribute community detection in international trade network
• Food market segmentation based on consumer preferences using outranking multicriteria approaches
• scientific article; zbMATH DE number 5733671 (Why is no real title available?)

This page was built for publication: Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451111)