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

References

• Dorndorf , U. , Pesch , E. ( 1994 ). Fast clustering algorithms . Journal on Computing 6 ( 2 ): 141 – 153 .
   Google Scholar
• Dudoit , S. , Fridlyand , J. ( 2002 ). A prediction-based resampling method for estimating the number of clusters in a dataset . Genome Biology 3 ( 7 ): 1 – 21 .
   Google Scholar
• Fraley , C. , Raftery , A. E. ( 1998 ). How many clusters? Which clustering method? Answers via model-based cluster analysis . The Computer Journal 41 ( 8 ): 578 – 588 .
   Web of Science ®Google Scholar
• Glover , F. , Kochenberger , G. ( 2003 ). Handbook of Metaheuristics . Norwell , MA : Kluwer .
   Google Scholar
• Glover , F. , Kochenberger , G. , Alidaee , B. , Amini , M. ( 1999 ). Tabu search with critical event memory: An enhanced application for binary quadratic programs . In: Voss , S. M. S. , Osman , I. , Roucairol , C. , eds. Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization . Boston , MA : Kluwer , pp. 93 – 109 .
   Google Scholar
• Glover , F. , Kochenberger , G. A. , Alidaee , B. ( 1998 ). Adaptive memory Tabu search for binary quadratic programs . Management Science 44 ( 3 ): 336 .
   Web of Science ®Google Scholar
• Grotschel , M. , Wakabayashi , Y. ( 1989 ). A cutting plane algorithm for a clustering problem . Mathematical Programming 45 : 59 – 96 .
   Web of Science ®Google Scholar
• Hansen , P. , Jaumard , B. , Mathon , V. ( 1993 ). Constrained nonlinear 0–1 programming . Journal on Computing 5 ( 2 ): 97 .
   Google Scholar
• Hansen , P. B. ( 1979 ). Methods of nonlinear 0–1 programming . Annals of Discrete Math. 5 : 53 – 70 .
   Google Scholar
• Kaufman , L. , Rousseeuw , P. J. ( 1990 ). Groups in Data: An Introduction to Cluster Analysis . New York : Wiley .
   Google Scholar
• Kochenberger , G. , Glover , F. , Alidaee , B. , Rego , C. ( 2004 ). A unified modeling and solution framework for combinatorial optimization problems . Operations Research Spectrum 26 ( 2 ): 237 – 250 .
   Google Scholar
• Kochenberger , G. , Glover , F. , Alidaee , B. , Wang , H. ( 2005 ). Clustering of microarray data via clique partitioning . Journal of Combinatorial Optimization 10 : 77 – 92 .
   Google Scholar
• Magidson , J. , Vermunt , J. K. ( 2002 ). Latent class models for clustering: A comparison with k-means . Canadian Journal of Marketing Research 20 : 37 – 44 .
   Google Scholar
• Mehrotra , A. , Trick , M. ( 1998 ). Clique and clustering: A combinatorial approach . Operations Research Letters 22 : 1 – 12 .
   Google Scholar
• Mirkin , B. ( 1998 ). Combinatorial optimization in clustering . In: Du , D. Z. , Pardalos , P. M. , eds. Handbook of Combinatorial Optimization . Amsterdam, The Netherlands : Kluwer .
   Google Scholar
• Oosten , M. , Rutten , J. , Spieksma , F. ( 2001 ). The clique partitioning problem: Facets and patching facets . Networks 38 ( 3 ): 209 – 226 .
   Google Scholar
• Pena , J. M. , Lozano , J. A. , Larrsnaga , P. ( 1999 ). An empirical comparison of four initialization methods for the k-means algorithm . Pattern Recognition Letters 20 : 1027 – 1040 .
   Web of Science ®Google Scholar
• Raven , G. M. , Miller , R. G. ( 1979 ). An attempt to define the nature of chemical diabetes using multidimensional analysis . Diabetolgia 16 : 17 – 24 .
   PubMedGoogle Scholar
• Vermunt , J. K. , Magidson , J. ( 2002 ). Latent class cluster analysis . In: Hagenaars , J. A. , McCutcheon , A. L. , eds. Applied Latent Class Analysis . Cambridge : Cambridge University Press , pp. 89 – 106 .
   Google Scholar