Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Arbre décision")


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 4750

  • Page / 190

Selection :

  • and

A comparison of approaches for learning probability treesFIERENS, Daan; RAMON, Jan; BLOCKEEL, Hendrik et al.Lecture notes in computer science. 2005, pp 556-563, issn 0302-9743, isbn 3-540-29243-8, 1Vol, 8 p.Conference Paper

Tight Ω(n lg n) lower bound for finding a longest increasing subsequenceRAMANAN, P.International journal of computer mathematics. 1997, Vol 65, Num 3-4, pp 161-164, issn 0020-7160Article

A syntactic characterization of bounded-rank decision trees in terms of decision listsGALESI, N.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 2, pp 149-158, issn 0988-3754Article

Decision trees : Old and new resultsFLEISCHER, R.Information and computation (Print). 1999, Vol 152, Num 1, pp 44-61, issn 0890-5401Article

Variable selection heuristics and optimum decision trees: An experimental studyMIYAKAWA, Masahiro; OTSU, Nobuyuki; ROSENBERG, Ivo G et al.Proceedings - International Symposium on Multiple-Valued Logic. 2002, pp 238-244, issn 0195-623X, isbn 0-7695-1462-6, 7 p.Conference Paper

Lower bounds for approximate polygon decomposition and minimum gapGUDMUNDSSON, Joachim; HUSFELDT, Thore; LEVCOPOULOS, Christos et al.Information processing letters. 2002, Vol 81, Num 3, pp 137-141, issn 0020-0190Article

Machine learning in artificial intelligenceBRATKO, I.Artificial intelligence in engineering. 1993, Vol 8, Num 3, pp 159-164, issn 0954-1810Article

On-line learning of decision trees in problems with unknown dynamicsNUNEZ, Marlon; FIDALGO, Raul; MORALES, Rafael et al.Lecture notes in computer science. 2005, pp 443-453, issn 0302-9743, isbn 3-540-29896-7, 1Vol, 11 p.Conference Paper

The application of confidence interval error analysis to the design of decision tree classifiersKALKANIS, G.Pattern recognition letters. 1993, Vol 14, Num 5, pp 355-361, issn 0167-8655Article

De religieuze beslisboom = The Religious Decision TreeAlgemeen Nederlands tijdschrift voor wijsbegeerte. 2012, Vol 104, Num 2, issn 0002-5275, 59 p.Serial Issue

GRAPHES D'INDUCTION = INDUCTION GRAPHSRakotomalala, Ricco; Zighed, Djamel.1997, 363 p.Thesis

Well-behaved evaluation functions for numerical attributesELOMAA, T; ROUSU, J.Lecture notes in computer science. 1997, pp 147-156, issn 0302-9743, isbn 3-540-63614-5Conference Paper

The reconciliation of decision analysesLINDLEY, D. V.Operations research. 1986, Vol 34, Num 2, pp 289-295, issn 0030-364XArticle

Lower bounds on probabilistic linear decision treesSNIR, M.Theoretical computer science. 1985, Vol 38, Num 1, pp 69-82, issn 0304-3975Article

The airway approach algorithm: A decision tree for organizing preoperative airway informationROSENBLATT, William H.Journal of clinical anesthesia. 2004, Vol 16, Num 4, pp 312-316, issn 0952-8180, 5 p.Article

Averaging over decision treesOLIVER, J. J; HAND, D.Journal of classification. 1996, Vol 13, Num 2, pp 281-297, issn 0176-4268Article

A knowledge-based software environment for the analysis of spectroradiometer data = Environnement du logiciel basé sur la connaissance pour l'analyse des données spectroradiométriquesGOETTING, H. R; LYON, R. J. P.International geoscience and remote sensing symposium. 1986, pp 235-238Conference Paper

Application of Ramsey's theorem to decision tree complexityMORAN, S; SNIR, M; MANBER, U et al.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 4, pp 938-949, issn 0004-5411Article

The complexity of problems on probabilistic, nondeterministic, and alternating decision treesMANBER, U; TOMPA, M.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 3, pp 720-732, issn 0004-5411Article

A supervised learning algorithm for hierarchical classification of fuzzy patternsBISWAS, P; MAJUMDAR, A. K.Information sciences. 1983, Vol 31, Num 2, pp 91-106, issn 0020-0255Article

YaDT : Yet another decision tree builderRUGGIERI, Salvatore.Proceedings - International Conference on Tools with Artificial Intelligence, TAI. 2004, pp 260-265, issn 1082-3409, isbn 0-7695-2236-X, 1Vol, 6 p.Conference Paper

Comments on «An automated approach to the design of decision tree classifiers»KIM, B. S; PARK, S. B.IEEE transactions on pattern analysis and machine intelligence. 1986, Vol 8, Num 4, issn 0162-8828, 560Article

Fault-tree analysis using a binary decision treeSCHNEEWEISS, W. S.IEEE transactions on reliability. 1985, Vol 34, Num 5, pp 453-457, issn 0018-9529Article

Decision tree design using a probabilistic modelCASEY, R. G; NAGY, G.IEEE transactions on information theory. 1984, Vol 30, Num 1, pp 93-99, issn 0018-9448Article

The equivalency between a decision tree for classification and a feedback neural networkLI, Aijun; LUO, Siwei; LIU, Yunhui et al.International Conference on Signal Processing. 2004, pp 1558-1561, isbn 0-7803-8406-7, 4 p.Conference Paper

  • Page / 190