Richard Nock, Tapio Elomaa, Matti Kääriäinen  Home/Search
Context
Related
| univag.fr/~rnock/Artic...ipl03nek.pdf 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: univag.fr/~rnock/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we prove under a plausible complexity hypothesis that Reduced Error Pruning of branching programs is hard to approximate within log n,forevery#>0, where n is the number of description variables, a measure of the problem's complexity. The result holds under the assumption that NP problems do not admit deterministic, slightly superpolynomial time algorithms: NP |I |) ). This improves on a previous result that only had a small constant inapproximability ratio, and puts a... (Update)
Active bibliography (related documents): More All
0.4: On Learning Branching Programs and Small Depth Circuits - Bergadano, Bshouty.. (1997) (Correct)
0.4: Boosting using Branching Programs - Mansour, McAllester (2000) (Correct)
0.3: Rademacher Penalization over Decision Tree Prunings - Kääriäinen, Elomaa (2003) (Correct)
Similar documents based on text: More All
0.2: The Difficulty of Reduced Error Pruning of Leveled Branching .. - Elomaa, Kääriäinen (2002) (Correct)
0.2: Incremental Reduced Error Pruning - Fürnkranz, Widmer (1994) (Correct)
0.1: Reduced-Error Pruning With Significance Tests - Frank, Witten (1998) (Correct)
BibTeX entry: (Update)
@misc{ nock-reduced,
author = "Richard Nock and Tapio Elomaa and Matti Kääriäinen",
title = "Reduced Error Pruning of branching programs cannot be approximated to within
a logarithmic factor",
url = "citeseer.ist.psu.edu/nock03reduced.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
2177 Programs for Machine Learning (context) - Quinlan - 1993
1262 Classification and Regression Trees (context) - Breiman, Friedman et al. - 1984
248 An Introduction to Computational Learning Theory (context) - Kearns, Vazirani - 1994
226 for approximating set cover (context) - Feige, of - 1998
162 Simplifying decision trees - Quinlan - 1987
115 Approximating the value of two prover proof systems (context) - Feige, Goemans - 1995
11 bottom-up decision tree pruning algorithm with near-optimal .. (context) - Kearns, Mansour et al. - 1998
5 On learning width two branching programs - Bshouty, Tamon et al. - 1996
5 Learning -branching programs with queries (context) - Raghavan, Wilkins - 1993
5 Some optimal inapproximability results (context) - Hstad - 2001
4 Boosting using branching programs - Mansour, McAllester - 2002
4 An analysis of reduced error pruning - Elomaa, Kriinen - 2001
1 The difficulty of reduced error pruning of leveled branching.. - Elomaa, Kriinen - 2003
Documents on the same site (http://www.univ-ag.fr/~rnock/): More
Grouping with Bias Revisited - Richard Nock Dsi (Correct)
Fast and Reliable Color Region Merging inspired by Decision Tree.. - Nock (2001) (Correct)
A Simple Locally Adaptive Nearest Neighbor Rule With Application .. - Nock, al. (2003) (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