|
|
|
|
|
|
|
|
|
Type label description
| Глоссарий по искусственному интеллекту |
3 regular a regular expression or a deterministic finite automata can determine if a string is a member of the language. 2 context free computable by a context-free grammer or a push down automata. 1 context sensitive computable by linear bounded automata. 0 recursive a turing machine can compute whether a given string is a member of the language.
|
|
Expression, французский
Deterministic, английский
- Детерминированный
- Attribute of systems whose behavior is specified without probabilities (other than zero or one) (->probability) and predietable without uncertainty once the relevant conditions are known. deterministic systems leave nothing to chance and are of necessity lawful. there are no options. deterministic systems conform to the ideal of a machine in which wear and tear, mechanical failures and unreliabilities are absent. modern computers are conceived as deterministic machines. deym,opment
- A process that has no random (stochastic) component.
Computable, английский
Вычислимый; исчислимый
|
Architecture is a smoothed, английский
Variant of the learning vector quantization (lvq) and counterpropagation architectures. see also: height, radial basis function, width, ftp://ftp.sas.com/pub/neural/faq2.html.
Reprepage, английский
77 sented as a collection of rules (if condition 1 then condition2). (see figure d.1.) some examples of decision tree methods include classification and regression trees (cart) methods, oc1, c4_5, and a commercial programs such as knowledge seeker. see also: classification and regression trees, data mining, oc1, c4.5, knowledge discovery in databases, knowledgeseeker, recursive partitioning. figure d.1 —
|
|
|
|
|
|
|
