ACM Home Page
Please provide us with feedback. Feedback
Efficient progressive sampling
Full text PdfPdf (1.21 MB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
San Diego, California, United States
Pages: 23 - 32  
Year of Publication: 1999
ISBN:1-58113-143-7
Authors
Foster Provost  Bell Atlantic Science and Technology, 500 Westchester Avenue, White Plains, New York
David Jensen  Computer Science Department, University of Massachusetts, Amherst, MA
Tim Oates  Computer Science Department, University of Massachusetts, Amherst, MA
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): 19,   Downloads (12 Months): 66,   Citation Count: 56
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/312129.312188
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
 
2
CATLETT, J. Megainduction: A test flight. In Proceedings of the Eighth International Workshop on Machine Learning (1991), Morgan Kaufmann, pp. 596-599.
 
3
CATLETT, J. Megainduction: Machine learning on very large databases. PhD thesis, School of Computer Science, University of Technology, Sydney, Australia, 1991.
 
4
FREY, L. J., AND FISHER, D. H. Modeling decision tree performance with the power law. In Proceedings of the Seventh International Workshop on Artificial Intelligence and Statistics (1999), D. Heckerman and J. Whittaker, Eds., San Francisco, CA: Morgan Kaufmann.
 
5
F/JRNKRANZ, J. Integrative windowing. Journal of Artificial Intelligence Research 8 (1998), 129-164.
 
6
HARRIS-JONES, C., AND HAINES, T. L. Sample size and misclassification: Is more always better? Working Paper AMSCAT-WP-97-118, AMS Center for Advanced Technologies, 1997.
 
7
 
8
JOHN, G., AND LANGLEY, P. Static versus dynamic sampling for data mining. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (1996), AAAI Press, pp. 367-370.
 
9
 
10
MERz, C. J., AND MURPHY, P. M. UCI repository of machine learning databases, http-// www. ics. uci. edu/~mlearn/MLRepository, html, 1997.
 
11
MUSICK, R., CATLETT, J., AND RUSSELL, S. Decision theoretic subsampling for induction on large databases. In Proceedings of the Tenth International Conference on Machine Learning (San Mateo, CA, 1993), Morgan Kaufmann, pp. 212-219.
 
12
 
13
OATES, T., AND JENSEN, D. Large data sets lead to overly complex models: an explanation and a solution. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-99) (1998), R. Agrawal and P. Stolorz, Eds., Menlo Park, CA: AAAI Press, pp. 294-298.
 
14
 
15
PROVOST, F. J. Iterative weakening: Optimal and near-optimal policies for the selection of search bias. In Proceedings of the Eleventh National Conference on Artificial Intelligence (749-755, 1993), AAAI Press, pp. Menlo Park, CA.
 
16
QUINLAN, J. Learning efficient classification procedures and their application to chess endgames. In Machine Learning: An AI approach, R. Michalski, C. J., and T. Mitchell, Eds. Morgan Kaufmann., Los Altos, CA, 1983.
 
17
18
 
19
WATKIN, T., RAU, A., AND BIEHL, M. The statistical mechanics of learning a rule. Reviews of Modern Physics 65 (1993), 499-556.

CITED BY  56

Collaborative Colleagues:
Foster Provost: colleagues
David Jensen: colleagues
Tim Oates: colleagues