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:
“If you want to know the taste of a pear, you must change the pear by eating it yourself.... If you want to know the theory and methods of revolution, you must take part in revolution. All genuine knowledge originates in direct experience.”
—Mao Zedong (1893–1976)
“Tempered, gradual animation, the methodical restrain of sensations and energies, the equilibrium of sickness and health in each creature—this is nature’s essence, its immutable law, this is what it’s based on and what it adheres to.”
—Ivan Sergeevich Turgenev (1818–1883)
“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)