NETSCAL - A NETWORK SCALING ALGORITHM FOR NONSYMMETRIC PROXIMITY DATA

被引：26

作者：

HUTCHINSON, JW

机构：

来源：

PSYCHOMETRIKA | 1989年 / 54卷 / 01期

关键词：

D O I：

10.1007/BF02294447

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：25 / 51

页数：27

共 56 条

[11]

CURRY RE, 1975, BEHAV RES METH INSTR, V7, P369

[12] ON THE STRUCTURE OF ASSOCIATIVE MEANING [J].

DEESE, J .

PSYCHOLOGICAL REVIEW, 1962, 69 (03) :161-175

[13]

Deese J., 1965, STRUCTURE ASS LANGUA

[14] THE ESTIMATION OF ULTRAMETRIC AND PATH-LENGTH TREES FROM RECTANGULAR PROXIMITY DATA [J].

DESOETE, G ;

DESARBO, WS ;

FURNAS, GW ;

CARROLL, JD .

PSYCHOMETRIKA, 1984, 49 (03) :289-310

[15] NOTE ON A PAPER BY RUMELHART AND GREENO [J].

EDGELL, SE ;

GEISLER, WS ;

ZINNES, JL .

JOURNAL OF MATHEMATICAL PSYCHOLOGY, 1973, 10 (01) :86-90

[16]

FEIGENBAUM EA, 1963, COMPUT THOUGHT, P297

[17]

FISH RS, 1981, COLOR STUDIES ITS PE

[18] ALGORITHM-97 - SHORTEST PATH [J].

FLOYD, RW .

COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345

[19] REALIZING DISTANCE MATRIX OF A GRAPH [J].

GOLDMAN, AJ .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1966, B 70 (02) :153-+

[20]

Gondran M., 1984, GRAPHS ALGORITHMS

← 1 2 3 4 5 6 →