(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)
Cited by: More
Approximation Algorithms for Classification Problems with - Pairwise Relationships..
(Correct)
BAYES-NEAREST: a new Hybrid Classifier Combining Bayesian.. - Lazkano, Sierra (2003)
(Correct)
On a Unified Framework for Sampling with and.. - Martinez-Otzeta..
(Correct)
Similar documents (at the sentence level):
51.3%: This Is a Publication of - The American Association
(Correct)
7.6%: Ensemble Methods in Machine Learning - Dietterich (2000)
(Correct)
Active bibliography (related documents): More All
0.4: The "test and Select" Approach to Ensemble Combination - Amanda Sharkey Noel (2000)
(Correct)
0.3: Optimal Linear Combinations of Neural Networks - Hashem (1994)
(Correct)
0.2: Diversity in Neural Network Ensembles - Gavin Brown To (2003)
(Correct)
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)
Related documents from co-citation: More All
34: Programs for machine learning (context) - Quinlan - 1993
31: Experiments with a New Boosting Algorithm
- Freund, Schapire - 1996
24: Induction of Decision Trees (context) - Quinlan - 1986
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
312
An Introduction to Bayesian Networks (context) - Jensen - 1996
303
Stochastic relaxation (context) - Geman, Geman - 1984
300
SOAR: An architecture for general intelligence (context) - Laird, Newell et al. - 1987
295
Some studies in machine learning using the game of checkers (context) - Samuel - 1959
291
Irrelevant features and the subset selection problem
- John, Kohavi et al. - 1994
257
Learning to act using real-time dynamic programming
- Barto, Bradtke et al. - 1995
248
Fast effective rule induction
- Cohen - 1995
234
Dynamic Programming (context) - Bellman - 1957
219
A tutorial on learning with Bayesian networks
- Heckerman - 1996
219
Practical issues in temporal difference learning
- Tesauro - 1992
208
Approximating discrete probability distributions with depend.. (context) - Chow, Liu - 1968
203
Multi-interval discretization of continuous-valued attribute.. (context) - Fayyad, Irani - 1993
199
Probabilistic inference using Markov chain Monte Carlo metho..
- Neal - 1993
199
A model for reasoning about persistence and causation (context) - Dean, Kanazawa - 1989
185
Inferring decision trees using the minimum description lengt.. (context) - Quinlan, Rivest - 1989
185
Numerical recipes in C : The art of scientific computing (context) - Press, Flannery et al. - 1992
183
Solving multiclass learning problems via error-correcting ou..
- Dietterich, Bakiri - 1995
153
A practical Bayesian framework for backpropagation networks (context) - MacKay - 1992
149
Technical note: Q-learning (context) - Watkins, Dayan - 1992
148
Bayesian analysis in expert systems (context) - Spiegelhalter, Dawid et al. - 1993
148
Acting optimally in partially observable stochastic domains
- Cassandra, Kaelbling et al. - 1994
131
When networks disagree: Ensemble methods for hybrid neural n..
- Perrone, Cooper - 1993
124
Improving elevator performance using reinforcement learning
- Crites, Barto - 1995
119
Operations for learning with graphical models
- Buntine - 1994
115
Explanation-based learning: A problem solving perspective (context) - Minton, Carbonell et al. - 1989
111
SLIQ: A fast scalable classifier for data mining
- Mehta, Agrawal et al. - 1996
110
Temporal difference learning and TD-Gammon (context) - Tesauro - 1995
109
Stacked regressions (context) - Breiman
105
Probabilistic independence networks for hidden Markov probab..
- Smyth, Heckerman et al. - 1997
102
Neural network ensembles (context) - Hansen, Salamon - 1990
102
Training a 3-node neural network is NP-Complete
- Blum, Rivest - 1988
98
Stochastic simulation algorithms for dynamic probabilistic n..
- Kanazawa, Koller et al. - 1995
95
Estimating attributes: Analysis and extensions of relief
- Kononenko - 1994
94
Feudal reinforcement learning
- Dayan, Hinton - 1993
94
Constructing optimal binary decision trees is NP-Complete (context) - Hyafil, Rivest - 1976
90
Bayesian classification (context) - Cheeseman, Self et al. - 1988
87
Subset selection in regression (context) - Miller - 1990
86
Computational analysis of present-day American English (context) - Kucera, Francis - 1967
86
Springer-Verlag (context) - Spirtes, Glymour et al. - 1993
84
Bayesian updating in recursive graphical models by local com.. (context) - Jensen, Lauritzen et al. - 1990
82
Error-correcting output coding corrects bias and variance
- Kong, Dietterich - 1995
80
A reinforcement learning approach to job-shop scheduling
- Zhang, Dietterich - 1995
79
Error reduction through learning multiple descriptions
- Ali, Pazzani - 1996
76
On changing continuous attributes into ordered discrete attr.. (context) - Catlett - 1991
74
A guide to the literature on learning probabilistic networks..
- Buntine - 1996
72
Equivalence and synthesis of causal models (context) - Verma, Pearl - 1990
70
Scheduling and rescheduling with iterative repair (context) - Zweben, Daun et al. - 1994
68
Hybrid system for protein secondary structure prediction (context) - Zhang, Mesirov et al. - 1992
68
Empirical support for Winnow and Weighted-Majority algorithm..
- Blum - 1997
67
Expert Systems and Probabilistic Network Models (context) - Castillo, Gutierrez et al. - 1997
66
Generating accurate and diverse members of a neural-network ..
- Opitz, Shavlik - 1996
63
An analysis of temporal-difference learning with function ap..
- Tsitsiklis, Van Roy - 1996
61
Error correlation and error reduction in ensemble classifier..
- Tumer, Ghosh - 1996
60
A theory of learning classification rules
- Buntine - 1990
59
Efficient algorithms for minimizing cross validation error
- Moore, Lee - 1994
59
Similarity metric learning for a variable-kernel classifier
- Lowe - 1995
58
Local learning in probabilistic networks with hidden variabl..
- Russell, Binder et al. - 1995
57
Multiple decision trees (context) - Kwok, Carter - 1990
55
Reinforcement learning for dynamic channel allocation in cel..
- Singh, Bertsekas - 1997
55
A review and empirical evaluation of feature weighting metho..
- Wettschereck, Aha et al. - 1997
54
Learning from hints in neural networks (context) - Abu-Mostafa - 1990
52
A reinforcement learning method for maximizing undiscounted .. (context) - Schwartz - 1993
50
Optimal linear combinations of neural networks
- Hashem - 1993
49
Building classifiers using Bayesian networks
- Friedman, Goldszmidt - 1996
48
Back propagation is sensitive to initial conditions
- Kolen, Pollack - 1991
48
Average reward reinforcement learning: Foundations
- Mahadevan - 1996
45
An experimental comparison of the nearest-neighbor and neare..
- Wettschereck, Dietterich - 1995
39
Instance-based utile distinctions for reinforcement learning..
- McCallum - 1995
38
Best-first model merging for hidden Markov model induction
- Stolcke, Omohundro - 1994
38
A language and program for complex Bayesian modelling (context) - Gilks, Thomas et al. - 1993
34
Ensemble learning using decorrelated neural networks
- Rosen - 1996
33
Incremental reduced error pruning (context) - Furnkranz, Widmer - 1994
32
Applying Winnow to context-sensitive spelling correction
- Golding, Roth - 1996
29
Learning arbiter and combiner trees from partitioned data fo..
- Chan, Stolfo - 1995
28
Decision theoretic subsampling for induction on large databa.. (context) - Musick, Catlett et al. - 1992
27
Using output codes to boost multiclass learning problems
- Schapire - 1997
27
Introduction to Reinforcement Learning (context) - Barto, Sutton - 1997
26
Using generative models for handwritten digit recognition
- Revow, Williams et al. - 1996
24
Human expert-level performance on a scientific image analysi..
- Cherkauer - 1996
24
Option decision trees with majority votes
- Kohavi, Kunz - 1997
20
Incremental probabilistic inference (context) - D'Ambrosio - 1993
19
Bootstrapping with noise: An effective regularization techni..
- Raviv, Intrator - 1996
15
Algorithms and applications for multitask learning
- Caruana - 1996
14
Programs for Empirical Learning (context) - Quinlan - 1993
11
Machine learning bias (context) - Dietterich, Kong - 1995
11
Auto-exploratory average reward reinforcement learning
- Ok, Tadepalli - 1996
11
Hierarchical reinforcement learning: Preliminary results (context) - Kaelbling - 1993
9
Improving committee diagnosis with resampling techniques (context) - Parmanto, Munro et al. - 1996
7
Random House Unabridged Dictionary (context) - Flexner - 1983
6
Competition among networks improves committee performance (context) - Munro, Parmanto - 1997
3
Neural network classifier for hepatoma detection (context) - Parmanto, Munro - 1994
1
Transfer of learning by composing solutions to elemental seq.. (context) - Singh - 1992
1
The national science foundation workshop on reinforcement le.. (context) - Learning, Mahadevan et al. - 1996
1
A tutorial on hidden Markov models and selected applications.. (context) - Computation, Rabiner - 1989
1
Overcoming the myopic of inductive learning algorithms with .. (context) - Kononenko, Simec et al. - 1997
1
Extracting tree-structured representations from trained netw.. (context) - Learning, Craven et al. - 1996
1
Bayesian CART
- Chipman, George et al. - 1996
1
Learning policies for partially observable environments: Sca.. (context) - Learning, Littman et al. - 1995
1
Learning to predict by the methods of temporal differences (context) - International, Institute et al. - 1988
1
Combining forcasts: A review and annotated bibliography (context) - Clemen - 1989
1
Extending local learners with error-correcting output codes (context) - on, Analysis et al. - 1997
1
Beyond independence: Conditions for the optimality of the si.. (context) - ftp, cs et al. - 1996
1
Factorial hidden Markov models (context) - on, Analysis et al. - 1996
1
Error-based and entropy-based discretizing of continuous fea.. (context) - Kohavi, Sahami - 1996
1
Learning Bayesian networks with discrete variables from data (context) - at, hss et al. - 1995
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