Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets
暂无分享,去创建一个
[1] J. Ross Quinlan,et al. Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .
[2] A. Guttmma,et al. R-trees: a dynamic index structure for spatial searching , 1984 .
[3] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[4] Nick Roussopoulos,et al. Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.
[5] Stephen M. Omohundro,et al. Efficient Algorithms with Neural Network Behavior , 1987, Complex Syst..
[6] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[7] Ron Rymon. An SE-tree based Characterization of the Induction Problem , 1993, ICML.
[8] Ron Kohavi,et al. Irrelevant Features and the Subset Selection Problem , 1994, ICML.
[9] Ron Kohavi,et al. The Power of Decision Tables , 1995, ECML.
[10] Ramasamy Uthurusamy,et al. Data mining and knowledge discovery in databases , 1996, CACM.
[11] Ron Kohavi,et al. Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid , 1996, KDD.
[12] Venky Harinarayan,et al. Implementing Data Cubes E ciently , 1996 .
[13] Nir Friedman,et al. On the Sample Complexity of Learning Bayesian Networks , 1996, UAI.
[14] Heikki Mannila,et al. Multiple Uses of Frequent Sets and Condensed Representations (Extended Abstract) , 1996, KDD.
[15] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[16] Jeffrey D. Ullman,et al. Implementing data cubes efficiently , 1996, SIGMOD '96.
[17] Eduardo Sontag,et al. Sample Complexity for Learning , 1996 .
[18] George H. John,et al. SIPping from the Data Firehose , 1997, KDD.
[19] Andrew W. Moore,et al. Efficient Locally Weighted Polynomial Regression Predictions , 1997, ICML.