Difference between revisions of "Ross Quinlan"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Ross Quinlan''' FILE:quinlan-small.jpg|border|right|thumb|link=https://www.rulequest.com/Personal/| Ross Quinlan <ref>[https://www.rul...")
 
Line 11: Line 11:
 
as used in [https://en.wikipedia.org/wiki/Decision_tree_learning decision tree learning], Ross Quinlan invented the tree induction algorithms [https://en.wikipedia.org/wiki/ID3_algorithm Iterative Dichotomiser 3] (ID3)  
 
as used in [https://en.wikipedia.org/wiki/Decision_tree_learning decision tree learning], Ross Quinlan invented the tree induction algorithms [https://en.wikipedia.org/wiki/ID3_algorithm Iterative Dichotomiser 3] (ID3)  
 
<ref>[https://www.cise.ufl.edu/~ddd/cap6635/Fall-97/Short-papers/2.htm The ID3 Algorithm]</ref>  
 
<ref>[https://www.cise.ufl.edu/~ddd/cap6635/Fall-97/Short-papers/2.htm The ID3 Algorithm]</ref>  
and their successors [https://en.wikipedia.org/wiki/C4.5_algorithm C4.5], and [https://en.wikipedia.org/wiki/C4.5_algorithm#Improvements_in_C5.0/See5_algorithm C5.0] <ref>[https://www.rulequest.com/see5-info.html Information on See5/C5.0]</ref> <ref>[https://www.rulequest.com/see5-comparison.html Is C5.0 Better Than C4.5?]</ref>.  
+
and their successors [https://en.wikipedia.org/wiki/C4.5_algorithm C4.5] <ref>[[Mathematician#CDrummond|Chris Drummond]], [[Robert Holte]] ('''2003'''). ''C4.5, Class Imbalance, and Cost Sensitivity: Why Under-Sampling beats Over-Sampling''. [https://www.site.uottawa.ca/~nat/Workshop2003/workshop2003.html ICML 2003 Workshop on Learning from Imbalanced Data Sets (II)], [https://www.site.uottawa.ca/~nat/Workshop2003/drummondc.pdf pdf]</ref>, and [https://en.wikipedia.org/wiki/C4.5_algorithm#Improvements_in_C5.0/See5_algorithm C5.0] <ref>[https://www.rulequest.com/see5-info.html Information on See5/C5.0]</ref> <ref>[https://www.rulequest.com/see5-comparison.html Is C5.0 Better Than C4.5?]</ref>.  
 
and further introduced the [https://en.wikipedia.org/wiki/First-order_inductive_learner first-order inductive learner] (FOIL). One application of these algorithms is to discover classifications rules for [[Endgame|chess endgames]], as shown with KRKN and ID3 in ''Learning Efficient Classification Procedures and Their Application to Chess End Games''  <ref>[[Ross Quinlan]] ('''1983'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-12405-5_15 Learning Efficient Classification Procedures and Their Application to Chess End Games]''. in [https://link.springer.com/book/10.1007%2F978-3-662-12405-5 Machine Learning: An Artificial Intelligence Approach]</ref> .  
 
and further introduced the [https://en.wikipedia.org/wiki/First-order_inductive_learner first-order inductive learner] (FOIL). One application of these algorithms is to discover classifications rules for [[Endgame|chess endgames]], as shown with KRKN and ID3 in ''Learning Efficient Classification Procedures and Their Application to Chess End Games''  <ref>[[Ross Quinlan]] ('''1983'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-12405-5_15 Learning Efficient Classification Procedures and Their Application to Chess End Games]''. in [https://link.springer.com/book/10.1007%2F978-3-662-12405-5 Machine Learning: An Artificial Intelligence Approach]</ref> .  
  

Revision as of 11:51, 1 May 2020

Home * People * Ross Quinlan

Ross Quinlan [1]

John Ross Quinlan,
an Australian computer scientist and researcher in machine learning, data mining, and decision theory along with first-order logic and inductive logic programming. He runs his company RuleQuest Research [2], and was affiliated with the University of Sydney, the University of Technology Sydney, the University Of New South Wales and the RAND Corporation.

Based on the concept learning [3] by Earl B. Hunt [4] as used in decision tree learning, Ross Quinlan invented the tree induction algorithms Iterative Dichotomiser 3 (ID3) [5] and their successors C4.5 [6], and C5.0 [7] [8]. and further introduced the first-order inductive learner (FOIL). One application of these algorithms is to discover classifications rules for chess endgames, as shown with KRKN and ID3 in Learning Efficient Classification Procedures and Their Application to Chess End Games [9] .


Selected Publications

[10] [11]

1968 ...

1970 ...

1980 ...

1990 ...

External Links

References

Up one level