Using distance information in the design of large multidimensional scaling experiments
Bibliographic Data
| ID | 10716004 |
|---|---|
| Authors | Jed Graef, Ian Spence (0000-0002-7382-8170) |
| Year | 1979 |
| Volume | 86 |
| Issue | 1 |
| Pages | 60-66 |
| Publication date | 1979-01-01 |
| Open Access | No |
| Type | ARTICLE |
| Venue | Psychological Bulletin (JOURNAL) |
| Journal identifiers | ISSN: 0033-2909 • E-ISSN: 1939-1455 |
| Publisher | American Psychological Association (APA) (PUBLISHER) |
| DOI | 10.1037//0033-2909.86.1.60 |
| OpenAlex | W2042975320 |
| Language | EN |
| Citations received | 3 |
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 of experience and knowledge has been accumulated regarding the behavior of nonmetric algorithms, there have been few systematic attempts to discover which characteristics of the input data are essential for successful construction of the configuration. It is important to know the answer to this question, since in many situations it may not be feasible, or desirable, to collect all possible pairwise judgments of dissimilarity from a subject. The most obvious
Algorithm · Data mining · Distance matrices in phylogeny · Distance matrix · Machine learning · Metric (unit) · Multidimensional scaling · Pairwise comparison · Popularity · Scaling · Similarity (geometry) · Space (punctuation) · Artificial Intelligence · Blind Source Separation Techniques · Computer Science · Face and Expression Recognition · Mathematics · Psychology · Spectroscopy and Chemometric Analyses · Theoretical Computer Science
| Citations per year | 0.1 |
|---|---|
| Citation span | 1996 - 2011 (16) |
| Highly cited | No |