Improving dynamic programming strategies for partitioning

Journal of Classification

Volumn 21, Issue 2, 2004, Pages 207-230

  Van Os, B J ^a   Meulman, J J ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Cluster analysis; Dynamic programming; Exact algorithm; Partitioning

Indexed keywords

EID: 21644448032     PISSN: 01764268     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00357-004-0017-9     Document Type: Article

References (32)

1. ALPERT, C. J., and KAHNG, A. B. (1995). "Multiway Partitioning via Geometry Embeddings, Orderings, and Dynamic Programming," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 14, 1342-1357.
2. ALPERT, C. J., and KAHNG, A. B. (1997). "Splitting an Ordering into a Partititon to Minimize Diameter," Journal of Classification, 14, 51-74.
3. ARABIE, P., HUBERT, L. J., and DE SOETE, G.(1996). Clustering and Classification, Singapore: World Scientific Publishing.
4. BAKER, F. B., and HUBERT, L. J. (1975). "Measuring the Power of Hierarchical Cluster Analysis," Journal of the American Statistical Association, 70, 31-38.
5. BRUSCO, M. J. (2001). "Seriation of Asymmetric Matrices Using Integer Linear Programming.," British Journal of Mathematical and Statistical Psychology, 54, 367-375.
6. BRUSCO, M. J. (2003). "An Enhanced Branch-and-bound Algorithm for a Partitioning Problem.," British Journal of Mathematical and Statistical Psychology, 56, 83-92.
7. DAY, W. H. E. (1996). "Complexity Theory: An Introduction for Practitioners of Classification," Clustering and classification, Eds., P. Arabie, L. J. Hubert, and G. De Soete, Singapore: World Scientific Publishing, 199-233.
8. DIEHR, G. (1985). "Evaluation of a Branch and Bound Algorithm for Clustering," SIAM Journal on Scientific and Statistical Computing, 6, 268-284.
9. DODGE, Y., and GAFNER, T. (1994). "Complexity Relaxation of Dynamic Programming for Cluster Analysis," New Approaches in Classification and Data Analysis, Eds., E. Diday, Y. Lechevallier, M. Schader, P. Bertrand, and B. Burtschy, Berlin: Springer, 220-227.
10. EUROMONITOR, (1979). European Marketing Data and Statistics, London: Euromonitor Publications, (also see http://lib.stat.cmu.edu/DASL/Datafiles/EuropeanJobs.html)
11. FISHER, W. D. (1958). "On Grouping for Maximum Heterogeneity," Journal of the American Statistical Association, 59, 789-798.
12. HAND, D. J., DALY, F., LUNN, A. D., MCCONWAY, K. J., and OSTROWSKI, E. (1994). A Handbook of Small Data Sets, London: Chapman & Hall.
13. HANSEN, P., and DELATTRE, M. (1978). "Complete-link Cluster Analysis by Graph Coloring," Journal of The American Statistical Association, 73, 397-403.
14. HANSEN, P., and JAUMARD, B. (1997). "Cluster Analysis and Mathematical Programming," Mathematical Programming, 79, 191-215.
15. HANSEN, P., JAUMARD, B., and MLADENOVIC, N. (1998). "Minimum Sum of Squares Clustering in a Low Dimensional Space," Journal of Classification, 15, 37-56.
16. HANSON, P., and MLADENOVIC, N. (2001). "J-means: A New Local Search Heuristic for Minimizing Sum of Squares Clustering.," Pattern Recognition, 34, 405-413.
17. HARTIGAN, J. A. (1975). Clustering Algorithms, New York: Wiley.
18. HUBERT, L. J., ARABIE, P., and MEULMAN, J. J. (2001). Combinatorial Data Analysis: Optimization by Dynamic Programming, Philadelphia: SIAM.
19. HUBERT, L. J., and LEVIN, J. R. (1976). "A General Statistical Framework for Assessing Categorical Clustering in Free Recall," Psychological Bulletin, 83, 1072-1080.
20. JENSEN, R. E. (1969). "A Dynamic Programming Algorithm for Cluster Analysis," Journal of the Operations Research Society of America, 7, 1034-1057.
21. KLEIN, G., and ARONSON, J. E. (1991). "Optimal Clustering: A Model and Method," Naval Research Logistics, 38, 447-461.
22. KOONTZ, W. L. G., NARENDRA, P. M., and FUKUNAGA, K. (1975). "A Branch and Bound Clustering Algorithm," IEEE Transactions on Computers, C-24, 908-915.
23. LIM, K., and LEE, Y.-H. (1997). "Optimal Partitioning of Heterogeneous Traffic Sources in Mobile Communications Networks," IEEE Transactions on Computers, 46, 312-325.
24. MILLIGAN, G. W. (1996). "Clustering Validation: Results and Implications for Applied Analyses," Clustering and classification, Eds., P. Arabie, L. J. Hubert, and G. De Soete, Singapore: World Scientific Publishing, 341-375.
25. MILLIGAN, G. W., and COOPER, M. C. (1985). "An Examination of Procedures for Determining the Number of Clusters in a Data Set.," Psychometrika, 50, 159-179.
26. NIJENHUIS, A., and WILF, H. S. (1975). Combinatorial Algorithms, New York: Academic Press.
27. OLSTAD, B., and MANNE, F. (1995). "Efficient Partitioning of Sequences," IEEE Transactions on Computers, 44, 1322-1326.
28. 1 norm," Journal of Classification, 18, 185-207.
29. SPÄTH, H. (1985). Cluster Dissection and Analysis (Theory, Fortran Programs, Examples), Chichestor: Ellis Horwood.
30. U.S. Department of Labor Employment and Training Administration, (1998). O*net 98 Data Dictionary, Raleigh, NC: Trefoil Corporation.
31. VAN OS, B. J., (2001). Dynamic Programming for Partitioning in Multivariate Data Analysis, Unpublished doctoral dissertation, Leiden University.
32. WEBER, A. (1973). Agrarpolitik im Spannungsfeld der Internationalen Ernaehrungspolitik, Kiel: Institut fuer Agrarpolitik und marktlehre.