Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
DOI10.1080/03610910701723559zbMATH Open1139.62032OpenAlexW2006239936MaRDI QIDQ5451111FDOQ5451111
Tom Obremski, Bahram Alidaee, Gary A. Kochenberger, Haibo Wang
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)
Cites Work
- Finding Groups in Data
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
- A unified modeling and solution framework for combinatorial optimization problems
- Clustering of microarray data via clique partitioning
- A cutting plane algorithm for a clustering problem
- The clique partitioning problem: Facets and patching facets
- Handbook of metaheuristics
- Adaptive memory tabu search for binary quadratic programs
- Cliques and clustering: A combinatorial approach
- Methods of Nonlinear 0-1 Programming
Cited In (5)
- Title not available (Why is that?)
- Multi-attribute community detection in international trade network
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Food market segmentation based on consumer preferences using outranking multicriteria approaches
- Solving the clique partitioning problem as a maximally diverse grouping problem
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 👍 👎
- Title not available (Why is that?) 👍 👎
- A cutting plane algorithm for a clustering problem 👍 👎
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)
