ISSN:
1432-1343
Keywords:
Multivariate data analysis
;
Ordinal network representation
;
NETSCAL
;
Proximities
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We present an algorithm for fitting general graphs to proximity data. The algorithm utilizes a mathematical programming procedure based on a penalty function approach to impose additivity constraints upon parameters. For a user-specified number of links, the algorithm seeks to provide the connected network that gives the least-squares approximation to the proximity data with the specified number of links, allowing for linear transformations of the data. The network distance is the minimum-path-length metric for connected graphs. As a limiting case, the algorithm provides a tree where each node corresponds to an object, if the number of links is set equal to the number of objects minus one. A Monte Carlo investigation indicates that the resulting networks tend to fall within one percentage point of the least-squares solution in terms of the variance accounted for, but do not always attain this global optimum. The network model is discussed in relation to ordinal network representations (Klauer 1989) and NETSCAL (Hutchinson 1989), and applied to several well-known data sets.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01908602
Permalink
