Local Linear Embedding (LLE)
YouTube search... ...Google search
- AI Solver
- ...find outliers
- Anomaly Detection
- Dimensional Reduction
- Principal Component Analysis (PCA)
- T-Distributed Stochastic Neighbor Embedding (t-SNE)
- Isomap
- Kernel Trick
- Locally Linear Embedding | S.T. Roweis & L. K. Saul - NYU
- Nonlinear dimensionality reduction | Wikipedia
Embedding...
- projecting an input into another more convenient representation space. For example we can project (embed) faces into a space in which face matching can be more reliable.
- a mapping of a discrete — categorical — variable to a vector of continuous numbers. In the context of neural networks, embeddings are low-dimensional, learned continuous vector representations of discrete variables. Neural network embeddings are useful because they can reduce the dimensionality of categorical variables and meaningfully represent categories in the transformed space. Neural Network Embeddings Explained | Will Koehrsen - Towards Data Science
Neural network embeddings have 3 primary purposes:
- Finding nearest neighbors in the embedding space. These can be used to make recommendations based on user interests or cluster categories.
- As input to a machine learning model for a supervised task.
- For visualization of concepts and relations between categories.
begins by finding a set of the nearest neighbors of each point. It then computes a set of weights for each point that best describes the point as a linear combination of its neighbors. Finally, it uses an [1]-based optimization technique to find the low-dimensional embedding of points, such that each point is still described with the same linear combination of its neighbors. LLE tends to handle non-uniform sample densities poorly because there is no fixed unit to prevent the weights from drifting as various regions differ in sample densities. LLE has no internal model. LLE was presented at approximately the same time as Isomap. It has several advantages over Isomap, including faster optimization when implemented to take advantage of sparse matrix algorithms, and better results with many problems
