Learning from Infinite Data in Finite Time
暂无分享,去创建一个
[1] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[2] Geoff Hulten,et al. A General Method for Scaling Up Machine Learning Algorithms and its Application to Clustering , 2001, ICML.
[3] Alec Wolman,et al. Organization-Based Analysis of Web-Object Sharing and Caching , 1999, USENIX Symposium on Internet Technologies and Systems.
[4] Bo Thiesson,et al. The Learning Curve Method Applied to Clustering , 2001, AISTATS.
[5] Geoff Hulten,et al. Mining high-speed data streams , 2000, KDD '00.
[6] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[7] Raghu Ramakrishnan,et al. Proceedings : KDD 2000 : the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 20-23, 2000, Boston, MA, USA , 2000 .
[8] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.