Jed Graef
Biographic Data
| ID | 5970916 |
|---|---|
| NAME | Jed Graef |
| GIVEN NAMES | Jed |
| FAMILY NAME | Graef |
| SIGNATURE | GRAEF J |
| VERIFIED | No |
| TOTAL WORKS | 3 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 3 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 1974 |
| LATEST PUBLICATION YEAR | 1979 |
| H-INDEX | 0 |
Using distance information in the design of large multidimensional scaling experiments
Using distance information in the design of large multidimensional scaling experiments
Good nonmetric multidimensional scaling algorithms have been available for more than a decade (Kruskal, 1964), and the large number of published applications attests to their popularity and usefulness. These procedures are capable of constructing a configuration of points in a metric space using no more than the ordinal properties of the data in a matrix of dissimilariti es—thus the characterization nonmetric. Despite the fact that a large body o…
The Determination of the Underlying Dimensionality of an Empirically Obtained Matrix of Proximities
A completely automatic procedure for determining the underlying dimensionality of an empirically obtained matrix of proximities is described. This technique is based on the results of an extensive Monte Carlo experiment and may be applied to matrices of order 12 to 36 inclusive. A computer program which will implement the procedure is available from the authors
No prominent works on this page.
The Determination of the Underlying Dimensionality of an Empirically Obtained Matrix of Proximities
A completely automatic procedure for determining the underlying dimensionality of an empirically obtained matrix of proximities is described. This technique is based on the results of an extensive Monte Carlo experiment and may be applied to matrices of order 12 to 36 inclusive. A computer program which will implement the procedure is available from the authors
Using distance information in the design of large multidimensional scaling experiments
Using distance information in the design of large multidimensional scaling experiments
Good nonmetric multidimensional scaling algorithms have been available for more than a decade (Kruskal, 1964), and the large number of published applications attests to their popularity and usefulness. These procedures are capable of constructing a configuration of points in a metric space using no more than the ordinal properties of the data in a matrix of dissimilariti es—thus the characterization nonmetric. Despite the fact that a large body o…
Computer Science (3 works) · Mathematics (3 works) · Artificial Intelligence (2 works) · Data mining (2 works) · Multidimensional scaling (2 works) · Psychology (2 works) · Scaling (2 works) · Statistics (2 works) · Advanced Statistical Methods and Models (1 work) · Advanced Statistical Process Monitoring (1 work)