TERMIUM Plus^®

Record 1,  Textual support,  English

Record number: 1, Textual support number: 1 CONT

A decision tree diagram is a graphical representation of decisions [that] includes the potential consequences of those decisions. A decision tree consists of nodes, branches, root nodes, and leaf nodes. Each node represents a decision made, or a test conducted on a specific attribute. Each branch represents the possible results or consequences of each decision. The root node is the starting point, which represents the first decision made. The leaf nodes represent the final results or conclusions.  2, record 1, English, - decision%20tree%20diagram

Record 1,  Textual support,  French

Record 1,  Textual support,  Spanish

Record 2,  Textual support,  English

Record number: 2, Textual support number: 1 CONT

Since decision tree learning starts from attribute selection for the root node, all rules must have this selected attribute as the common attribute. The constraint on the common attribute is likely to result in a decision tree containing redundant parts(i. e., the replicated sub-tree problem).  2, record 2, English, - common%20attribute

Record 2,  Textual support,  French

Record 2,  Textual support,  Spanish

Record 3,  Textual support,  English

Record number: 3, Textual support number: 1 DEF

... a non-parametric supervised learning algorithm [that] is utilized for both classification and regression tasks.  2, record 3, English, - decision%20tree

Record number: 3, Textual support number: 1 OBS

It has a hierarchical tree structure, which consists of a root node, branches, internal nodes and leaf nodes.  2, record 3, English, - decision%20tree

Record number: 3, Textual support number: 2 OBS

decision tree: term officially approved by the RADARSAT-2 Terminology Approval Group (RTAG).  3, record 3, English, - decision%20tree

Record 3,  Textual support,  French

Record number: 3, Textual support number: 1 DEF

[...] algorithme d'apprentissage supervisé non paramétrique, qui est utilisé à la fois pour [des] tâches de classification et [de] régression.  3, record 3, French, - arbre%20de%20d%C3%A9cision

Record number: 3, Textual support number: 1 OBS

Il a une structure [hiérarchique] arborescente, qui se compose d'un nœud racine, de branches, de nœuds internes et de nœuds feuilles.  3, record 3, French, - arbre%20de%20d%C3%A9cision

Record number: 3, Textual support number: 2 OBS

arbre de décision : terme uniformisé par le Groupe de travail de la terminologie de RADARSAT-2 (GTTR).  4, record 3, French, - arbre%20de%20d%C3%A9cision

Record 3,  Textual support,  Spanish

Record 4,  Textual support,  English

Record number: 4, Textual support number: 1 CONT

A number of decision nodes emerge from the root node [of a decision tree], representing the outcomes or decisions to be made. Each decision node... symbolizes a question or split point and is represented using square nodes.  2, record 4, English, - decision%20node

Record 4,  Textual support,  French

Record 4,  Textual support,  Spanish

Record 5,  Textual support,  English

Record number: 5, Textual support number: 1 DEF

A version of a balanced tree where all paths leading from the root node to a terminal node have the same length.  1, record 5, English, - B%2Dtree

Record number: 5, Textual support number: 1 OBS

A B-tree has the following properties, where n is the order of the B-tree : a : each node contains at most 2n items; b : each node, except the root node, contains at least n items; c : each node is either a terminal node or it has m+1 subordinate nodes, where m is its number of items. B-trees are used for fast access to data on external storage. The number of accesses to each item of data is [smaller or equal] log_n+1(m).  1, record 5, English, - B%2Dtree

Record number: 5, Textual support number: 2 OBS

B-tree: designation and definition standardized by ISO and the International Electrotechnical Commission.  3, record 5, English, - B%2Dtree

Record 5,  Textual support,  French

Record number: 5, Textual support number: 1 DEF

Arbre équilibré dans lequel tous les chemins conduisant du nœud racine à un nœud terminal ont la même longueur.  1, record 5, French, - arbre%20de%20type%20B

Record number: 5, Textual support number: 1 OBS

Un arbre de type B a les propriétés suivantes, où n est l'ordre de l'arbre de type B : a : Chaque nœud contient au plus 2n articles; b : Chaque nœud, à l'exception du nœud racine, contient au moins n articles; c : Chaque nœud, soit est un nœud terminal, soit a m+1 nœuds subordonnés, où m est son nombre d'articles. Les arbres de type B sont utilisés pour l'accès rapide aux données sur stockage externe. Le nombre d'accès à chaque article de données est [plus petit ou égal] log_n+1(m).  1, record 5, French, - arbre%20de%20type%20B

Record number: 5, Textual support number: 2 OBS

arbre de type B : désignation et définition normalisées par l'ISO et la Commission électrotechnique internationale.  3, record 5, French, - arbre%20de%20type%20B

Record 5,  Textual support,  Spanish

Record 6,  Textual support,  English

Record number: 6, Textual support number: 1 CONT

A game tree is a representation of the possibilities of two players in a game, like chess. At the top of the tree is the current game position, and each arc out represents a legal move for the first player. In turn, these lead to new positions and new outgoing arcs that are the legal moves for the second player. These arcs and positions can continue until each sequence leads to the end of the game.  2, record 6, English, - game%20tree

Record number: 6, Textual support number: 2 CONT

As is usual for game trees, the tree is drawn inverted with the root at the top. In the tree every node has as its immediate descendants-its offspring nodes-all the nodes which are reachable in one legal node.  3, record 6, English, - game%20tree

Record 6,  Textual support,  French

Record 6,  Textual support,  Spanish

Record number: 6, Textual support number: 1 CONT

Un árbol de juego es una representación gráfica que muestra una situación estratégica como una secuencia de movimientos, más que como una lista de opciones de pago simultáneas como en una matriz de pagos. En este, los nodos representan puntos de decisión para los jugadores, mientras que las ramas emergentes de cada nodo representan las posibles acciones disponibles. El final de cada rama, conocido como nodo terminal, se asocia con un resultado específico o pago para cada jugador.  1, record 6, Spanish, - %C3%A1rbol%20de%20juego

Record 7,  Textual support,  English

Record number: 7, Textual support number: 1 DEF

A data structure that organizes entities or attributes as nodes, with at most one parent node for each node and with only one root node.  2, record 7, English, - tree%20structure

Record number: 7, Textual support number: 1 OBS

tree structure: designation standardized by the Canadian Standards Association (CSA) and reproduced with its permission.  3, record 7, English, - tree%20structure

Record 7,  Textual support,  French

Record number: 7, Textual support number: 1 DEF

Structure de données dans laquelle on représente les entités ou les attributs par des nœuds, avec au plus un nœud parent pour chaque nœud, et avec un seul nœud racine.  3, record 7, French, - structure%20arborescente

Record number: 7, Textual support number: 1 OBS

structure arborescente : désignation normalisée par l'Association canadienne de normalisation (CSA) et reproduits avec son autorisation.  4, record 7, French, - structure%20arborescente

Record 7,  Textual support,  Spanish

Record 8,  Textual support,  English

Record number: 8, Textual support number: 1 DEF

... a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.  4, record 8, English, - alpha%2Dbeta%20pruning%20algorithm

Record number: 8, Textual support number: 1 CONT

An alpha-beta algorithm is able to evaluate a game tree at reduced cost by ignoring subtrees that cannot affect the final value of the root node.  5, record 8, English, - alpha%2Dbeta%20pruning%20algorithm

Record 8,  Textual support,  French

Record number: 8, Textual support number: 1 DEF

Algorithme de recherche qui permet de limiter le nombre de situations étudiées sans perdre d'informations.  4, record 8, French, - algorithme%20d%27%C3%A9lagage%20alpha%2Db%C3%AAta

Record number: 8, Textual support number: 1 CONT

Pour les programmes d'échecs, l'heuristique à mouvement nul est une technique heuristique utilisée pour améliorer la vitesse de l'algorithme d'élagage alpha-bêta.  1, record 8, French, - algorithme%20d%27%C3%A9lagage%20alpha%2Db%C3%AAta

Record 8,  Textual support,  Spanish

Record number: 8, Textual support number: 1 OBS

[...] es el más utilizado en las aplicaciones referidas a juegos, dada su excepcional utilidad en el aumento de la velocidad de la búsqueda sin producir pérdidas de información.  1, record 8, Spanish, - algoritmo%20de%20poda%20alfa%20beta

Record 9,  Textual support,  English

Record number: 9, Textual support number: 1 DEF

A graph traversal algorithm that explores nodes in the order of their distance from the roots, where distance is defined as the minimum path length from a root to the node.  3, record 9, English, - breadth%2Dfirst%20search%20algorithm

Record number: 9, Textual support number: 1 OBS

It starts at the tree root(or some arbitrary node of a graph, sometimes referred to as a 'search key’), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.  4, record 9, English, - breadth%2Dfirst%20search%20algorithm

Record 9,  Textual support,  French

Record number: 9, Textual support number: 1 CONT

L'algorithme de parcours en largeur permet de calculer les distances de tous les nœuds depuis un nœud source dans un graphe non pondéré (orienté ou non orienté). Il peut aussi servir à déterminer si un graphe non orienté est connexe.  3, record 9, French, - algorithme%20de%20parcours%20en%20largeur%20d%27abord

Record 9,  Textual support,  Spanish

Record 10,  Textual support,  English

Record number: 10, Textual support number: 1 CONT

Initiator Transaction : In this role a system performs the task of the root node. It starts a transaction and all participants in the transaction are its machines.  1, record 10, English, - initiator%20transaction

Record 10,  Textual support,  French

Record number: 10, Textual support number: 1 CONT

Transaction d'expéditeur : Dans ce rôle, un système exécute la tâche du nœud racine. Il commence une transaction et tous les participants à la transaction sont ses machines.  1, record 10, French, - transaction%20d%27exp%C3%A9diteur

Record number: 10, Textual support number: 1 OBS

Termes (et justifications) tirés de la norme : «TBITS 6.2 The Industry/Government Open Systems Specification (IGOSS) - Technical Specifications» publiée par les Services des technologies de l'information du Secrétariat du Conseil du Trésor du Canada.  2, record 10, French, - transaction%20d%27exp%C3%A9diteur

Record 10,  Textual support,  Spanish

Record 11,  Textual support,  English

Record number: 11, Textual support number: 1 CONT

General Transaction : In this role a system may be a root, intermediate, or leaf node depending on how it is being used at a specific point in time.  1, record 11, English, - general%20transaction

Record 11,  Textual support,  French

Record number: 11, Textual support number: 1 CONT

Transaction générale : Dans ce rôle, un système peut être un nœud racine, intermédiaire ou «feuille», selon la façon dont il est utilisé à un certain moment.  1, record 11, French, - transaction%20g%C3%A9n%C3%A9rale

Record number: 11, Textual support number: 1 OBS

Termes (et justifications) tirés de la norme : «TBITS 6.2 The Industry/Government Open Systems Specification (IGOSS) - Technical Specifications» publiée par les Services des technologies de l'information du Secrétariat du Conseil du Trésor du Canada.  2, record 11, French, - transaction%20g%C3%A9n%C3%A9rale

Record 11,  Textual support,  Spanish

Record 12,  Textual support,  English

Record number: 12, Textual support number: 1 DEF

A node that has no parent node.  4, record 12, English, - root%20node

Record number: 12, Textual support number: 2 DEF

The initial (apex) note in a tree representation.  5, record 12, English, - root%20node

Record number: 12, Textual support number: 1 OBS

The tree is generally shown inverted, with the root at the top.  2, record 12, English, - root%20node

Record number: 12, Textual support number: 2 OBS

root node : term standardized by ISO and CSA.  6, record 12, English, - root%20node

Record 12,  Textual support,  French

Record number: 12, Textual support number: 1 DEF

Nœud qui n'a pas de nœud parent.  3, record 12, French, - n%26oelig%3Bud%20racine

Record number: 12, Textual support number: 1 OBS

nœud racine : terme normalisé par l'ISO et la CSA.  4, record 12, French, - n%26oelig%3Bud%20racine

Record 12,  Textual support,  Spanish

Record 13,  Textual support,  English

Record number: 13, Textual support number: 1 DEF

In a binary tree, the root of the tree has level 0 and the level of any other node in the tree is one more that the level of its parent.  1, record 13, English, - node%20level

Record 13,  Textual support,  French

Record 13,  Textual support,  Spanish

Record 14,  Textual support,  English

Record number: 14, Textual support number: 1 CONT

Each goal in the initial hierarchy has a height. The lowest terminal nodes are at height 0. Their parents are at height 1, and so on up the tree. The height of the root node is the height of the tree, which we call H.  2, record 14, English, - height

Record 14,  Textual support,  French

Record number: 14, Textual support number: 1 DEF

Mesure des niveaux d'un graphe ou d'une hiérarchie à partir des feuilles-nœuds terminaux jusqu'à la racine ou tête, c'est-à-dire dans un sens contraire à celui de la profondeur.  2, record 14, French, - hauteur

Record 14,  Textual support,  Spanish

Record 15,  Textual support,  English

Record number: 15, Textual support number: 1 DEF

Any node in a tree, except the root.  2, record 15, English, - child

Record number: 15, Textual support number: 1 CONT

A tree begins with a root ... This root gives birth to one or more children, which represent the different nodes of the problem. Each child (or offspring) may give birth to other children.  3, record 15, English, - child

Record 15,  Textual support,  French

Record number: 15, Textual support number: 1 CONT

Chaque nœud est relié à d'autres nœuds que l'on appelle ses successeurs ou fils, eux-mêmes éventuellement reliés à d'autres fils.  3, record 15, French, - fils

Record number: 15, Textual support number: 2 CONT

Des relations hiérarchiques [...] sont utilisées par des procédures de contrôle comme mécanismes d'héritage ou transmission de propriétés d'un nœud ancêtre (plus général) vers son ou ses nœuds progéniture (plus spécialisés).  2, record 15, French, - fils

Record 15,  Textual support,  Spanish

Record 16,  Textual support,  English

Record number: 16, Textual support number: 1 CONT

A node A is the parent of node B in a tree if B is the root of one of the subtrees of the tree rooted at A.  1, record 16, English, - root

Record 16,  Textual support,  French

Record number: 16, Textual support number: 1 OBS

Ce sont en fait des réseaux sémantiques dont le type d'arc est relié à des relations hiérarchiques [...] qui sont utilisées par des procédures de contrôle comme mécanismes d'héritage ou transmission de propriété d'un nœud ancêtre (plus général) vers son ou ses nœuds de progéniture (plus spécialisés).  2, record 16, French, - t%C3%AAte

Record 16,  Textual support,  Spanish

Record 22,  Textual support,  English

Record number: 22, Textual support number: 1 DEF

A hierarchical representation consisting of nodes connected by branches, in which each branch connects one node to a directly subsidiary node, where there is a unique node called the root that is not subsidiary to any other node, and every node besides the root is directly subsidiary to exactly one other node.  2, record 22, English, - tree

Record number: 22, Textual support number: 1 OBS

tree: STD-IEEE.  2, record 22, English, - tree

Record 22,  Textual support,  French

Record number: 22, Textual support number: 1 DEF

Structure hiérarchisée entre différents éléments (L'élément principal nommé racine permet d'atteindre tous les autres éléments à la suite d'une énumération).  2, record 22, French, - arbre

Record number: 22, Textual support number: 1 CONT

Tout élément de l'arbre, excepté la racine, est le fils d'un seul autre élément; ou bien il admet lui-même un ou plusieurs sous-arbres comme fils, ou bien il n'a aucun fils (on lui donne alors le nom de feuille).  2, record 22, French, - arbre

Record 22,  Textual support,  Spanish

Record 23,  Textual support,  English

Record number: 23, Textual support number: 1 DEF

A virtual terminal environment(VTE) that is a complete directed graph of VTE parameters in which all node parameters and terminal leaf parameters implied by all existing nodes from the root of the tree have values.  2, record 23, English, - full%20virtual%20terminal%20environment

Record 23,  Textual support,  French

Record 23,  Textual support,  Spanish

Record number: 23, Textual support number: 1 DEF

Entorno que simula totalmente un terminal directamente conectado a un equipo.  2, record 23, Spanish, - entorno%20de%20terminal%20virtual%20completo

Record 24,  Textual support,  English

Record number: 24, Textual support number: 1 DEF

An approach in which, starting with the root node, the nodes in the search tree are generated and examined level by level(before proceeding deeper). This approach is guaranteed to find an optimal solution if it exists.  3, record 24, English, - breadth%2Dfirst%20search

Record number: 24, Textual support number: 2 DEF

A search that expands a tree level by level. First, all root children are generated. If the goal node is not found among these, then level 2 is generated, and so on.  4, record 24, English, - breadth%2Dfirst%20search

Record number: 24, Textual support number: 1 OBS

breadth-first search: term standardized by ISO and CSA.  5, record 24, English, - breadth%2Dfirst%20search

Record 24,  Textual support,  French

Record number: 24, Textual support number: 1 DEF

Recherche poursuivie sur tous les successeurs d'un état avant qu'un de leurs successeurs ne soit développé.  4, record 24, French, - recherche%20en%20largeur

Record number: 24, Textual support number: 1 OBS

recherche en largeur; recherche en largeur d'abord : termes normalisés par ISO/CEI et la CSA.  5, record 24, French, - recherche%20en%20largeur

Record 24,  Textual support,  Spanish

Record 25,  Textual support,  English

Record number: 25, Textual support number: 1 DEF

A tree whose nodes represent task states; it contains the task states produced from the root node by symbolically executing path segments that begin with the associated assertion and end with the next assertion encountered.  1, record 25, English, - symbolic%20execution%20tree

Record 25,  Textual support,  French

Record 25,  Textual support,  Spanish

Record 26,  Textual support,  English

Record number: 26, Textual support number: 1 DEF

The maximum level of any node in a tree or the maximum distance to the root from any node.  1, record 26, English, - tree%20depth

Record 26,  Textual support,  French

Record number: 26, Textual support number: 1 CONT

Le nombre de situations légales à un niveau donné détermine la largeur de l'arborescence, le nombre de niveaux détermine sa profondeur. La largeur croît exponentiellement avec la profondeur.  1, record 26, French, - profondeur%20de%20l%27arborescence

Record 26,  Textual support,  Spanish

Record 27,  Textual support,  English

Record number: 27, Textual support number: 1 CONT

Each leaf node is represented by use of a locational code corresponding to a sequence of directional codes that locate the leaf along a path from the root of the tree.  1, record 27, English, - directional%20code

Record 27,  Textual support,  French

Record 27,  Textual support,  Spanish