ACM Home Page
Please provide us with feedback. Feedback
Mining high-speed data streams
Full text PdfPdf (206 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Boston, Massachusetts, United States
Pages: 71 - 80  
Year of Publication: 2000
ISBN:1-58113-233-6
Authors
Pedro Domingos  Dept. of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA
Geoff Hulten  Dept. of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
AAAI : Am Assoc for Artifical Intelligence
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 196,   Citation Count: 106
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/347090.347107
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. Breiman, J. H. Ftiedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, Belmont, CA, 1984.
 
2
J. Catett. Megainduction: Machine Learning on Very Large Databases. PhD thesis, Basset Department of Computer Science, University of Sydney, Sydney, AustrMia, 1991.
3
 
4
5
 
6
J. Gratch. Sequential inductive learning. In Proceedings of the Thireeenth National Conference on Artificial fntelligence, pages 779 786, Portland, OR, 1996. AAAI Press.
 
7
W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13 30, 1963.
 
8
 
9
O. Maron and A. Moore. Hoeffding races: Accelerating model selection search for classification and function approximation. In J. D. Cowan, G. Tesauro, and J. Alspector, editors, Advances in Neural fnformation Processing Systems 6. Morgan Kaufmann, San Mateo, CA, 1994.
 
10
 
11
R. G. Miller, Jr. Simultaneous Statistical fnference. Springer, New York, NY, 2nd edition, 1981.
 
12
A. W. Moore and M. S. Lee. Efficient algorithms for minimizing cross validation error. In Proceedings of the Eleventh fnterrtational Conference on Machine Learning, pages 190 198, New Brunswick, NO, 1994. Morgan Kaufmann.
 
13
R. Musick, J. Catlett, and S. Russell. Decision theoretic subsampling for induction on large databases. In Proceedings of the Tenth fnterrtational Conference on Machine Learning, pages 212 219, Amherst, MA, 1993. Morgan Kauflnann.
14
 
15
 
16
J. R. Quinlan and R. M. Cameron-Jones. Oversearching and layered search in empirical learning. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1019 1024, Montreal, Canada, 1995. Morgan Kaufmann.
 
17
 
18
P. Smyth and D. Wolpert. Anytime exploratory data anMysis for massive data sets. In Proceedings of the Third Interrtational Conference on Knowledge Discovery and Data Mining, pages 5&60, Newport Beach, CA, 1997. AAAI Press.
 
19
 
20
 
21
P. E. Utgoff. An improved algorithm for incremental induction of decision trees. In Proceedings of the Eleventh International Conference on Machine Learning, pages 318 325, New Brunswick, NJ, 1994. Morgan Kaufmann.
 
22
G. L Webb. OPUS: An efiqcient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:431 465, 1995.
 
23
A. Wolman, G. Voelker, N. Sharma, N. Cardwell, M. Brown, T. Landray, D. Pinnel, A. KaHin, and H. Levy. Organization-based analysis of Web-object sharing and caching. In Proceedings of the Second USENIX Conference on Interrtet Technologies and Systems, pages 25-36, Boulder, CO, 1999.

CITED BY  106

Collaborative Colleagues:
Pedro Domingos: colleagues
Geoff Hulten: colleagues