Abstract

A method for externally constraining certain distances in multidimensional scaling configurations is introduced and illustrated. The approach defines an objective function which is a linear composite of the loss function of the point configurationX relative to the proximity dataP and the loss ofX relative to a pseudo-data matrixR. The matrixR is set up such that the side constraints to be imposed onX's distances are expressed by the relations amongR's numerical elements. One then uses a double-phase procedure with relative penalties on the loss components to generate a constrained solutionX. Various possibilities for constructing actual MDS algorithms are conceivable: the major classes are defined by the specification of metric or nonmetric loss for data and/or constraints, and by the various possibilities for partitioning the matricesP andR. Further generalizations are introduced by substitutingR by a set ofR matrices,Ri,i=1, ...r, which opens the way for formulating overlapping constraints as, e.g., in patterns that are both row- and column-conditional at the same time.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call