×

Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation. (English) Zbl 0479.62059


MSC:

62J15 Paired and multiple comparisons; multiple testing
62-07 Data analysis (statistics) (MSC2010)
90C90 Applications of mathematical programming
62P15 Applications of statistics to psychology
90C39 Dynamic programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Adelson, R. M., Norman, J. M., & Laporte, G. A dynamic programming formulation with diverse applications.Operational Research Quarterly, 1976,27, 119–121. · Zbl 0319.90070 · doi:10.1057/jors.1976.12
[2] Arabie, P. & Carroll, J. D. MAPCLUS: A mathematical programming approach to fitting the ADCLUS model.Psychometrika, 1980,45, 211–235. · Zbl 0437.62059 · doi:10.1007/BF02294077
[3] Baker, F. B. & Hubert, L. J. Applications of combinatorial programming to data analysis: Seriation using asymmetric proximity measures.British Journal of Mathematical and Statistical Psychology, 1977,30, 154–164.
[4] Blin, J. M. On tournament patterns and rational group decisions.Proceedings of IEEE 1973 Conference on Cybernetics and Society, 1973, 55–59.
[5] Defays, D. A short note on a method of seriation.British Journal of Mathematical and Statistical Psychology, 1978,31, 49–53.
[6] Dreyfus, S. E. An appraisal of some shortest-path algorithms.Operation Research, 1969,17, 395–412. · Zbl 0172.44202 · doi:10.1287/opre.17.3.395
[7] Elmaghraby, S. E. The sequencing of ”related” jobs.Naval Research Logistics Quarterly, 1968,15, 23–32. · Zbl 0159.49101
[8] Flueck, J. A. & Korsh, J. F. A branch search algorithm for maximum likelihood paired comparison ranking.Biometrika, 1974,61, 621–626. · Zbl 0295.62078 · doi:10.1093/biomet/61.3.621
[9] Greenberg, M. G. A method of successive cumulations for scaling of pair-comparison judgements.Psychometrika, 1965,30, 441–448. · doi:10.1007/BF02289533
[10] Hanan, M. & Kurtzberg, J. M. Placement techniques. In M. A. Breuer (Ed.),Design Automation of Digital Systems. Englewood Cliffs, New Jersey: Prentice-Hall, 1972. · Zbl 0241.90048
[11] Hartigan, J. A.Clustering Algorithms. New York: Wiley, 1975. · Zbl 0372.62040
[12] Holman, E. W. Completely nonmetric multidimensional scaling.Journal of Mathematical Psychology, 1978,18, 39–51. · Zbl 0404.92020 · doi:10.1016/0022-2496(78)90047-0
[13] Hubert, L. J. Some applications of graph theory and related nonmetric techniques to problems of approximate seriation: The case of symmetric proximity measures.British Journal of Mathematical and Statistical Psychology, 1974,27, 133–153. (a) · Zbl 0285.92029
[14] Hubert, L. J. Problems of seriation using a subject by item response matrix.Psychological Bulletin, 1974,81, 976–983. (b) · doi:10.1037/h0037348
[15] Hubert, L. J. Seriation using asymmetric proximity measures.British Journal of Mathematical and Statistical Psychology, 1976,29, 32–52. · Zbl 0334.92040
[16] Hubert, L. J. & Baker, F. B. Applications of combinatorial programming to data analysis: The traveling salesman and related problems.Psychometrika, 1978,43, 81–91. · doi:10.1007/BF02294091
[17] Johnson, S. C. Hierarchical clustering schemes.Psychometrika, 1967,32, 241–254. · Zbl 1367.62191 · doi:10.1007/BF02289588
[18] Karp, R. M. Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.),Complexity of Computer Computations, New York: Plenum Press, 1972, 85–104.
[19] Korte, B. & Oberhofer, W. Triangularizing input-output matrices and the structures of production.European Economic Review, 1971,2, 493–522. · doi:10.1016/0014-2921(71)90024-9
[20] Lawler, E. L. A comment on minimum feedback arc sets.IEEE Transactions on Circuit Theory, 1964,11, 296–297.
[21] Lenstra, J. K. & Rinnooy Kan, A. H. G. Some simple applications of the traveling salesman problem.Operational Research Quarterly, 1975,26, 717–733. · Zbl 0308.90044 · doi:10.1057/jors.1975.151
[22] Mirkin, B. G.Group choice. New York: Wiley, 1979. · Zbl 0406.92023
[23] Reinhold, E. M., Nievergelt, J. & Deo, N.Combinatorial algorithms: Theory and practice. Englewood Cliffs, N. J.: Prentice-Hall, 1977. · Zbl 0367.68032
[24] Roberts, F. S.Graph theory and its applications to problems of society. Philadelphia: Society for Industrial and Applied Mathemetics, 1978. · Zbl 0452.05001
[25] Shepard, R. N. The analysis of proximities: Multidimensional scaling with an unknown distance function I, II.Psychometrika, 1962,17, 125–140, 219–246, · Zbl 0129.12103 · doi:10.1007/BF02289630
[26] Shepard, R. N. A taxonomy of some principal types of data and of multidimensional methods for their analysis. In R. N. Shepardet al. (Eds.),Multidimensional scaling: Theory and applications in the behavioral sciences I. New York: Seminar Press, 1972.
[27] Szczotka, F. A. On a method of ordering and clustering of objects.Zastosowania Mathematyki, 1972,13, 23–33. · Zbl 0255.62053
[28] Thurstone, L. L. The method of paired comparisons for social values.Journal of Abnormal and Social Psychology, 1927,31, 384–400.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.