Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
type: Item
instance of: scholarly article
title: Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
zbMATH Open document ID: 1139.62032
DOI: 10.1080/03610910701723559
author: Haibo Wang
author: Tom Obremski
author: Bahram Alidaee
author: Gary A. Kochenberger
publication date: 2008-03-18T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 5250451
zbMATH Keywords: latent class modeling
zbMATH Keywords: metaheuristics
zbMATH Keywords: silhouette coefficients
zbMATH Keywords: tabu search
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/03610910701723559
OpenAlex ID: W2006239936
cites work: How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
cites work: Handbook of metaheuristics
cites work: Adaptive memory tabu search for binary quadratic programs
cites work: A cutting plane algorithm for a clustering problem
cites work: Methods of Nonlinear 0-1 Programming
cites work: Finding Groups in Data
cites work: A unified modeling and solution framework for combinatorial optimization problems
cites work: Clustering of microarray data via clique partitioning
cites work: Cliques and clustering: A combinatorial approach
cites work: The clique partitioning problem: Facets and patching facets
published in: Communications in Statistics. Simulation and Computation
description: scientific article; zbMATH DE number 5250451