Results 1  10
of
27
Multidimensional Scaling
 Handbook of Statistics
, 2001
"... eflecting the importance or precision of dissimilarity # i j . 1. SOURCES OF DISTANCE DATA Dissimilarity information about a set of objects can arise in many different ways. We review some of the more important ones, organized by scientific discipline. 1.1. Geodesy. The most obvious application, ..."
Abstract

Cited by 38 (2 self)
 Add to MetaCart
eflecting the importance or precision of dissimilarity # i j . 1. SOURCES OF DISTANCE DATA Dissimilarity information about a set of objects can arise in many different ways. We review some of the more important ones, organized by scientific discipline. 1.1. Geodesy. The most obvious application, perhaps, is in sciences in which distance is measured directly, although generally with error. This happens, for instance, in triangulation in geodesy. We have measurements which are approximately equal to distances, either Euclidean or spherical, depending on the scale of the experiment. In other examples, measured distances are less directly related to physical distances. For example, we could measure airplane or road or train travel distances between different cities. Physical distance is usually not the only factor determining these types of dissimilarities. 1 2 J. DE LEEUW<
Optimizing Ranking Functions: A Connectionist Approach to Adaptive Information Retrieval
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, THE UNIVERSITY OF CALIFORNIA, SAN DIEGO
, 1994
"... This dissertation examines the use of adaptive methods to automatically improve the performance of ranked text retrieval systems. The goal of a ranked retrieval system is to manage a large collection of text documents and to order documents for a user based on the estimated relevance of the document ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
(Show Context)
This dissertation examines the use of adaptive methods to automatically improve the performance of ranked text retrieval systems. The goal of a ranked retrieval system is to manage a large collection of text documents and to order documents for a user based on the estimated relevance of the documents to the user's information need (or query). The ordering enables the user to quickly find documents of interest. Ranked retrieval is a difficult problem because of the ambiguity of natural language, the large size of the collections, and because of the varying needs of users and varying collection characteristics. We propose and empirically validate general adaptive methods which improve the ability of a large class of retrieval systems to rank documents effectively. Our main adaptive method is to numerically optimize free parameters in a retrieval system by minimizing a nonmetric criterion function. The criterion measures how well the system is ranking documents relative to a target ordering, defined by a set of training queries which include the users' desired document orderings. Thus, the system learns parameter settings which better enable it to rank relevant documents before irrelevant. The nonmetric approach is interesting because it is a general adaptive method, an alternative to supervised methods for training neural networks in domains in which rank order or prioritization is important. A second adaptive method is also examined, which is applicable to a restricted class of retrieval systems but which permits an analytic solution. The adaptive methods are applied to a number of problems in text retrieval to validate their utility and practical efficiency. The applications include: A dimensionality reduction of vectorbased document representations to a vector spa...
The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newton's Method
, 1995
"... This paper considers numerical algorithms for finding local minimizers of metric multidimensional scaling problems. Both the STRESS and SSTRESS criteria are considered, and the leading algorithms for each are carefully explicated. A new algorithm, based on Newton's method, is proposed. Translat ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
This paper considers numerical algorithms for finding local minimizers of metric multidimensional scaling problems. Both the STRESS and SSTRESS criteria are considered, and the leading algorithms for each are carefully explicated. A new algorithm, based on Newton's method, is proposed. Translational and rotational indeterminancy is removed by a parametrization that has not previously been used in multidimensional scaling algorithms. In contrast to previous algorithms, a very pleasant feature of the new algorithm is that it can be used with either the STRESS or the SSTRESS criterion. Numerical results are presented. Key words: Metric multidimensional scaling, STRESS criterion, SSTRESS criterion, unconstrained optimization, Newton's method. Department of Computational and Applied Mathematics, Rice University, Houston, TX 772511892. This author was generously supported by a Patricia R. Harris Fellowship. y Department of Computational and Applied Mathematics and Center for Research in...
Global Optimization in Least Squares Multidimensional Scaling by Distance
 Journal of Classification
, 1997
"... Least squares multidimensional scaling is known to have a serious problem of local minima, especially if one dimension is chosen, or if cityblock distances are involved. One particular strategy, the smoothing strategy proposed by Pliner (1986, 1996), turns out to be quite successful in these ca ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Least squares multidimensional scaling is known to have a serious problem of local minima, especially if one dimension is chosen, or if cityblock distances are involved. One particular strategy, the smoothing strategy proposed by Pliner (1986, 1996), turns out to be quite successful in these cases. Here, we propose a slightly different approach, called distance smoothing. We extend distance smoothing for any Minkowski distance and show that the SStress loss function is a special case. In addition, we extend the majorization approach to multidimensional scaling to have a onestep update for Minkowski parameters larger than 2 and use the results for distance smoothing. We present simple ideas for finding quadratic majorizing functions. The performance of distance smoothing is investigated in several examples, including two simulation studies.
On the existence of nonglobal minimizers of the STRESS criterion for metric multidimensional scaling
 In Proceedings of the Statistical Computing Section
, 1997
"... ..."
Fitting Distances by Least Squares
, 1993
"... this paper we review the problem of fitting Euclidean distances to data, using a least squares loss function. This problem must be distinguished from the problem of least squares fitting squared Euclidean distances to data, or the problem of least squares fitting scalar products to data. A compariso ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
this paper we review the problem of fitting Euclidean distances to data, using a least squares loss function. This problem must be distinguished from the problem of least squares fitting squared Euclidean distances to data, or the problem of least squares fitting scalar products to data. A comparison of these three different approaches to multidimensional scaling is given by De Leeuw and Heiser [9] and Meulman [23]. Recent developments in squared distance scaling are reviewed in a nice paper by Glunt e.a. [13]. We shall prove some existencetype results and some convergence type results. They are both derived by using a constructive proof method, the majorization method . The method was introduced in 1977 in MDS by De Leeuw [4]. A simplified treatment of the Euclidean case was published in 1978, with some extensions to individual differences scaling [7]. Individual differences scaling was subsequently recognized to be a special scaling problem with restrictions on the configuration, and a general approach to such restricted MDS problems was presented in [8]. Speed of convergence of the algorithm was studied in [6]. Other reviews, with some additional extensions, are [16] and [22]. Although [8] did use the majorization method to prove necessary conditions for an extremum, this has not really been followed up in the scaling and multivariate analysis literature. In this paper we start with the basic results for the metric case, and then introduce various generalizations. Most of what we discuss is a review of results that have been published elsewhere, but some of it is new. I think the paper illustrates the remarkable power of the majorization method. 1: THE LOSS FUNCTION
Majorization algorithms for inspecting circles, ellipses, squares, rectangles, and rhombi
, 2003
"... doi 10.1287/opre.1050.0253 ..."