Shinichi Morishita  Home/Search
Context Related
| gi.k.utokyo.ac.jp/~moris...dsfinal.ps 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: gi.k.utokyo.ac.jp/~...paperlist (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper sheds light on a strong connection between AdaBoost and several optimization algorithms for data mining. AdaBoost has been the subject of much interests as an effective methodology for classification task. AdaBoost repeatedly generates one hypothesis in each round, and finally it is able to make a highly accurate prediction by taking a weighted majority vote on the resulting hypotheses. Freund and Schapire have remarked that the use of simple hypotheses such as singletest decision... (Update)
Cited by: More
KDD Cup 2001 Report - Jie Cheng Global (2001) (Correct)
Active bibliography (related documents): More All
0.5: Scaling up a Boosting-Based Learner via Adaptive Sampling - Domingo, Watanabe (2000) (Correct)
0.3: Identifying Most Predictive Items - Keim, Wawryniuk (Correct)
0.3: Traversing Itemset Lattices with Statistical Metric Pruning - Morishita, Sese (2000) (Correct)
Similar documents based on text: More All
0.5: On Classification and Regression - Morishita (1998) (Correct)
0.4: A Short Introduction to Boosting - Freund, Schapire (1999) (Correct)
0.4: A Brief Introduction to Boosting - Schapire (1999) (Correct)
BibTeX entry: (Update)
Morishita, S. Computing optimal hypotheses efficiently for boosting. Springer LNAI: Progresses in Discovery Science, in press. http://citeseer.ist.psu.edu/492998.html More
@inproceedings{ morishita02computing,
author = "Shinichi Morishita",
title = "Computing Optimal Hypotheses Efficiently for Boosting",
booktitle = "Progress in Discovery Science",
pages = "471--481",
year = "2002",
url = "citeseer.ist.psu.edu/492998.html" }
Citations (may not include all citations):921 Mining association rules between sets of items in large data.. - Agrawal, Imielinski et al.
509 A decision-theoretic generalization of on-line learning and .. - Freund, Schapire - 1997
500 Experiments with a new boosting algorithm - Freund, Schapire - 1996
273 The strength of weak learnability - Schapire - 1989
208 Fast algorithms for mining association rules in large databa.. (context) - Agrawal, Srikant - 1994
180 Boosting a weak learning algorithm by majority - Freund - 1995
78 Programming pearls (context) - Bentley - 1984
40 An empirical comparison of voting classication algorithms: B.. (context) - Bauer, Kohavi - 1999
24 On approximating rectangle tiling and packing - Khanna, Muthukrishnan et al. - 1998
15 Traversing itemset lattices with statistical metric pruning - Morishita, Sese - 2000
13 Mining optimized gain rules for numeric attributes - Brin, Rastogi et al.
13 Computing optimized rectilinear regions for association rule.. (context) - Yoda, Fukuda et al. - 1997
5 On classication and regression (context) - Morishita - 1998
4 Data mining using twodimensional optimized accociation rules.. (context) - Fukuda, Morimoto et al.
2 A modication of adaboost: A preliminary report - Domingo, Watanabe - 1999
1 Algorithms for the maxium subarray problem based on matrix m.. (context) - Tamaki, Tokuyama - 1998
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