See this document in CiteSeerX!

Machine Learning Research: Four Current Directions (1997)  (Make Corrections)  (137 citations)
Thomas G. Dietterich
The AI Magazine



  Home/Search   Context   Related

 
View or download:
orst.edu/pub/tgd/p...aimagsurvey.ps.gz
gatsby.ucl.ac.uk/~hagai...dietterich.ps
gatsby.ucl.ac.uk/~andy/...dietterich.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  orst.edu/~tgd/changehistory (more)
From:  gatsby.ucl.ac.uk/~hagai/mljc
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Machine Learning research has been making great progress in many directions. This article summarizes four of these directions and discusses some current open problems. The four directions are (a) improving classification accuracy by learning ensembles of classifiers, (b) methods for scaling up supervised learning algorithms, (c) reinforcement learning, and (d) learning complex stochastic models. 1 Introduction The last five years have seen an explosion in machine learning research. This... (Update)

Similar documents based on text:   More   All
0.0:   Learning Ensembles of First-Order Clauses for.. - Goadrich, Oliphant.. (2004)   (Correct)
0.0:   Improving the Performance of Radial Basis Function.. - Wettschereck, Dietterich (1992)   (Correct)
0.0:   Hierarchical Explanation-Based Reinforcement Learning - Tadepalli, Dietterich (1997)   (Correct)

BibTeX entry:   (Update)

T.G. Dietterich. Machine learning research: Four current directions. AI Magazine, 18(4):97--136, 1997. http://citeseer.ist.psu.edu/dietterich97machine.html   More

@article{ dietterich98machinelearning,
    author = "Thomas G. Dietterich",
    title = "Machine-Learning Research: Four Current Directions",
    journal = "The {AI} Magazine",
    volume = "18",
    number = "4",
    pages = "97--136",
    year = "1998",
    url = "citeseer.ist.psu.edu/dietterich97machine.html" }
Citations (may not include all citations):
2528   Maximum likelihood from incomplete data via the EM algorithm (context) - Dempster, Laird et al. - 1976
2133   Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
667   UCI repository of machine learning databases (context) - Merz, Murphy - 1996
658   Learning from Delayed Rewards (context) - Watkins - 1989
657   Bagging predictors - Breiman
509   A decision-theoretic generalization of on-line learning and .. - Freund, Schapire - 1995
500   Experiments with a new boosting algorithm - Freund, Schapire - 1996
492   Learning logical definitions from relations (context) - Quinlan - 1990
472   Hierarchical mixtures of experts and the EM algorithm - Jordan, Jacobs - 1994
416   A Bayesian method for the induction of probabilistic network.. (context) - Cooper, Herskovits - 1992
413   Neuro-Dynamic Programming (context) - Bertsekas, Tsitsiklis - 1996
374   Reinforcement learning: A survey - Kaelbling, Littman et al. - 1996
367   Stacked generalization - Wolpert - 1992
351   Learning Bayesian networks: The combination of knowledge and.. - Heckerman, Geiger et al. - 1995
317   Learning quickly when irrelevant attributes abound: A new li.. (context) - Littlestone - 1988

[Article contains additional citations not shown here]



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://gopher.cs.orst.edu/~tgd/change-history.html):   More
Value Function Approximations and Job-Shop Scheduling - Zhang, Dietterich (1995)   (Correct)
An Experimental Comparison of Three Methods for Constructing.. - Dietterich (1998)   (Correct)
The MAXQ Method for Hierarchical Reinforcement Learning - Dietterich (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC