Hostname: page-component-89b8bd64d-mmrw7 Total loading time: 0 Render date: 2026-05-06T13:24:26.586Z Has data issue: false hasContentIssue false

Netscal: A Network Scaling Algorithm for Nonsymmetric Proximity Data

Published online by Cambridge University Press:  01 January 2025

J. Wesley Hutchinson*
Affiliation:
University of Florida
*
Requests for reprints should be sent to Wes Hutchinson, Department of Marketing, 205 Matherly Hall, University of Florida, Gainesville, FL 32611.

Abstract

A simple property of networks is used as the basis for a scaling algorithm that represents nonsymmetric proximities as network distances. The algorithm determines which vertices are directly connected by an arc and estimates the length of each arc. Network distance, defined as the minimum pathlength between vertices, is assumed to be a generalized power function of the data. The derived network structure, however, is invariant across monotonic transformations of the data. A Monte Carlo simulation and applications to eight sets of proximity data support the practical utility of the algorithm.

Information

Type
Original Paper
Copyright
Copyright © 1989 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable