See this document in CiteSeerX!

Comparing Knowledge-Based Sampling to  (Make Corrections)  
Boosting Martin Scholz University of Dortmund, 44221 Dortmund, Germany,...



  Home/Search   Context   Related

 
View or download:
ai.informatik.uni...scholz_2005c.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ai.informatik.unidor...DOKUMENTE (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Boosting algorithms for classification are based on altering the initial distribution assumed to underly a given example set. The idea of knowledge-based sampling (KBS) is to sample out prior knowledge and previously discovered patterns to achieve that subsequently applied data mining algorithms automatically focus on novel patterns without any need to adjust the base algorithm. This sampling strategy anticipates a user's expectation based on a set of constraints how to adjust the... (Update)

Similar documents (at the sentence level):
5.6%:   Comparing Knowledge-Based Sampling to Boosting - Scholz (2005)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Sampling-Based Sequential Subgroup Mining - Martin Scholz Artificial   (Correct)
0.3:   An Ensemble Classifier for Drifting Concepts - Scholz, Klinkenberg (2005)   (Correct)
0.3:   Boosting Classifiers for Drifting Concepts - Scholz, Klinkenberg (2006)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ scholz-comparing,
  author = "Boosting Martin Scholz",
  title = "Comparing Knowledge-Based Sampling to",
  url = "citeseer.ist.psu.edu/765833.html" }
Citations (may not include all citations):
976   Machine Learning (context) - Mitchell - 1997
696   UCI repository of machine learning databases (context) - Blake, Merz - 1998
273   The Strength of Weak Learnability - Schapire - 1990
262   Data Mining -- Practical Machine Learning Tools and Techniqu.. (context) - Witten, Frank - 2000
236   Additive logistic regression: A statistical view of boosting - Friedman, Hastie et al. - 2000
78   Boosting the Margin: A New Explanation for the E#ectiveness .. (context) - Schapire, Freund et al. - 1998
61   An Algorithm for Multi--relational Discovery of Subgroups - Wrobel
59   A decision--theoretic generalization of online learning and .. (context) - Freund, Schapire - 1997
52   Introduction To Monte Carlo Methods (context) - Mackay - 1998
29   Explora: A Multipattern and Multistrategy Discovery Assistan.. (context) - Klosgen - 1996
26   Boosting as Entropy Projection - Kivinen, Warmuth
18   Rule Evaluation Measures: A Unifying View - Lavrac, Flach et al. - 1999
13   A Flexible Platform for Knowledge Discovery Experiments: YAL.. - Mierswa, Klinkenberg et al. - 2003
6   Incorporating prior knowledge into boosting - Schapire, Rochery et al. - 2002
6   Knowledge-Based Sampling for Subgroup Discovery - Scholz - 2005
6   Sampling-Based Sequential Subgroup Mining - Scholz
2   KDD-Cup 2004: Protein Homology Task (context) - Foussette, Hakenjos et al. - 2004

Documents on the same site (http://www-ai.informatik.uni-dortmund.de/DOKUMENTE):   More
Efficient Kernel Calculation for Multirelational Data - Rüping (2002)   (Correct)
Domain Knowledge and Data Mining Process Decisions - Knobbe, Schipper, Brockhausen (2000)   (Correct)
Text Categorization with Support Vector Machines: Learning with.. - Joachims (1998)   (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