Methods Based On Proximity Matrices
A method based on proximity matrices is one where the data is presented to the algorithm in the form of a similarity matrix or a distance matrix. These methods all fall under the broader class of metric multidimensional scaling. The variations tend to be differences in how the proximity data is computed; for example, Isomap, locally linear embeddings, maximum variance unfolding, and Sammon mapping (which is not in fact a mapping) are examples of metric multidimensional scaling methods.
Read more about this topic: Nonlinear Dimensionality Reduction
Famous quotes containing the words methods, based and/or proximity:
“The ancient bitter opposition to improved methods [of production] on the ancient theory that it more than temporarily deprives men of employment ... has no place in the gospel of American progress.”
—Herbert Hoover (1874–1964)
“The time must come, my friend ... when brutality and the lust for power must perish by its own sword.... For when that day comes, the world must begin to look for a new life, and it is our hope that they may find it here. For here we shall be, with their books, and their music, and a way of life based on one simple rule: Be kind.”
—Robert Riskin (1897–1955)
“The triumphs of peace have been in some proximity to war. Whilst the hand was still familiar with the sword-hilt, whilst the habits of the camp were still visible in the port and complexion of the gentleman, his intellectual power culminated; the compression and tension of these stern conditions is a training for the finest and softest arts, and can rarely be compensated in tranquil times, except by some analogous vigor drawn from occupations as hardy as war.”
—Ralph Waldo Emerson (1803–1882)