Noise-Tolerant Windowing
暂无分享,去创建一个
[1] CategorizationYiming YangSection. Sampling Strategies and Learning Eeciency in Text Categorization , 1996 .
[2] Yiming Yang. Sampling Strategies and Learning Efficiency in Text Categorization , 1996 .
[3] Jason Catlett,et al. Peepholing: Choosing Attributes Efficiently for Megainduction , 1992, ML.
[4] J. Ross Quinlan,et al. Simplifying decision trees , 1987, Int. J. Hum. Comput. Stud..
[5] Jason Catlett,et al. Megainduction: A Test Flight , 1991, ML.
[6] Pat Langley,et al. Static Versus Dynamic Sampling for Data Mining , 1996, KDD.
[7] Pedro M. Domingos. Efficient Specific-to-General Rule Induction , 1996, KDD.
[8] William W. Cohen. Fast Effective Rule Induction , 1995, ICML.
[9] Johannes F Urnkranz. More Eecient Windowing , 1997 .
[10] J. Ross Quinlan,et al. Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .
[11] Hannu Toivonen,et al. Sampling Large Databases for Association Rules , 1996, VLDB.
[12] Johannes Fürnkranz,et al. Incremental Reduced Error Pruning , 1994, ICML.
[13] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[14] Heikki Mannila,et al. The power of sampling in knowledge discovery , 1994, PODS '94.
[15] Padhraic Smyth,et al. From Data Mining to Knowledge Discovery in Databases , 1996, AI Mag..
[16] Johannes Fürnkranz,et al. More Efficient Windowing , 1997, AAAI/IAAI.
[17] David D. Lewis,et al. Heterogeneous Uncertainty Sampling for Supervised Learning , 1994, ICML.
[18] Jason Catlett,et al. Experiments on the Costs and Benefits of Windowing in ID3 , 1988, ML.
[19] William W. Cohen. Fast Eeective Rule Induction , 1995 .