Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem

Journal of Global Optimization

Volumn 45, Issue 1, 2009, Pages 111-129

  McAllister, Scott R ^a   Dimaggio Jr , Peter A ^a   Floudas, Christodoulos A ^a  

^a Princeton University   (United States)

Author keywords

Clustering; Mixed integer linear programming; Sparse data sets

Indexed keywords

CLUSTERING; CLUSTERING PROBLEMS; COMPARATIVE STUDIES; COMPUTATIONAL STUDIES; CUTTING PLANES; DATA MATRICES; GLASS TRANSITION TEMPERATURE; MATHEMATICAL MODELING; MIXED-INTEGER LINEAR PROGRAMMING; OBJECTIVE FUNCTIONS; OPTIMIZATION METHOD; PAIRWISE INTERACTION; SPARSE DATA; SPARSE DATA SETS; THREE MODELS;

COMPUTATIONAL EFFICIENCY; DYNAMIC PROGRAMMING; GLASS TRANSITION; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; MODELS; OPTIMIZATION; SET THEORY; UNMANNED AERIAL VEHICLES (UAV);

MATRIX ALGEBRA;

EID: 68549123671     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-008-9393-8     Document Type: Article

References (52)

1. Anderberg M.R.: Cluster Analysis for Applications. Academic Press, New York (1973)
2. Jain A.K., Flynn P.J.: Image segmentation using clustering. In: Ahuja, N., Bowyer, K. (eds) Advances in Image Understanding: A Festschrift for Azriel Rosenfeld, pp. 65-83. IEEE Press, Piscataway (1996)
3. G. Salton 1991 Developments in automatic text retrieval Science 253 974 980
4. M.B. Eisen P.T. Spellman P.O. Brown D. Botstein 1998 Cluster analysis and display of genome-wide expression patterns Proc. Natl Acad. Sci. 95 14863 14868
5. Y. Zhang J. Skolnick 2004 SPICKER: A clustering approach to identify near-native protein folds J. Comput. Chem. 25 865 871
6. M. Mönnigmann C.A. Floudas 2005 Protein loop structure prediction with flexible stem geometries Protein Struct. Funct. Bioinform. 61 748 762
7. J.A. Hartigan M.A. Wong 1979 Algorithm AS 136: a K-means clustering algorithm Appl. Stat. 28 100 108
8. A.W.F. Edwards L.L. Cavalli-Sforza 1965 A method for cluster analysis Biometrics 21 362 375
9. J.H. Wolfe 1970 Pattern clustering by multivariate mixture analysis Multivariate Behav. Res. 5 329 350
10. A.K. Jain J. Mao 1996 Artificial neural networks: a tutorial IEEE Comput. 29 31 44
11. R.W. Klein R.C. Dubes 1989 Experiments in projection and clustering by simulated annealing Pattern Recognit. 22 213 220
12. Raghavan, V.V., Birchand, K.: A clustering strategy based on a formalism of the reproductive process in a natural system. In: Proceedings of the Second International Conference on Information Storage and Retrieval, pp. 10-22. Dallas, Texas (1979)
13. Bhuyan, J.N., Raghavan, V.V., Venkatesh, K.E.: Genetic algorithm for clustering with an ordered representation. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 408-415. San Mateo, California (1991)
14. M.P. Tan J.R. Broach C.A. Floudas 2007 A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning J. Glob. Optim. 39 3 323 346
15. M.P. Tan J.R. Broach C.A. Floudas 2007 Evaluation of normalization and pre-clustering issues in a novel clustering approach: global optimum search with enhanced positioning J. Bioin. Comp. Bio. 5 4 895 913
16. M.P. Tan E. Smith J.R. Broach C.A. Floudas 2008 Microarray data mining: a novel optimization-based approach to uncover biologically coherent structures BMC Bioinform. 9 268 283
17. A.K. Jain M.N. Murty P.J. Flynn 1999 Data clustering: a review ACM Comput. Surv. 31 264 323
18. W.T. McCormick P.J. Schweitzer T.W. White 1972 Problem decomposition and data reorganization by a clustering technique Oper. Res. 20 993 1009
19. J.K. Lenstra 1974 Clustering a data array and the traveling salesman problem Oper. Res. 22 413 414
20. J.K. Lenstra A.H.G. Rinnooy Kan 1975 Some simple applications of the traveling salesman problem Oper. Res. Q. 26 717 733
21. C.J. Alpert A.B. Kahng 1997 Splitting an ordering into a partition to minimize diameter J. Classif. 14 51 74
22. S. Climer W. Zhang 2006 Rearrangement clustering: pitfalls, remedies, and applications J. Mach. Learn. 7 919 943
23. DiMaggio, P.A., McAllister, S.R., Floudas, C.A., Feng, X.J., Rabinowitz, J.D., Rabitz, H.A.: A network flow model for biclustering via optimal re-ordering of data matrices. J. Glob. Optim. (2009, in press)
24. P.A. DiMaggio S.R. McAllister C.A. Floudas X.J. Feng J.D. Rabinowitz H.A. Rabitz 2008 Biclustering via optimal re-ordering of data matrices in systems biology: rigourous methods and comparative studies BMC Bioinform. 9 458
25. O. Troyanskaya M. Cantor G. Sherlock P. Brown T. Hastie R. Tibshirani D. Botstein R.B. Altman 2001 Missing value estimation methods for DNA microarrays Bioinformatics 17 520 525
26. T.C. Koopmans M.J. Beckmann 1957 Assignment problems and the location of economic activities Econometrica 25 53 76
27. Pardalos, P.M., Rendl, F., Wolkowicz, H.: The quadratic assignment problem: a survey. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems, vol. 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 1-42. AMS, Rhode Island (1994)
28. K. Anstreicher N. Brixius J.P. Goux J. Linderoth 2002 Solving large quadratic assignment problems on computational grids Math. Progr. 91 3 563 588
29. E.M. Loiola N.M.M. de Abreu P.O. Boaventura-Netto P. Hahn T. Querido 2007 A survey for the quadratic assignment problem Eur. J. Oper. Res. 176 657 690
30. W.P. Adams M. Guignard P.M. Hahn W.L. Hightower 2007 A level-2 reformulation-linearization technique bound for the quadratic assignment problem Eur. J. Oper. Res. 180 983 996
31. S.P. Singh R.R.K. Sharma 2006 A review of different approaches to the facility layout problems Int. J. Adv. Manuf. Technol. 30 425 433
32. C.H. Reynolds 1999 Designing diversed and focused combinatorial libraries of synthetic polymers J. Comb. Chem. 1 4 297 306
33. C.A. Floudas I.E. Grossmann 1987 Synthesis of flexible heat exchanger networks with uncertain flowrates and temperatures Comp. Chem. Eng. 11 4 319 336
34. A.R. Ciric C.A. Floudas 1989 A retrofit approach for heat-exchanger networks Comp. Chem. Eng. 13 6 703 715
35. C.A. Floudas S.H. Anastasiadis 1988 Synthesis of distillation sequences with several multicomponent feed and product streams Chem. Eng. Sci. 43 9 2407 2419
36. A.C. Kokossis C.A. Floudas 1994 Optimization of complex reactor networks-II: nonisothermal operation Chem. Eng. Sci. 49 7 1037 1051
37. A. Aggarwal C.A. Floudas 1990 Synthesis of general separation sequences-nonsharp separations Comp. Chem. Eng. 14 6 631 653
38. CPLEX: ILOG CPLEX 9.1 User's Manual (2005)
39. S.R. McAllister X.-J. Feng P.A. DiMaggio Jr. C.A. Floudas J.D. Rabinowitz H. Rabitz 2008 Descriptor-free molecular discovery in large libraries by adaptive substituent reordering Med. Chem. Lett. 18 5967 5970
40. DiMaggio, P.A., McAllister, S.R., Floudas, C.A., Feng, X.J., Rabinowitz, J.D., Rabitz, H.A.: Enhancing molecular discovery using descriptor-free rearrangement clustering techniques for sparse data sets (submitted for publication)
41. N. Shenvi J.M. Geremia H. Rabitz 2003 Substituent ordering and interpolation in molecular library optimization J. Phys. Chem. 107 2066 2074
42. R.E. Burkard S.E. Karisch F. Rendl 1997 QAPLIB-a quadratic assignment problem libary J. Glob. Optim. 10 4 391 403
43. P.C. Gilmore 1962 Optimal and suboptimal algorithms for the quadratic assignment problem SIAM J. Appl. Math. 10 305 313
44. I.P. Androulakis C.D. Maranas C.A. Floudas 1997 Prediction of oligopeptide conformations via deterministic global optimization J. Glob. Optim. 11 1 34
45. J.L. Klepeis C.A. Floudas 1999 Free energy calculations for peptides via deterministic global optimization J. Chem. Phys. 110 7491 7512
46. J.L. Klepeis C.A. Floudas D. Morikis J.D. Lambris 1999 Predicting peptide structures using NMR data and deterministic global optimization J. Comp. Chem. 20 13 1354 1370
47. J.L. Klepeis C.A. Floudas 2003 Ab initio tertiary structure prediction of proteins J. Glob. Optim. 25 113 140
48. J.L. Klepeis C.A. Floudas 2003 ASTRO-FOLD: a combinatorial and global optimization framework for ab initio prediction of three-dimensional structures of proteins from the amino acid sequence Biophys. J. 85 2119 2146
49. J.L. Klepeis C.A. Floudas D. Morikis C.G. Tsokos E. Argyropoulos L. Spruce J.D. Lambris 2003 Integrated computational and experimenal approach for lead optimization and design of compstatin variants with improved activity J. Am. Chem. Soc. 125 28 8422 8423
50. H.K. Fung C.A. Floudas M.S. Taylor L. Zhang D. Morikis 2008 Towards full sequence de novo protein design with flexible templates for human beta-defensin-2 Biophys. J. 94 584 599
51. X. Lin C.A. Floudas 2001 Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation Comp. Chem. Eng. 25 665 674
52. S.L. Janak X. Lin C.A. Floudas 2004 Enhanced continuous-time unit-specific event based formulation for short-term scheduling of multipurpose batch processes: Resource constraints and mixed storage policies Ind. Eng. Chem. Res. 43 2516 2533