Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • Netscal: A Network Scaling Algorithm for Nonsymmetric Proximity Data

  • J. Wesley Hutchinson
  • Journal:
    Psychometrika / Volume 54 / Issue 1 / March 1989
    Published online by Cambridge University Press:
    01 January 2025, pp. 25-51

  • 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.