A NOTE ON THE LOCALLY LINEAR EMBEDDING ALGORITHM
2009 ◽
Vol 23
(08)
◽
pp. 1739-1752
◽
Keyword(s):
The Cost
◽
The paper presents mathematical underpinnings of the locally linear embedding technique for data dimensionality reduction. It is shown that a cogent framework for describing the method is that of optimization on a Grassmann manifold. The solution delivered by the algorithm is characterized as a constrained minimizer for a problem in which the cost function and all the constraints are defined on such a manifold. The role of the internal gauge symmetry in solving the underlying optimization problem is illuminated.
2017 ◽
Vol 66
(2)
◽
pp. 467-477
◽
Keyword(s):
Keyword(s):
Keyword(s):
2009 ◽
Vol 20
(9)
◽
pp. 2376-2386
◽
2011 ◽
Vol 32
(7)
◽
pp. 1029-1035
◽