Transcription of An Introduction to Locally Linear Embedding
{{id}} {{{paragraph}}}
Research180 ParkAve, problemsininformationprocessinginvolve (LLE),anunsu-pervisedlearningalgorithmth atcomputeslowdimensional, , LLEmapsitsinputsintoa singleglobalcoordinatesystemoflowerdimen sionality, anditsoptimizations thoughcapableofgeneratinghighlynonlinear embeddings problemsinstatisticalpatternrecognitionb eginwiththepreprocessingofmultidimension alsignals, , thegoalofpreprocessingis someformofdimensionalityreduction:to com-pressthesignalsin sizeandto popularformsofdimensionalityreductionare themethodsofprincipalcom-ponentanalysis( PCA)[1]andmultidimensionalscaling(MDS)[2 ]. BothPCAandMDSareeigenvectormethodsdesign edto modellinearvariabilitiesin , (ormetric)MDS, thesedistancescorrespondtoEuclideandista nces, ,andtheiroptimizationsdonotinvolve , , weintroducedaneigenvectormethod calledlocallylinearembedding(LLE) fortheproblemofnonlineardimensionalityre duction[4].
The embeddings discovered by LLE are easiest to visualize for intrinsically two dimensional manifolds. In Fig. 1, for example, theinput to LLE consisted 546 7 data points sampled off the S-shapedmanifold. The resulting embedding shows how the algorithm, using 8 :9 neighbors per data point, successfully unraveled the underlying two dimensional ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}