메뉴 건너뛰기




Volumn 54, Issue 2, 2001, Pages 367-375

Seriation of asymmetric matrices using integer linear programming

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; HUMAN; MATHEMATICAL COMPUTING; PSYCHOMETRY; RESEARCH; SYSTEM ANALYSIS;

EID: 0035512539     PISSN: 00071102     EISSN: None     Source Type: Journal    
DOI: 10.1348/000711001159500     Document Type: Article
Times cited : (12)

References (28)
  • 1
    • 0017607761 scopus 로고
    • Applications of combinatorial programming to data analysis: Seriation using asymmetric proximity measures
    • Baker, F. B., & Hubert, L. J. (1977). Applications of combinatorial programming to data analysis: Seriation using asymmetric proximity measures. British Journal of Mathematical and Statistical Psychology, 30, 154-164.
    • (1977) British Journal of Mathematical and Statistical Psychology , vol.30 , pp. 154-164
    • Baker, F.B.1    Hubert, L.J.2
  • 2
    • 0001405313 scopus 로고
    • A note on majority rule under transitivity constraints
    • Blin, M. J., & Whinston, A. B. (1974). A note on majority rule under transitivity constraints. Management Science, 20, 1439-1440.
    • (1974) Management Science , vol.20 , pp. 1439-1440
    • Blin, M.J.1    Whinston, A.B.2
  • 3
    • 0001290168 scopus 로고
    • Majority rule under transitivity constraints
    • Bowman, V. J., & Colantoni, C. S. (1973). Majority rule under transitivity constraints. Management Science, 19, 1029-1041.
    • (1973) Management Science , vol.19 , pp. 1029-1041
    • Bowman, V.J.1    Colantoni, C.S.2
  • 4
    • 0001405313 scopus 로고
    • Further comments on majority rule under transitivity constraints
    • Bowman, V. J., & Colantoni, C. S. (1974). Further comments on majority rule under transitivity constraints. Management Science, 20, 1441.
    • (1974) Management Science , vol.20 , pp. 1441
    • Bowman, V.J.1    Colantoni, C.S.2
  • 5
    • 0035532064 scopus 로고    scopus 로고
    • An interactive approach to multiobjective combinatorial data analysis
    • Brusco, M. J., & Stahl, S. (2001a). An interactive approach to multiobjective combinatorial data analysis. Psychometrika, 66, 5-24.
    • (2001) Psychometrika , vol.66 , pp. 5-24
    • Brusco, M.J.1    Stahl, S.2
  • 6
    • 0035621822 scopus 로고    scopus 로고
    • Compact integer-programming models for extracting subsets of stimuli from confusion matrices
    • in press
    • Brusco, M. J., & Stahl, S. (2001b). Compact integer-programming models for extracting subsets of stimuli from confusion matrices. Psychometrika, in press.
    • (2001) Psychometrika
    • Brusco, M.J.1    Stahl, S.2
  • 7
    • 0000500960 scopus 로고
    • Maximum likelihood paired comparison ranking by linear programming
    • DeCani, J. S. (1969). Maximum likelihood paired comparison ranking by linear programming. Biometrika, 56, 537-545.
    • (1969) Biometrika , vol.56 , pp. 537-545
    • DeCani, J.S.1
  • 8
    • 0001121517 scopus 로고
    • A branch and bound algorithm for maximum likelihood paired comparison ranking by linear programming
    • DeCani, J. S. (1972). A branch and bound algorithm for maximum likelihood paired comparison ranking by linear programming. Biometrika, 59, 131-135.
    • (1972) Biometrika , vol.59 , pp. 131-135
    • DeCani, J.S.1
  • 9
    • 0001663433 scopus 로고
    • The comparative performance of simulated annealing on two problems of combinatorial data analysis
    • E. Diday (Ed.), Amsterdam: North-Holland
    • De Soete, G., Hubert, L., & Arabie, P. (1988). The comparative performance of simulated annealing on two problems of combinatorial data analysis. In E. Diday (Ed.), Data Analysis and Informatics, Vol. 5 (pp. 489-496). Amsterdam: North-Holland.
    • (1988) Data Analysis and Informatics , vol.5 , pp. 489-496
    • De Soete, G.1    Hubert, L.2    Arabie, P.3
  • 10
    • 0016335740 scopus 로고
    • A branch search algorithm for maximum likelihood paired comparison ranking
    • Flueck, J. A., & Korsh, J. F. (1974). A branch search algorithm for maximum likelihood paired comparison ranking. Biometrika, 61, 621-626.
    • (1974) Biometrika , vol.61 , pp. 621-626
    • Flueck, J.A.1    Korsh, J.F.2
  • 11
    • 0030490277 scopus 로고    scopus 로고
    • The tunneling method for global optimization in multi-dimensional scaling
    • Groenen, P. J. F., & Heiser, W. J. (1996). The tunneling method for global optimization in multi-dimensional scaling. Psychometrika, 61, 529-550.
    • (1996) Psychometrika , vol.61 , pp. 529-550
    • Groenen, P.J.F.1    Heiser, W.J.2
  • 12
    • 85004778131 scopus 로고
    • Selecting a stimulus set with prescribed structure from empirical confusion frequencies
    • Heiser, W. J. (1988) Selecting a stimulus set with prescribed structure from empirical confusion frequencies. British Journal of Mathematical and Statistical Psychology, 41, 37-51.
    • (1988) British Journal of Mathematical and Statistical Psychology , vol.41 , pp. 37-51
    • Heiser, W.J.1
  • 15
    • 85004878684 scopus 로고
    • The analysis of proximity matrices through sums of matrices having (anti-)Robinson forms
    • Hubert, L., & Arabie, P. (1994). The analysis of proximity matrices through sums of matrices having (anti-)Robinson forms. British Journal of Mathematical and Statistical Psychology, 47, 1-40.
    • (1994) British Journal of Mathematical and Statistical Psychology , vol.47 , pp. 1-40
    • Hubert, L.1    Arabie, P.2
  • 17
    • 0001717306 scopus 로고
    • Matrix reorganization and dynamic programming: Applications to paired comparisons and unidimensional seriation
    • Hubert, L. J., & Golledge, R. G. (1981). Matrix reorganization and dynamic programming: Applications to paired comparisons and unidimensional seriation. Psychometrika, 46, 429-441.
    • (1981) Psychometrika , vol.46 , pp. 429-441
    • Hubert, L.J.1    Golledge, R.G.2
  • 18
    • 0004123519 scopus 로고    scopus 로고
    • Mountain View, CA: ILOG, Inc
    • ILOG CPLEX 6.5 (1999). User's manual. Mountain View, CA: ILOG, Inc.
    • (1999) User's Manual
  • 20
  • 21
    • 85004766122 scopus 로고
    • On an algorithm of Smith and Payne for determining Slater's i and all nearest adjoining orders
    • Phillips, J. P. N. (1976). On an algorithm of Smith and Payne for determining Slater's i and all nearest adjoining orders. British Journal of Mathematical and Statistical Psychology, 29, 126-127.
    • (1976) British Journal of Mathematical and Statistical Psychology , vol.29 , pp. 126-127
    • Phillips, J.P.N.1
  • 22
    • 85004775322 scopus 로고
    • An algorithm for maximum likelihood ranking and Slater's i from paired comparisons
    • Ranyard, R. H. (1976). An algorithm for maximum likelihood ranking and Slater's i from paired comparisons. British Journal of Mathematical and Statistical Psychology, 29, 242-248.
    • (1976) British Journal of Mathematical and Statistical Psychology , vol.29 , pp. 242-248
    • Ranyard, R.H.1
  • 23
    • 84976943871 scopus 로고
    • Seriation and multidimensional scaling: A data analysis approach to scaling asymmetric proximity matrices
    • Rodgers, J. L. & Thompson, T. D. (1992). Seriation and multidimensional scaling: A data analysis approach to scaling asymmetric proximity matrices. Applied Psychological Measurement, 16, 105-117.
    • (1992) Applied Psychological Measurement , vol.16 , pp. 105-117
    • Rodgers, J.L.1    Thompson, T.D.2
  • 24
    • 0001955647 scopus 로고
    • A measure of stimulus similarity and errors in some paired-associate learning tasks
    • Rothkopf, E. Z. (1957). A measure of stimulus similarity and errors in some paired-associate learning tasks. Journal of Experimental Psychology, 53, 94-101.
    • (1957) Journal of Experimental Psychology , vol.53 , pp. 94-101
    • Rothkopf, E.Z.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.