Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-treshold algorithm. Machine Learning, 2:285--318, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Learning in the Presence of Finitely or Infinitely.. - Blum, Hellerstein.. (1995) (19 citations) Self-citation (Littlestone) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2:285--318, 1988.
Adaptive Information Filtering: Learning Drifting Concepts - Ralf Klinkenberg And (Correct)
No context found.
Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-treshold algorithm. Machine Learning, 2:285--318, 1988.
Oracles and Queries that are Sufficient for - Exact Learning Nader (Correct)
No context found.
Nick Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm. Machine Learning, 2, pages 285--318, 1988.
Anytime Algorithm for Feature Selection - Mark Last Abraham (Correct)
No context found.
N. Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm, Machine Learning, no. 2, pp. 285-318, 1988.
Interpolating Arithmetic Read-Once Formulas - In Parallel Nader (Correct)
No context found.
N. LITTLESTONE, Learning quickly when irrelevant attributes abound: A new linear threshold algorithm, Mach. Learning, 2 (1988), pp. 285--318.
Interpolating Arithmetic Read-Once Formulas - In Parallel Nader (Correct)
No context found.
N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear Threshold Algorithm, Machine Learning, 2(4), pp. 285-- 318, 1988.
Journal of Machine Learning Research 7 (2006) 1205--1230 .. - For Linear.. (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2(4):285--318, 1988.
Toward Attribute Efficient Learning of Decision Lists and.. - Klivans, Servedio (2006) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2:285--318, 1988.
Kernels as Features: On Kernels, Margins, and.. - Balcan, Blum, Vempala (2004) (Correct)
No context found.
N. Littlestone. "Learning Quickly when Irrelevant Attributes Abound: A New Linear-threshold Algorithm". Machine Learning, Volume 2, Issue 4, pp. 285--318, 1988.
Fast Learning of k-Term DNF Formulas with Queries - Avrim Blum Carnegie (1992) (3 citations) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285--318, 1988.
Merl A Mitsubishi Electric Research Laboratory - Http Www Merl (1996) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285#318, 1988.
Covering with Ellipses - Efrat, Hoffmann, Knauer, Kriegel.. (2001) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. In Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., pages 68-77, 1987.
Author Identification on the Large Scale - Madigan, Genkin, Lewis, Argamon, .. (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285318, 1988.
Mapping Maintenance for Data Integration Systems - McCann, AlShebli, Le.. (2005) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound. In Machine Learning 2, 1987.
Multi-level Boundary Classification for Information - Extraction Aidan Finn (2004) (Correct)
No context found.
Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4):285--318, 1988.
Improving sequence segmentation learning by predicting trigrams - van den Bosch, al. (2005) (Correct)
No context found.
N. Littlestone. 1988. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285--318.
Many-Layered Learning - Utgoff, Stracuzzi (2002) (1 citation) (Correct)
No context found.
Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285-318.
Adaptive Information Filtering: Learning Drifting Concepts - Klinkenberg, Renz (1998) (Correct)
No context found.
Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-treshold algorithm. Machine Learning, 2:285--318, 1988.
Data-dependencies and Learning in Artificial Systems - GopalaKrishna (Correct)
No context found.
Littlestone, N. (1987). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2.
Combining Winnow and Orthogonal Sparse Bigrams for.. - Siefkes, Assis.. (2004) (1 citation) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2:285--318, 1988.
Applying Learning Algorithms to Preference Elicitation - Lahaie, Parkes (2004) (4 citations) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285--318, 1988.
Using Neural Network to Weight the Partial - Rules Application To (Correct)
No context found.
Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning 2 (1988) 285--318
Applying Learning Algorithms to Preference Elicitation in.. - Lahaie, Parkes (2004) (4 citations) (Correct)
No context found.
Nickolas Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2:285--318, 1988.
Improving Multiclass ILP by Combining Partial - Rules With Winnow (2004) (Correct)
No context found.
Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning 2 (1988) 285--318
Learning Unions of Rectangles with Queries - Chen, Homer (1993) (2 citations) (Correct)
No context found.
N. Littlestone, "Learning quickly when irrelevant attributes abound: a new linear threshold algorithm", Machine Learning, 2, 1987, pages 285-318.
Predicting Customer Shopping Lists from Point-of-Sale.. - Cumby, Fano, Ghani, Krema (2003) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285--318, 1988.
Reinforcement Learning by Policy Search - Peshkin (2001) (7 citations) (Correct)
No context found.
Nick Littlestone, Learning quickly when irrelevant attributes abound: A new linear threshold algorithm, Machine Learning 2 (1988), no. 4, 245-318.
Memory-Based Weighted-Majority Prediction For Recommender Systems - Delgado, Ishii (1999) (2 citations) (Correct)
No context found.
Littlestone, N. Learning quickly when irrelevant attributes abound A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
Multi-classification of Patent Applications with Winnow - Koster, Seutter, Beney (2003) (Correct)
No context found.
N. Littlestone (1988), Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, pp. 285-318.
Feature Selection and Classifier Ensembles: A Study on.. - Yu (2003) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285--318, 1987. 16
Speeding Up Inferences Using Relevance - Reasoning Formalism And (Correct)
No context found.
Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2:285--318, 1988.
Multi-classification of Patent Applications with Winnow - Koster, Seutter, Beney (2003) (Correct)
No context found.
N. Littlestone (1988), Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, pp. 285-318.
Testing Juntas - Eldar Fischer Guy (2002) (4 citations) (Correct)
No context found.
Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285, 1987.
Dynamic Weighted Majority: A New Ensemble Method for Tracking .. - Kolter, Maloof (2003) (2 citations) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285--318, 1988.
Authentic Emotion Detection in Real-Time Video - Yafei Sun Nicu (2004) (Correct)
No context found.
Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning 10 (1993) 57--78
A General Lower Bound on the Number - Of Examples Needed (Correct)
No context found.
Littlestone, N., "Learning quickly when irrelevant attributes abound: a new linear threshold algorithm", Machine Learning 2(4), 1988, pp. 245-318.
Online Learning with Kernels - Kivinen, Smola, Williamson (2002) (5 citations) (Correct)
No context found.
N. Littlestone, "Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm," Machine Learning, vol. 2, pp. 285--318, 1988.
New Degree Bounds for Polynomial Threshold Functions - O'Donnell, Servedio (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
Bounds on Sample Size for Policy Evaluation in Markov.. - Peshkin, Mukherjee (2001) (1 citation) (Correct)
No context found.
Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear threshold algorithm. Machine Learning, 2(4):245--318, 1988.
Large Margin Classification for Moving Targets - Kivinen, Smola, Williamson (2001) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine , 2(4):285--318, 1988.
A Flexible Learning System for Wrapping Tables and Lists.. - Cohen, Hurst, Jensen (2002) (16 citations) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4), 1988.
Multi-level Boundary Classification for Information Extraction - Finn, Kushmerick (2004) (Correct)
No context found.
Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4):285--318, 1988.
Exploiting Dictionaries in Named Entity Extraction: Combining.. - Cohen, al. (2004) (2 citations) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4), 1988.
Fast Feature Selection from Microarray Expression Data via.. - Gentile (2003) (Correct)
No context found.
Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2, 285--318.
Testing Juntas - Eldar Fischer Guy (2002) (4 citations) (Correct)
No context found.
Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285, 1987.
Approximation Algorithms for Array Partitioning Problems - Muthukrishnan Torsten Suel (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2(4), 285--318, 1988.
Learning with Feature Description Logics - Chad Cumby And (2002) (1 citation) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285--318, 1988.
E-SL@VE - An Incremental Approach to Automated, Content-Based.. - Rudolfs (2002) (Correct)
No context found.
Littlestone N. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
Learning Multivalued Multithreshold Functions - Department (Correct)
No context found.
N. Littlestone, Learning quickly when irrelevant attributes abound: a new linear threshold learning algorithm. Machine Learning, 2(4), 1988: 245--318.
Covering with Ellipses - Efrat, Hoffmann, Knauer, Kriegel.. (2001) (Correct)
No context found.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. In Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., pages 68-77, 1987.
First 50 documents Next 50
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