Speeding up Knowledge Discovery in Large Relational Databases by Means of a New Discretization Algorithm
暂无分享,去创建一个
[1] Jason Catlett,et al. On Changing Continuous Attributes into Ordered Discrete Attributes , 1991, EWSL.
[2] Alex A. Freitas,et al. Using SQL primitives and parallel DB servers to speed up knowledge discovery in large relational databases , 1996 .
[3] Stefan Wrobel,et al. Machine Learning: ECML-95 , 1995, Lecture Notes in Computer Science.
[4] Jason Catlett,et al. Megainduction: A Test Flight , 1991, ML.
[5] Michael V. Mannino,et al. Statistical profile estimation in database systems , 1988, CSUR.
[6] Salvatore J. Stolfo,et al. A parallel and distributed environment for database rule processing: open problems and future directions , 1995 .
[7] Marco Richeldi,et al. Class-Driven Statistical Discretization of Continuous Attributes (Extended Abstract) , 1995, ECML.
[8] Padhraic Smyth,et al. Rule Induction Using Information Theory , 1991, Knowledge Discovery in Databases.
[9] William Frawley,et al. Knowledge Discovery in Databases , 1991 .
[10] Randy Kerber,et al. ChiMerge: Discretization of Numeric Attributes , 1992, AAAI.
[11] David J. Spiegelhalter,et al. Machine Learning, Neural and Statistical Classification , 2009 .
[12] Georgios Paliouras,et al. The Effect of Numeric Features on the Scalability of Inductive Learning Programs , 1995, ECML.
[13] Cullen Schaffer,et al. A Conservation Law for Generalization Performance , 1994, ICML.
[14] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .