Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 10 (1993), S. 153-178 
    ISSN: 0885-6125
    Keywords: Overfitting avoidance ; decision tree pruning ; inductive bias
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Strategies for increasing predictive accuracy through selective pruning have been widely adopted by researchers in decision tree induction. It is easy to get the impression from research reports that there are statistical reasons for believing that these overfitting avoidance strategies do increase accuracy and that, as a research community, we are making progress toward developing powerful, general methods for guarding against overfitting in inducing decision trees. In fact, any overfitting avoidance strategy amounts to a form of bias and, as such, may degrade performance instead of improving it. If pruning methods have often proven successful in empirical tests, this is due, not to the methods, but to the choice of test problems. As examples in this article illustrate, overfitting avoidance strategies are not better or worse, but only more or less appropriate to specific application domains. We are not—and cannot be—making progress toward methods both powerful and general.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 12 (1993), S. 167-183 
    ISSN: 0885-6125
    Keywords: Empirical discovery ; function finding ; scientific discovery
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This article reports the results of a study of domain-independent function finding based on a collection of several hundred real scientific data sets. Prior studies have introduced the controversial idea of discovering functional relatonships of interest to scientists directly from the data they collect. The evidence presented here supports the view that this is sometimes possible, but it also suggests how often purely data-driven discovery is not possible and how much more difficult it may be than has often been assumed. Experience with sampled examples of real scientific data suggests as well that emphasis on search in prior studies may have been misplaced. For the function-finding problems studied here, scientists typically propose only a handful of different functional relationships. The difficulty is not in searching through a large space of relationships but in evaluating a few common ones to determine if they are likely to be of scientific interest.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 10 (1993), S. 153-178 
    ISSN: 0885-6125
    Keywords: Overfitting avoidance ; decision tree pruning ; inductive bias
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Strategies for increasing predictive accuracy through selective pruning have been widely adopted by researchers in decision tree induction. It is easy to get the impression from research reports that there are statistical reasons for believing that theseoverfitting avoidance strategies do increase accuracy and that, as a research community, we are making progress toward developing powerful, general methods for guarding against overfitting in inducing decision trees. In fact, any overfitting avoidance strategy amounts to a form of bias and, as such, may degrade performance instead of improving it. If pruning methods have often proven successful in empirical tests, this is due, not to the methods, but to the choice of test problems. As examples in this article illustrate, overfitting avoidance strategies are not better or worse, but only more or less appropriate to specific application domains. We are not—and cannot be—making progress toward methods both powerful and general.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 13 (1993), S. 135-143 
    ISSN: 0885-6125
    Keywords: Cross-validation ; classification ; decision trees ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract If we lack relevant problem-specific knowledge, cross-validation methods may be used to select a classification method empirically. We examine this idea here to show in what senses cross-validation does and does not solve the selection problem. As illustrated empirically, cross-validation may lead to higher average performance than application of any single classification strategy, and it also cuts the risk of poor performance. On the other hand, cross-validation is no more or less a form of bias than simpler strategies, and applying it appropriately ultimately depends in the same way on prior knowledge. In fact, cross-validation may be seen as a way of applying partial information about the applicability of alternative classification strategies.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 13 (1993), S. 135-143 
    ISSN: 0885-6125
    Keywords: Cross-validation ; classification ; decision trees ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract If we lack relevant problem-specific knowledge, cross-validation methods may be used to select a classification method empirically. We examine this idea here to show in what senses cross-validation does and does not solve the selection problem. As illustrated empirically, cross-validation may lead to higher average performance than application of any single classification strategy, and it also cuts the risk of poor performance. On the other hand, cross-validation is no more or less a form of bias than simpler strategies, and applying it appropriately ultimately depends in the same way on prior knowledge. In fact, cross-validation may be seen as a way of applying partial information about the applicability of alternative classification strategies.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 12 (1993), S. 167-183 
    ISSN: 0885-6125
    Keywords: Empirical discovery ; function finding ; scientific discovery
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This article reports the results of a study of domain-independent function finding based on a collection of several hundred real scientific data sets. Prior studies have introduced the controversial idea of discovering functional relationships of interest to scientists directly from the data they collect. The evidence presented here supports the view that this is sometimes possible, but it also suggests how often purely data-driven discovery is not possible and how much more difficult it may be than has often been assumed. Experience with sampled examples of real scientific data suggests as well that emphasis on search in prior studies may have been misplaced. For the function-finding problems studied here, scientists typically propose only a handful of different functional relationships. The difficulty is not in searching through a large space of relationships but in evaluating a few common ones to determine if they are likely to be of scientific interest.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Book
    Book
    Englewood Cliffs, NJ :Prentice-Hall,
    Title: Principles of computer science
    Author: Schaffer, Cullen
    Publisher: Englewood Cliffs, NJ :Prentice-Hall,
    Year of publication: 1988
    Pages: 413 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...