Linear unidimensional scaling in the L2-norm: Basic optimization methods using MATLAB

Journal of Classification

Volumn 19, Issue 2, 2002, Pages 303-328

  Hubert, L J ^a   Arabie, P ^b   Meulman, J J ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Combinatorial Data Analysis; Dynamic Programming; Linear Unidimensional Scaling; MATLAB; Nonlinear Programming; Quadratic Assignment

Indexed keywords

EID: 0036978190     PISSN: 01764268     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00357-001-0047-5     Document Type: Article

References (17)

1. Bodewig, E. (1956). Matrix calculus. Amsterdam: North-Holland.
2. Defays, D. (1978). A short note on a method of seriation. British Journal of Mathematical and Statistical Psychology, 3, 49-53.
3. de Leeuw, J., & Heiser, W. (1977). Convergence of correction-matrix algorithms for multidimensional scaling. In J. C. Lingoes, E. E. Roskam, & I. Borg (Eds.), Geometric representations of relational data (pp. 735-752). Ann Arbor, MI: Mathesis Press.
4. Dykstra, R. L. (1983). An algorithm for restricted least squares regression. Journal of the American Statistical Association, 78, 837-842.
5. Francis, R. L., & White, J. A. (1974). Facility layout and location; An analytical approach. Englewood Cliffs, NJ: Prentice-Hall.
6. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. San Francisco: W. H. Freeman.
7. Guttman, L. (1968). A general nonmetric technique for finding the smallest coordinate space for a configuration of points. Psychometrika, 33, 469-506.
8. Hubert, L. J., & Arabie, P. (1986). Unidimensional scaling and combinatorial optimization. In J. de Leeuw, W. Heiser, J. Meulman, & F. Critchely (Eds.), Multidimensional data analysis (pp. 181-196). Leiden, The Netherlands: DSWO Press.
9. Hubert, L. J., Arabie, P., & Meulman, J. (2001). Combinatorial data analysis; Optimization by dynamic programming. Philadelphia: SIAM.
10. Hubert, L. J., & Schultz, J. W. (1976). Quadratic assignment as a general data analysis strategy. British Journal of Mathematical and Statistical Psychology, 29, 190-241.
11. Kaczmarz, S. (1937). Angenäherte Auflösung von Systemen linearer Gleichungen. Bulletin of the Polish Academy of Sciences, A35, 355-357.
12. Lawler, E. L. (1975). The quadratic assignment problem: A brief review. In R. Roy (Ed.), Combinatorial programming; Methods and applications (pp. 351-360). Dordrecht, The Netherlands: Reidel.
13. Lau, Kin-nam, Leung, Pui Lam, & Tse, Ka-kit (1998). A nonlinear programming approach to metric unidimensional scaling. Journal of Classification, 15, 3-14.
14. Pardalos, P. M., & Wolkowicz, H. (Eds.). (1994). Quadratic assignment and related problems. DIMACS Series on Discrete Mathematics and Theoretical Computer Science. Providence, RI: American Mathematical Society.
15. Pliner, V. (1996). Metric unidimensional scaling and global optimization. Journal of Classification, 13, 3-18.
16. Shepard, R. N. (1974). Representation of structure in similarity data: Problems and prospects. Psychometrika, 39, 373-421.
17. Shepard, R. N., Kilpatric, D. W., & Cunningham, J. P. (1975). The internal representation of numbers. Cognitive Psychology, 7, 82-138.