Embedding (machine learning)

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In machine learning, embedding is a representation learning technique that maps complex, high-dimensional data into a lower-dimensional vector space of numerical vectors.

In machine learning, embedding is a representation learning technique that maps complex, high-dimensional data into a lower-dimensional vector space of numerical vectors.

Technique

It also denotes the resulting representation, where meaningful patterns or relationships are preserved. As a technique, it learns these vectors from data like words, images, or user interactions, differing from manually designed methods such as one-hot encoding. This process reduces complexity and captures key features without needing prior knowledge of the domain.

Similarity

In natural language processing, words or concepts may be represented as feature vectors, where similar concepts are mapped to nearby vectors. The resulting embeddings vary by type, including word embeddings for text (e.g., Word2Vec), image embeddings for visual data, and knowledge graph embeddings for knowledge graphs, each tailored to tasks like natural language processing, computer vision, or recommendation systems. This dual role enhances model efficiency and accuracy by automating feature extraction and revealing latent similarities across diverse applications. To measure the distance between two embeddings, a similarity measure can be used to find the overall similarity of the concepts represented by the embeddings. If the vectors are normalized to have a magnitude of 1, then the similarity measures are proportional to \cos\left(\theta_{ab}\right) . || \frac{\sum a_n b_n}{\sqrt{\left(\sum a_n^2\right)\left(\sum b_n^2\right)}} || Positive Correlation |- | Dot Product || Cosine similarity multiplied by the lengths of both vectors|| a \cdot b || \sum a_n b_n || Positive Correlation |} The cosine similarity disregards the magnitude of the vector when determining similarity, so it is less biased towards training data that appears very frequently. The dot product includes the magnitude inherently, so it will tend to value more popular data. Generally, for high-dimensional vector spaces, vectors tend to converge in distance, so Euclidean distance becomes less reliable for large embedding vectors.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1375060623 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001375060623 · captured 1789483172.0 · version history

Cite this page as: encyclopegia.org, “Embedding (machine learning)”, snapshot enwiki-001375060623. https://encyclopegia.org/a/embedding-machine-learning

Sources cited in this revision

4 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.