Eyal Kushilevitz, Yishay Mansour  Home/Search
Context Related
| cs.technion.ac.il/~eyalk/KM.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.technion.ac.il/~eyalk/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This work gives a polynomial time algorithm for learning decision trees with respect to the uniform distribution. (This algorithm uses membership queries.) The decision tree model that is considered is an extension of the traditional boolean decision tree model that allows linear operations in each node (i.e., summation of a subset of the input variables over GF (2)). This paper shows how to learn in polynomial time any function that can be approximated (in norm L 2 ) by a polynomially sparse... (Update)
Cited by: More
Oracles and Queries that are Sufficient for - Exact Learning Nader (Correct)
On P Versus Np"co-Np For Decision - Trees And Read-Once (Correct)
What's New: Finding Significant Differences in Network Data .. - Cormode, Muthukrishnan (2004) (Correct)
Similar documents (at the sentence level):
5.6%: Learning Boolean Functions - Fourier (Correct)
Active bibliography (related documents): More All
0.2: An O(n^(log log n)) Learning Algorithm for DNF under the Uniform.. - Mansour (1998) (Correct)
0.2: On the Fourier Spectrum of Monotone Functions - Bshouty, Tamon (1996) (Correct)
0.1: Efficient Distribution-free Learning of Probabilistic Concepts - Kearns, Schapire (1993) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: Randomness in Private Computations - Kushilevitz, Mansour (1997) (Correct)
0.2: On Lotteries with Unique Winners - Kushilevitz, Mansour, Rabin (1995) (Correct)
0.2: Lower Bounds for Randomized Mutual Exclusion - Kushilevitz, Mansour, Rabin.. (1993) (Correct)
Related documents from co-citation: More All
39: Communications of the ACM (context) - Valiant, of et al. - 1984
37: Queries and concept learning (context) - Angluin - 1988
29: Exact learning via the monotone theory (context) - Bshouty - 1995
BibTeX entry: (Update)
Eyal Kushilevitz and Yishay Mansour. Learning decision trees using the fourier spectrum. In Proceedings of STOC '91, pages 455--464, may 1991. http://citeseer.ist.psu.edu/kushilevitz91learning.html More
@inproceedings{ kushilevitz91learning,
author = "Eyal Kushilevitz and Yishay Mansour",
title = "Learning decision trees using the {Fourier} spectrum",
pages = "455--464",
year = "1991",
url = "citeseer.ist.psu.edu/kushilevitz91learning.html" }
Citations (may not include all citations):244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
59 Harmonic analysis of polynomial threshold functions (context) - Bruck - 1990
56 The expressive power of voting polynomials - Aspnes, Beigel et al. - 1991
47 Annals of Pure and Applied Logic (context) - Ajtai, -formulae et al. - 1983
42 Learning decision trees from random examples (context) - Ehrenfeucht, Haussler - 1989
19 AC 0 functions and spectral norms (context) - Bruck, Smolensky et al. - 1990
18 A spectral lower bound technique for the size of decision tr.. (context) - Brandman, Hennessy et al. - 1990
13 A technique for upper bounding the spectral norm with applic.. - Bellare - 1992
7 Learning the fourier spectrum of probabilistic lists and tre.. (context) - Aiello, Mihail - 1991
2 Improved learning - Furst, Jackson et al.
1 Simple constructions of almost k-wisw independent random var.. (context) - Alon, Goldreich et al. - 1990
1 The use of Group representation in probability and statistic.. (context) - Diaconis - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.technion.ac.il/~eyalk/pub.html): More
On Learning Visual Concepts and DNF Formulae - Kushilevitz, Roth (1993) (Correct)
A Composition Theorem for Learning Algorithms with.. - Ben-David, Bshouty.. (1997) (Correct)
On Learning Read-k-Satisfy-j DNF - Aizenstein, Blum, Khardon.. (1996) (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