论文信息 - Data Mining at CALD-CMU: Tools, Experiences and Research Directions

Data Mining at CALD-CMU: Tools, Experiences and Research Directions

We describe the data mining problems and solutions that we have encountered in the Center for Automated Learning and Discovery (CALD) at CMU. Speci cally, we describe these settings and their operational characteristics, describe our proposed solutions, list the performance results, and nally outline future research directions.

[1] Jim Zelenka,et al. File server scaling with network-attached secure disks , 1997, SIGMETRICS '97.

[2] Garth A. Gibson. Report of the Working Group on Storage I/O Issues in Large-Scale Computing , 1996 .

[3] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[4] Sebastian Thrun,et al. Learning Maps for Indoor Mobile Robot Navigation. , 1996 .

[5] Mary S. Lee. Cached Suucient Statistics for Eecient Machine Learning with Large Datasets 1. Caching Suucient Statistics , 1997 .

[6] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[7] Heikki Mannila,et al. Multiple Uses of Frequent Sets and Condensed Representations (Extended Abstract) , 1996, KDD.

[8] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[9] Andrew W. Moore,et al. Efficient Locally Weighted Polynomial Regression Predictions , 1997, ICML.

[10] Venky Harinarayan,et al. Implementing Data Cubes E ciently , 1996 .

[11] D. Fox,et al. A Probabilistic Approach for Concurrent Map Acquisition and Localization for Mobile Robots , 1997 .

[12] Christos Faloutsos,et al. Efficiently supporting ad hoc queries in large datasets of time sequences , 1997, SIGMOD '97.