暂无分享,去创建一个
[1] Stephen M. Omohundro,et al. Bumptrees for Efficient Function, Constraint and Classification Learning , 1990, NIPS.
[2] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[3] Hanan Samet,et al. Efficient regular data structures and algorithms for location and proximity problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[4] Andrew W. Moore,et al. Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets , 1998, J. Artif. Intell. Res..
[5] Jeffrey D. Ullman,et al. Implementing data cubes efficiently , 1996, SIGMOD '96.
[6] Andrew W. Moore,et al. Accelerating exact k-means algorithms with geometric reasoning , 1999, KDD '99.
[7] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1976, TOMS.
[8] Andrew W. Moore,et al. Efficient Locally Weighted Polynomial Regression Predictions , 1997, ICML.
[9] Jeffrey K. Uhlmann,et al. Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..
[10] V. Rich. Personal communication , 1989, Nature.
[11] Andrew W. Moore,et al. X-means: Extending K-means with Efficient Estimation of the Number of Clusters , 2000, ICML.
[12] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[13] Andrew W. Moore,et al. ADtrees for Fast Counting and for Fast Learning of Association Rules , 1998, KDD.
[14] Andrew W. Moore,et al. Multiresolution Instance-Based Learning , 1995, IJCAI.