Andreas L. Prodromidis Salvatore J. Stolfo Department of Computer Science...  Home/Search
Context Related
Links: ACM DBLP | columbia.edu/~andreas/pu...AAAI99.ps.gz 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: columbia.edu/~andr...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: m description length is described in (Quinlan & Rivest 1989). Minimal cost complexity pruning associates a complexity parameter with the number of terminal nodes of a decision tree. It prunes decision trees by minimizing the linear combination of the complexity (size) of the tree and its misclassification cost estimate (error rate). The degree of pruning is controlled by adjusting the weight of the complexity parameter, i.e. an increase of this weight parameter results in heavier pruning.... (Update)
Context of citations to this paper: More
.... describe each of these issues separately and to detail our approaches within the framework of JAM [ Prodromidis, 1997; Prodromidis, Chan, Stolfo, 1999 ] JAM has been used in several experiments dealing with real world learning tasks, such as solving crucial problems in...
Cited by: More
Distributed Data Mining Systems - Prodromidis (1999) (Correct)
Active bibliography (related documents): More All
0.0: MLnet Summer School on Machine Learning and Knowledge.. - Buntine (Correct)
0.0: Cost Complexity Pruning of Ensemble Classifiers - Prodromidis, Stolfo (Correct)
0.0: Cost Complexity-based Pruning of Ensemble Classifiers - Prodromidis, Stolfo (1999) (Correct)
Similar documents based on text: More All
0.2: Distributed Data Mining in Credit Card Fraud Detection - Chan, Fan, Prodromidis.. (1999) (Correct)
0.2: Pruning Meta-Classifiers in a Distributed Data Mining System - Prodromidis (1998) (Correct)
0.2: Sharing Learned Models among Remote Database Partitions by.. - Chan, Stolfo (1996) (Correct)
Related documents from co-citation: More All
2: Pruning meta-classifiers in a distributed data mining system - Prodromidis, Stolfo - 1998
BibTeX entry: (Update)
Prodromidis, A., and Stolfo, S. 1999d. Minimal cost complexity pruning of meta-classifiers. In Proc. Sixteenth National Conference on Artificial Intelligence (AAAI-99). http://citeseer.ist.psu.edu/80096.html More
@inproceedings{ prodromidis99minimal,
author = "Andreas L. Prodromidis and Salvatore J. Stolfo",
title = "Minimal Cost Complexity Pruning of Meta-Classifiers",
booktitle = "{AAAI}/{IAAI}",
pages = "979",
year = "1999",
url = "citeseer.ist.psu.edu/80096.html" }
Citations (may not include all citations):1262 Classification and Regression Trees (context) - Breiman, Friedman et al. - 1984
367 Stacked generalization - Wolpert - 1992
185 Inferring decision trees using the minimum description lengt.. (context) - Quinlan, Rivest - 1989
Documents on the same site (http://www.cs.columbia.edu/~andreas/publications/publications.html): More
Extensible Resource Management For Cluster Computing - Islam, Prodromidis.. (1996) (Correct)
A Comparative Evaluation of Meta-Learning Strategies over.. - Prodromidis, Stolfo (1999) (Correct)
JAM: Java Agents for Meta-Learning over Distributed.. - Stolfo, Prodromidis.. (1997) (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