Mathematical programming approach to clusterwise regression model and its extensions

European Journal of Operational Research

Volumn 116, Issue 3, 1999, Pages 640-652

  Lau, Kin Nam ^a   Leung, Pui Lam ^a   Tse, Ka Kit ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; MEMBERSHIP FUNCTIONS; NONLINEAR PROGRAMMING; PROBLEM SOLVING; REGRESSION ANALYSIS;

CLUSTERWISE REGRESSION; MULTIVARIATE STATISTICS;

OPERATIONS RESEARCH;

EID: 0032686966     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00052-6     Document Type: Article

References (41)

1. Aitkin, M., Wilson, G.T., 1980. Mixture models, outliers, and the EM algorithm. Technometrics 22, 325-331.
2. Aronson, J.E., Klein, G., 1989. A clustering algorithm for computer-assisted process organization. Decision Science 20, 730-745.
3. Arthanari, T.S., Dodge, Y., 1981. Mathematical Programming in Statistics. Wiley, New York.
4. Bertsimas, D., Tsitsikis, T., 1993. Simulated annealing. Statistical Science 8, 10-15.
5. Casetti, E., 1964a. Multiple discriminant functions. Technical Report No. 11 of ONR Task No. 389-135.
6. Casetti, E., 1964b. Classification and regional analysis by discriminant iterations. Technical Report No. 12 of ONR Task No. 389-135.
7. Casetti, E., Semple, R.K., 1968. A method for the stepwise separation of spatial trends. Michigan Inter-University Community of Mathematical Geographers Discussion Paper #11.
8. Celeux, G., Govaert, G., 1993. Comparison of the mixture and the classification maximum likelihood in cluster analysis. Journal of Statistical Computation and Simulation 47, 127-146.
9. Charnes, A., Cooper, W.W., Ferguson, R.O., 1955. Optimal estimation of executive compensation by linear programming. Management Science 1, 138.
10. Dempster, A.P., Laird, N.M., Rubin, D.B., 1977. Maximum likelihood from incomplete data via the E-M algorithm. Journal of the Royal Statistical Society B 39, 1-38.
11. DeSarbo, W.S., Oliver, R.L., Rangaswamy, A., 1989. A simulated annealing methodology for clusterwise linear regression. Psychometrika 54 (4), 707-736.
12. Freed, N., Glover, F., 1981a. Simple but powerful goal programming models for discriminant problems. European Journal of Operational Research 7, 44-46.
13. Freed, N., Glover, F., 1981b. A linear programming approach to the discriminant problem. Decision Sciences 12, 68-74.
14. Freed, N., Glover, F., 1986. Evaluating alternative linear programming models to solve the two-group discriminant problem. Decision Sciences 17, 151-162.
15. Glover, F., 1990. Improved linear programming models for discriminant analysis. Decision Sciences 21 (4), 771-785.
16. Hardle, W., Stoker, T.M., 1989. Investigating smooth multiple regression by the method of average derivatives. Journal of the American Statistical Association 84, 986-995.
17. Hand, D., 1981. Discrimination and Classification. Wiley, New York.
18. Hershey, A.V., 1971. Approximations of functions by set of poles. NWL Technical Report TR-2564.
19. Jensen, R., 1969. A dynamic programming algorithm for cluster analysis. Operations Research 17, 1034-1057.
20. King, L.J., 1970. Discriminant analysis: A review of recent theoretical contributions and applications. Economic Geography 46, 367-378.
21. Klein, G., Beck, P., Konsynski, B., 1988. Computer aided process structuring via mixed integer programming. Decision Sciences 19, 750-761.
22. Koehler, G.J., Erenguc, S.S., 1990. Minimizing misclassification in linear discriminant analysis. Decision Sciences 21, 63-85.
23. Koontz, W., Narendra, P., Fukunaga, K., 1974. A branch and bound clustering algorithm. IEEE Transactions on Computers, September, 908-915.
24. Lam, K.F., Choo, E.U., Moy, J.W., 1996. Minimizing deviations from the group mean: A linear programming approach for the two group classification problem. European Journal of Operational Research 88, 358-367.
25. McCormick, R.E., 1993. Managerial Economics. Prentice-Hall, Englewood Cliffs, NJ, p. 184 & 185.
26. Meier, J., 1987. A fast algorithm for clusterwise linear absolute deviations regression. OR Spektrum 9, 187-189.
27. Mulvey, J.M., Beck, M.P., 1984. Solving capacitated clustering problems. European Journal of Operational Research 18, 339-347.
28. Mulvey, J., Crowder, H., 1979. Cluster analysis: An application of Lagrangian relaxation. Management Science 25, 329-340.
29. Ragsdale, C.T., Stam, A., 1991. Mathematical programming formulations for the discriminant problem: An old dog does new tricks. Decision Sciences 22, 296-307.
30. Rao, M., 1971. Clustering analysis and mathematical programming. Journal of the American Statistical Association 66, 622-626.
31. Rubin, P., 1994. A comment regarding polynomial discriminant functions. European Journal of Operational Research 72, 29-31.
32. Schrage, L., 1991. LINDO. The Scientific Press, South San Francisco, CA, Ch. 14, p. 243 & 244.
33. Spath, H., 1979. Clusterwise linear regression. Computing 22 (4), 367-373.
34. Spath, H., 1981. Correction to algorithm 39: Clusterwise linear regression. Computing 26, 275.
35. Spath, H., 1982. Algorithm 48: A fast algorithm for clusterwise linear regression. Computing 29, 175-181.
36. Spath, H., 1985. Cluster Dissection and Analysis. Wiley, New York.
37. Spath, H., 1986. Clusterwise linear least absolute deviations regression. Computing 37, 371-378.
38. Stam, A., 1990. Extensions of mathematical programming based classification rules: A multicriteria approach. European Journal of Operational Research 48, 351-361.
39. Stanfel, L.E., 1981. A Lagrangian treatment of certain nonlinear clustering problems. European Journal of Operational Research 7 (2), 121-132.
40. Stanfel, L.E., 1986. A recursive Lagrangian method for clustering problems. European Journal of Operational Research 27, 332-342.
41. Wanarat, P., Pavur, R., 1996. Examining the effect of second order terms in mathematical programming approaches to the classification problem. European Journal of Operational Research 93, 582-601.