New optimization models for data mining

International Journal of Information Technology and Decision Making

Volumn 5, Issue 4, 2006, Pages 605-609

  Glover, Fred W ^a   Kochenberger, Gary ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

Clustering; Metaheuristics; MIP; Tabu search

Indexed keywords

EID: 33845509050     PISSN: 02196220     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219622006002143     Document Type: Article

References (8)

1. B. Mirkin, Combinatorial optimization in clustering, in Handbook of Combinatorial Optimization, eds. D. Z. Dn and P. M. Pardalos (Kluwer, 1998).
2. M. Grotschel and Y. Wakabayashi, A cutting plane algorithm for a clustering problem, Mathematical Programming 45 (1989) 59-96.
3. A. Mehrotra and M. Trick, Clique and clustering: A combinatorial approach, Operations Research Letters 22 (1998) 1-12.
4. U. Dorndorf and E. Pesch, Fast clustering algorithms, Journal on Computing 6(2) (1994) 141-153.
5. H. Wang, T. Obremski, G. Kochenberger and B. Alidaee, A new clique partitioning model: An alternative to K-means clustering, Working paper, University of Colorado, USA (2006).
6. M. Oosten, J. Rutten and F. Spieksma, The clique partitioning problem: Facets and patching facets, Networks 38(4) (2001) 209-226.
7. F. Glover, G. Kochenberger, B. Alidaee and M. Amini, Tabu search with critical event memory: An enhanced application for binary quadratic programs, in Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization, eds. S. M. S. Voss, 1. Osman and C. Roucairol (Kluwer, 1999), pp. 93-109.
8. F. Glover, G. Kochenberger, B. Alidaee and H. Wang, Clustering microarray data via clique partitioning, Journal of Combinatorial Optimization 10 (2005) 77-92.