embedding - определение. Что такое embedding
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое embedding - определение

INJECTIVE AND STRUCTURE-PRESERVING MAP
Embedding (topology); Topological embedding; Isometric embedding; Isometric immersion; Abstract embedding; Isometric imbedding; Embedding (field theory); Metric embedding; Local embedding; Embedding (mathematics); Locally injective function
Найдено результатов: 139
Embedding         
·p.pr. & ·vb.n. of Embed.
embedding         
1. <mathematics> One instance of some mathematical object contained with in another instance, e.g. a group which is a subgroup. 2. <theory> (domain theory) A complete partial order F in [X -> Y] is an embedding if (1) For all x1, x2 in X, x1 <= x2 <=> F x1 <= F x2 and (2) For all y in Y, x | F x <= y is directed. ("<=" is written in LaTeX as sqsubseteq). (1995-03-27)
Spatial embedding         
  • none
  • Example of a city network: the [[Rennes Metro]] (French: Métro de Rennes). In this example metro stops are vertices and tracks between them are edges.
  • none
  • none
  • Example of regular [[hexagonal tiling]] used to divide [[San Francisco]] Bay area using [[Uber]]'s H3 library.
  • Map of [[San Francisco]] administrative districts.
Draft:Spatial Embedding; Spatial Embedding
Spatial embedding is one of feature learning techniques used in spatial analysis where points, lines, polygons or other spatial data types. representing geographic locations are mapped to vectors of real numbers.
Linkless embedding         
  • An [[apex graph]]. If the planar part of the graph is embedded on a flat plane in space, and the apex vertex is placed above the plane and connected to it by straight line segments, the resulting embedding is flat.
  • A linkless apex graph that is not YΔY reducible.
  • Two linked curves forming a [[Hopf link]].
  • The [[Petersen family]].
EMBEDDING A GRAPH IN 3D SPACE WITH NO CYCLES INTERLINKED
Linklessly embeddable graph; Linkless Embedding; Knotless embedding; Intrinsically linked graph
In topological graph theory, a mathematical discipline, a linkless embedding of an undirected graph is an embedding of the graph into three-dimensional Euclidean space in such a way that no two cycles of the graph are linked. A flat embedding is an embedding with the property that every cycle is the boundary of a topological disk whose interior is disjoint from the graph.
Order embedding         
  • The set <math>S</math> of divisors of 6, partially ordered by ''x'' divides ''y''. The embedding <math>id: \{ 1,2,3 \} \to S</math> cannot be a coretraction.
  • Mutual order embedding of <math>(0,1)</math> and <math>[0,1]</math>, using <math>f(x) = (94x+3)/100</math> in both directions.
Order-embedding
In order theory, a branch of mathematics, an order embedding is a special kind of monotone function, which provides a way to include one partially ordered set into another. Like Galois connections, order embeddings constitute a notion which is strictly weaker than the concept of an order isomorphism.
order-embedding         
  • The set <math>S</math> of divisors of 6, partially ordered by ''x'' divides ''y''. The embedding <math>id: \{ 1,2,3 \} \to S</math> cannot be a coretraction.
  • Mutual order embedding of <math>(0,1)</math> and <math>[0,1]</math>, using <math>f(x) = (94x+3)/100</math> in both directions.
Order-embedding
A function f : D -> C is order-embedding iff for all x, y in D, f(x) <= f(y) <=> x <= y. I.e. arguments and results compare similarly. A function which is order-embedding is monotonic and one-to-one and an injection. ("<=" is written in LaTeX as sqsubseteq). (1995-02-03)
Connes embedding problem         
MATHEMATICAL PROBLEM IN VON NEUMANN ALGEBRA THEORY
Connes' embedding problem; Connes embedding conjecture
Connes' embedding problem, formulated by Alain Connes in the 1970s, is a major problem in von Neumann algebra theory. During that time, the problem was reformulated in several different areas of mathematics.
Center embedding         
AN OBSERVED LIMIT ON HOW MANY REFERENTIAL DESCRIPTORS ARE NESTED IN SENTENCES IN REGULAR USAGE
Centre embedding; Center-embedded clauses; Center-embedded
In linguistics, center embedding is the process of embedding a phrase in the middle of another phrase of the same type. This often leads to difficulty with parsing which would be difficult to explain on grammatical grounds alone.
Mitchell's embedding theorem         
THEOREM
Mitchell embedding theorem; Full embedding theorem; Freyd-Mitchell embedding theorem; Freyd–Mitchell embedding theorem
Mitchell's embedding theorem, also known as the Freyd–Mitchell theorem or the full embedding theorem, is a result about abelian categories; it essentially states that these categories, while rather abstractly defined, are in fact concrete categories of modules. This allows one to use element-wise diagram chasing proofs in these categories.
Universal embedding theorem         
Krasner–Kaloujnine embedding theorem; Krasner–Kaloujnine universal embedding theorem; Krasner-Kaloujnine embedding theorem; Krasner-Kaloujnine universal embedding theorem
The universal embedding theorem, or Krasner–Kaloujnine universal embedding theorem, is a theorem from the mathematical discipline of group theory first published in 1951 by Marc Krasner and Lev Kaluznin..

Википедия

Embedding

In mathematics, an embedding (or imbedding) is one instance of some mathematical structure contained within another instance, such as a group that is a subgroup.

When some object X {\displaystyle X} is said to be embedded in another object Y {\displaystyle Y} , the embedding is given by some injective and structure-preserving map f : X Y {\displaystyle f:X\rightarrow Y} . The precise meaning of "structure-preserving" depends on the kind of mathematical structure of which X {\displaystyle X} and Y {\displaystyle Y} are instances. In the terminology of category theory, a structure-preserving map is called a morphism.

The fact that a map f : X Y {\displaystyle f:X\rightarrow Y} is an embedding is often indicated by the use of a "hooked arrow" (U+21AA RIGHTWARDS ARROW WITH HOOK); thus: f : X Y . {\displaystyle f:X\hookrightarrow Y.} (On the other hand, this notation is sometimes reserved for inclusion maps.)

Given X {\displaystyle X} and Y {\displaystyle Y} , several different embeddings of X {\displaystyle X} in Y {\displaystyle Y} may be possible. In many cases of interest there is a standard (or "canonical") embedding, like those of the natural numbers in the integers, the integers in the rational numbers, the rational numbers in the real numbers, and the real numbers in the complex numbers. In such cases it is common to identify the domain X {\displaystyle X} with its image f ( X ) {\displaystyle f(X)} contained in Y {\displaystyle Y} , so that X Y {\displaystyle X\subseteq Y} .