Zobrazeno 1 - 10
of 26
pro vyhledávání: '"J Ross Quinlan"'
Autor:
Geoffrey J. McLachlan, J. Ross Quinlan, Bing Liu, Hiroshi Motoda, Xindong Wu, Angus S. K. Ng, Michael Steinbach, Philip S. Yu, Zhi-Hua Zhou, Dan Steinberg, David J. Hand, Joydeep Ghosh, Vipin Kumar, Qiang Yang
Publikováno v:
Knowledge and Information Systems. 14:1-37
This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, PageRank, AdaBoost, kNN, Naive Bayes, and CART. These top 10 algorithms are
Autor:
J. Ross Quinlan, R. Mike Cameron-Jones
Publikováno v:
ACM SIGART Bulletin. 5:33-42
FOIL is a system for inducing function-free Horn clause definitions of relations from example and extensionally defined background relations. It demonstrates the successful application of a general to specific approach to clause induction using heuri
Autor:
James Lu, Erik Rosenthal, Kenneth Forbus, D Kopec, T Marsland, J Cox, Stephanie Seneff, Victor Zue, J Ross Quinlan, Michael Jordan, Christopher Bishop, Thomas Dean, Subbarao Kambhampati, Gerald DeJong, Eric Chown, Judea Pearl, Frank Lewis, John Fitzgerald, Kai Liu
Publikováno v:
Computer Science Handbook, Second Edition CD-ROM ISBN: 9781584884682
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dea1decc2d99cb018578249f03de6a00
https://doi.org/10.1201/9780203494455.sec7
https://doi.org/10.1201/9780203494455.sec7
Autor:
J. Ross Quinlan
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540618638
ALT
ALT
Several empirical studies have confirmed that boosting classifier-learning systems can lead to substantial improvements in predictive accuracy. This paper reports early experimental results from applying boosting to ffoil, a first-order system that c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e1099ffb2d6f2e3606f3b8a3bfc1ce3
https://doi.org/10.1007/3-540-61863-5_42
https://doi.org/10.1007/3-540-61863-5_42
Autor:
J. Ross Quinlan
Publikováno v:
ICML
This paper continues work reported at ML'94 on the use of the Minimum Description Length Principle with non-probabilistic theories. A new encoding scheme is developed that has similar benefits to the adhoc penalty function used previously. The scheme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ff9f58bc745ad333dd979931c1b9cf4
https://doi.org/10.1016/b978-1-55860-377-6.50064-5
https://doi.org/10.1016/b978-1-55860-377-6.50064-5
Autor:
J. Ross Quinlan
Publikováno v:
ICML
Rissanen's Minimum Description Length Principle provides a clear formalism for weighing the apparent accuracy of a theory against its complexity. When learning in categorical domains, however, one common method of applying MDL can lead to theories wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f3187642b8c036a32a8189734662e89
https://doi.org/10.1016/b978-1-55860-335-6.50036-2
https://doi.org/10.1016/b978-1-55860-335-6.50036-2
Autor:
J. Ross Quinlan
This chapter discusses the programs that interact with classification models of either the decision tree or rule-based variety. While they have the same purpose, the different model types are handled by separate programs. The programs extend the simp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c505c35c94b50829dd9423fb1cebee4a
https://doi.org/10.1016/b978-0-08-050058-4.50013-9
https://doi.org/10.1016/b978-0-08-050058-4.50013-9
Autor:
J. Ross Quinlan
This chapter discusses the grouping of attribute values. Groupings of the elements may be relevant to the classification task at hand. Where such well-established groupings are known beforehand, it makes sense to provide this information to the syste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ed8aef800c98533b004497ec48e4ddd
https://doi.org/10.1016/b978-0-08-050058-4.50012-7
https://doi.org/10.1016/b978-0-08-050058-4.50012-7
Autor:
J. Ross Quinlan
Publisher Summary This chapter presents some of the missing but useful features, most of which have been implemented in at least one other system. Continuous classes are needed whenever the quantity to be predicted is numeric rather than categorical;
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ad52bbe45eeada89ec0c8390fc8df7b
https://doi.org/10.1016/b978-0-08-050058-4.50016-4
https://doi.org/10.1016/b978-0-08-050058-4.50016-4
Autor:
J. Ross Quinlan
This chapter describes the construction of decision trees. If any algorithm can be said to have fundamental importance in this software, it is the process of generating an initial decision tree from a set of training cases. The skeleton of Hunt's met
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3826aa46e9c0b633dd42430138d49107
https://doi.org/10.1016/b978-0-08-050058-4.50007-3
https://doi.org/10.1016/b978-0-08-050058-4.50007-3