Data Mining Paradigms
暂无分享,去创建一个
[1] Simon Kasif,et al. A System for Induction of Oblique Decision Trees , 1994, J. Artif. Intell. Res..
[2] Wei-Yin Loh,et al. A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms , 2000, Machine Learning.
[3] Haym Hirsh,et al. A Quantitative Study of Small Disjuncts , 2000, AAAI/IAAI.
[4] Wei Zhong Liu,et al. Bias in information-based measures in decision tree induction , 1994, Machine Learning.
[5] Thomas G. Dietterich,et al. An Experimental Comparison of the Nearest-Neighbor and Nearest-Hyperrectangle Algorithms , 1995, Machine Learning.
[6] J. Ross Quinlan,et al. Improved Use of Continuous Attributes in C4.5 , 1996, J. Artif. Intell. Res..
[7] Dimitrios Kalles,et al. Breeding Decision Trees Using Evolutionary Techniques , 2001, ICML.
[8] David W. Aha,et al. Tolerating Noisy, Irrelevant and Novel Attributes in Instance-Based Learning Algorithms , 1992, Int. J. Man Mach. Stud..
[9] Vasant Dhar,et al. Seven Methods for Transforming Corporate Data Into Business Intelligence , 1996 .
[10] John Mingers,et al. An Empirical Comparison of Pruning Methods for Decision Tree Induction , 1989, Machine Learning.
[11] Pat Langley,et al. Elements of Machine Learning , 1995 .
[12] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[13] Usama M. Fayyad,et al. SKICAT: A Machine Learning System for Automated Cataloging of Large Scale Sky Surveys , 1993, ICML.
[14] Robert C. Holte,et al. Concept Learning and the Problem of Small Disjuncts , 1989, IJCAI.
[15] Carlo Zaniolo,et al. CMP: a fast decision tree classifier using multivariate predictions , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[16] Jason Catlett,et al. Overprvning Large Decision Trees , 1991, IJCAI.
[17] Vasant Dhar,et al. Discovering Interesting Patterns for Investment Decision Making with GLOWER ☹—A Genetic Learner Overlaid with Entropy Reduction , 2000, Data Mining and Knowledge Discovery.
[18] Deborah R. Carvalho,et al. A genetic-algorithm for discovering small-disjunct rules in data mining , 2002, Appl. Soft Comput..
[19] Steven Salzberg,et al. Distance Metrics for Instance-Bsed Learning , 1991, ISMIS.
[20] Alex Alves Freitas,et al. Interfacing knowledge discovery algorithms to large database management systems , 1999, Inf. Softw. Technol..
[21] Stefan Wess,et al. Case-Based and Symbolic Classification - A Case Study , 1993, EWCBR.
[22] Foster J. Provost,et al. Small Disjuncts in Action: Learning to Diagnose Errors in the Local Loop of the Telephone Network , 1993, ICML.
[23] Allan P. White,et al. Technical Note: Bias in Information-Based Measures in Decision Tree Induction , 1994, Machine Learning.
[24] Deborah R. Carvalho,et al. A Genetic Algorithm With Sequential Niching For Discovering Small-disjunct Rules , 2002, GECCO.
[25] Ivan Bratko,et al. Trading Accuracy for Simplicity in Decision Trees , 1994, Machine Learning.
[26] Ron Kohavi,et al. Lazy Decision Trees , 1996, AAAI/IAAI, Vol. 1.
[27] Usama M. Fayyad,et al. Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning , 1993, IJCAI.
[28] Deborah R. Carvalho,et al. A Genetic Algorithm-Based Solution for the Problem of Small Disjuncts , 2000, PKDD.
[29] J. Ross Quinlan,et al. Simplifying Decision Trees , 1987, Int. J. Man Mach. Stud..
[30] Sreerama K. Murthy,et al. Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey , 1998, Data Mining and Knowledge Discovery.
[31] Stephen F. Smith,et al. Competition-based induction of decision models from examples , 1993, Machine Learning.
[32] Alex Alves Freitas,et al. Understanding the Crucial Role of Attribute Interaction in Data Mining , 2001, Artificial Intelligence Review.
[33] Usama M. Fayyad,et al. Branching on Attribute Values in Decision Tree Generation , 1994, AAAI.
[34] Donato Malerba,et al. Decision Tree Pruning as a Search in the State Space , 1993, ECML.
[35] Alex A. Freitas,et al. An immunological algorithm for discovering small-disjunct rules in data mining , 2001 .
[36] Vipin Kumar,et al. Parallel Formulations of Decision-Tree Classification Algorithms , 2004, Data Mining and Knowledge Discovery.
[37] Deborah R. Carvalho,et al. A hybrid decision tree/genetic algorithm for coping with the problem of small disjuncts in data mining , 2000, GECCO.
[38] John Mingers,et al. An Empirical Comparison of Selection Measures for Decision-Tree Induction , 1989, Machine Learning.
[39] David W. Aha,et al. Special Issue on Lazy Learning , 1997 .
[40] J. Ross Quinlan,et al. Generating Production Rules from Decision Trees , 1987, IJCAI.
[41] JOHANNES GEHRKE,et al. RainForest—A Framework for Fast Decision Tree Construction of Large Datasets , 1998, Data Mining and Knowledge Discovery.
[42] Cullen Schaffer. Overfitting avoidance as bias , 2004, Machine Learning.
[43] Jadzia Cendrowska,et al. PRISM: An Algorithm for Inducing Modular Rules , 1987, Int. J. Man Mach. Stud..
[44] Simon Kasif,et al. Local Induction of Decision Trees: Towards Interactive Data Mining , 1996, KDD.
[45] Alex Alves Freitas,et al. Mining Very Large Databases with Parallel Processing , 1997, The Kluwer International Series on Advances in Database Systems.
[46] David W. Aha,et al. Simplifying decision trees: A survey , 1997, The Knowledge Engineering Review.
[47] Belur V. Dasarathy,et al. Nearest neighbor (NN) norms: NN pattern classification techniques , 1991 .