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:
“A woman might claim to retain some of the child’s faculties, although very limited and defused, simply because she has not been encouraged to learn methods of thought and develop a disciplined mind. As long as education remains largely induction ignorance will retain these advantages over learning and it is time that women impudently put them to work.”
—Germaine Greer (b. 1939)
“Your honesty is not to be based either on religion or policy. Both your religion and policy must be based on it. Your honesty must be based, as the sun is, in vacant heaven; poised, as the lights in the firmament, which have rule over the day and over the night.”
—John Ruskin (1819–1900)
“Our senses perceive no extreme. Too much sound deafens us; too much light dazzles us; too great distance or proximity hinders our view. Too great length and too great brevity of discourse tends to obscurity; too much truth is paralyzing.... In short, extremes are for us as though they were not, and we are not within their notice. They escape us, or we them.”
—Blaise Pascal (1623–1662)