Find:

Searching for PHRASE machine learning.

Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
More than 10000 results. Only retrieving 500 documents (System busy - maximum reduced). Retrieving documents... Order: number of citations.

Experiments with a New Boosting Algorithm - Freund, Schapire (1996)   (Correct)   (483 citations)
Machine Learning: Proceedings of the Thirteenth International
of the two methods on a collection of machine-learning benchmarks. In the second set of
www.research.att.com/~schapire/cgi-bin/uncompress-papers/FreundSc96.ps

Reinforcement Learning: A Survey - Leslie Pack Kaelbling, Michael L.. (1996)   (Correct)   (367 citations)
to be accessible to researchers familiar with machine learning. Both the historical basis of the field and
attracted rapidly increasing interest in the machine learning and artificial intelligence communities. Its
Practical issues in temporal difference learning. Machine Learning, 8, 257-277. Tesauro, G. 1994)
www.cs.cmu.edu/~reinf/www/../papers/survey.ps.gz

Wrappers for Feature Subset Selection - Kohavi, John (1997)   (Correct)   (329 citations)
is a ubiquitous problem. In supervised machine learning, an induction algorithm is typically
each in detail. 2.1 The Problem Practical machine learning algorithms, including top-down induction of
robotics.stanford.edu/~ronnyk/wrappers.ps.Z

Irrelevant Features and the Subset Selection Problem - John, Kohavi, Pfleger (1994)   (Correct)   (270 citations)
in 1994, William W. Cohen &Haym Hirsh, eds.Machine Learning: Proceedings of the Eleventh International
and show that the definitions used in the machine learning literature do not adequately partition the
1990. Boolean feature discovery in empirical learning. Machine Learning 5:71-99. Quinlan, J. R. 1986.
www.stanford.edu/~kpfleger/copy/publications/relevance4.ps.gz

Additive Logistic Regression: a Statistical View of Boosting - Friedman, Hastie.. (1998)   (Correct)   (219 citations)
"committee"Boosting was proposed in the machine learning literature (Freund &Schapire 1996) and has
theory (Schapire 1990) has evolved in the machine learning community, initially based on the concepts
www-stat.stanford.edu/reports/friedman/boost.ps.Z

A Probabilistic Approach to Concurrent Mapping and.. - Thrun, Burgard, Fox (1998)   (Correct)   (154 citations)
Machine Learning and Autonomous Robots (joint issue)31/5,
of the Thirteenth International Conference on Machine Learning (pp. 266-274)San Mateo, CA: Morgan
www.cs.cmu.edu/~thrun/papers/thrun.maploc.ps.gz

Mixtures of Probabilistic Principal Component Analysers - Tipping, al. (1998)   (Correct)   (142 citations)
IEEE Transactions on Pattern Analysis and Machine Intelligence 20 (3)281-293. Bregler, C. and S.
IEEE Transactions on Pattern Analysis and Machine Intelligence 16, 550-554. Japkowicz, N.C.
Nonlinear image interpolation using manifold learning. In G. Tesauro, D. S. Touretzky, and T. K. Leen
neural-server.aston.ac.uk/Papers/postscript/NCRG_97_003.ps.Z

An Experimental Comparison of Three Methods for Constructing.. - Dietterich (1998)   (Correct)   (130 citations)
Machine Learning, 1-22 (1998) c fl 1998 Kluwer Academic
through learning multiple descriptions. Machine Learning, 24 (3)173-202. Bauer, E.Kohavi, R.
ftp.cs.orst.edu/pub/tgd/papers/tr-randomized-c4.ps.gz

Factorial Hidden Markov Models - Zoubin Ghahramani, Michael I. Jordan (1997)   (Correct)   (128 citations)
Machine Learning, 29, 245-275 (1997) c fl 1997 Kluwer
research in both the graphical model and machine learning communities (e.g. Heckerman, 1995 Stolcke &
ftp.cs.toronto.edu/pub/zoubin/fhmmML.ps.gz

A System for Induction of Oblique Decision Trees - Murthy, Kasif, Salzberg (1994)   (Correct)   (120 citations)
challenge and opportunity for automated machine learning techniques. The advent of major scientific
one of the central techniques of experimental machine learning. Many variants of decision tree (DT)
Sigma Press, England. Nilsson, N. 1990)Learning Machines. Morgan Kaufmann, San Mateo, CA. Odewahn,
www.cs.jhu.edu/~murthy/jair94.ps.Z

Text Classification from Labeled and Unlabeled.. - Nigam, Mccallum.. (1999)   (Correct)   (119 citations)
Machine Learning, 1-34 (c fl Kluwer Academic
(1988, page 29)Two recent studies in the machine learning literature have used EM to combine labeled
www.cs.cmu.edu/~knigam/papers/emcat-mlj99.ps.gz

Greedy Attribute Selection - Caruana, Freitag (1994)   (Correct)   (114 citations)
RELIEF on the two tasks. 1 INTRODUCTION As machine learning is applied to real-world tasks,
in Proceedings of the European Conference on Machine Learning, 1994. 8] G. John, R. Khavi, and K.
www.cs.cmu.edu/~dayne/ps/ml94.ps.Z

Toward Optimal Feature Selection - Koller, Sahami (1996)   (Correct)   (111 citations)
the issue of feature subset selection in machine learning. As defined by (John, Kohavi, Pfleger
not significantly correlated with the topic machine-learning. Therefore, if we were to run our algorithm
robotics.stanford.edu/people/daphne/papers/ml96.ps

Learning to Extract Symbolic Knowledge from the World.. - Craven, DiPasquo.. (1998)   (Correct)   (111 citations)
paper describes our general approach, several machine learning algorithms for this task, and promising
develop such a knowledge base by (1) using machine learning to create information extraction methods for
www.cs.cmu.edu/~knigam/papers/webkb-tr98.ps.gz

On the Optimality of the Simple Bayesian Classifier under.. - Domingos, Pazzani (1997)   (Correct)   (107 citations)
there has been a gradual recognition among machine learning researchers that the Bayesian classifier can
results on the Bayesian classifier in the machine learning literature, and recent attempts to extend
www.ics.uci.edu/~pedrod/mlj97.ps.gz

Data Mining: An Overview from a Database Perspective - Chen, Han, Yu (1996)   (Correct)   (104 citations)
a key research topic in database systems and machine learning, and by many industrial companies as an
www.informatik.uni-bonn.de/III/lehre/vorlesungen/DataMining/WS96/literatur/chen97:data.ps.gz

The Parti-game Algorithm for Variable Resolution.. - Moore, Atkeson (1995)   (Correct)   (103 citations)
Machine Learning, 1-36 (To appear) c fl To appear Kluwer
Stochastic Domains: Preliminary Results. In Machine Learning: Proceedings of the Tenth International
ftp.cc.gatech.edu/pub/people/cga/partigame.ps.gz

SLIQ: A Fast Scalable Classifier for Data Mining - Mehta, Agrawal, Rissanen (1996)   (Correct)   (102 citations)
of fact, the largest dataset in the Irvine Machine Learning repositary is only 700KB with 20000
Dec. 1993. 2. J. Catlett. Megainduction: Machine Learning on Very Large Databases. PhD thesis,
www.almaden.ibm.com/u/ragrawal/papers/edbt96_sliq.ps

First 20 documents  Next 20

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP

CiteSeer.IST - Copyright Penn State and NEC