Overfitting and undercomputing in machine learning

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Overfitting and undercomputing in machine learning

Full text

Pdf (176 KB)

Source

ACM Computing Surveys (CSUR) archive
Volume 27 , Issue 3 (September 1995) table of contents

Pages: 326 - 327

Year of Publication: 1995

ISSN:0360-0300

Author

Tom Dietterich

Oregon State Univ., Corvallis

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 77, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/212094.212114 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	Avrim Blum , Ronald L. Rivest, Training a 3-node neural network in NP-complete, Advances in neural information processing systems 1, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1989
	2	Michael Kearns , Yishay Mansour , Andrew Y. Ng , Dana Ron, An experimental and theoretical comparison of model selection methods, Proceedings of the eighth annual conference on Computational learning theory, p.21-30, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225301]
	3	QUINLAN~ J. R. AND CAMERON-JONES, R.M. 1995. Oversearching and layered search in empirical learning. In Procee&ngs of lJCAI-95.
	4	J. R. Quinlan , R. L. Rivest, Inferring decision trees using the minimum description length principle, Information and Computation, v.80 n.3, p.227-248, Mar. 1989 [doi>10.1016/0890-5401(89)90010-2]
	5	WEIGEND, A. 1994. On overfitting and the effective number of hidden units. In Proceedings of the 19.93 Connectionist Models, Summer Schoo{, P. Smolensky, D. S. Touretzky, J. L. Elman, and A S. Weigend, Eds., Lawrence Erlbaum Associates, Hillsdale, NJ, 335-342.

CITED BY 11

	Pedro Domingos, Machine learning, Handbook of data mining and knowledge discovery, Oxford University Press, Inc., New York, NY, 2002
	David D. Jensen, Knowledge evaluation: statistical evaluations, Handbook of data mining and knowledge discovery, Oxford University Press, Inc., New York, NY, 2002
	Tomoya Takamitsu , Takao Miura , Isamu Shioya, Decision trees using class hierarchy, Design and application of hybrid intelligent systems, IOS Press, Amsterdam, The Netherlands, 2003
	Pedro Domingos , Geoff Hulten, Mining high-speed data streams, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.71-80, August 20-23, 2000, Boston, Massachusetts, United States
	Takao Miura , Isamu Shioya, Assessment by belief, Proceedings of the 12th Australasian database conference, p.131-137, January 29-February 01, 2001, Queensland, Australia
	Aslı Çelikyılmaz , I. Burhan Türkşen, Fuzzy functions with support vector machines, Information Sciences: an International Journal, v.177 n.23, p.5163-5177, December, 2007
	David D. Jensen , Paul R. Cohen, Multiple Comparisons in Induction Algorithms, Machine Learning, v.38 n.3, p.309-338, March 2000
	Sergio Bermejo , Joan Cabestany, Local Averaging of Ensembles of LVQ-Based Nearest Neighbor Classifiers, Applied Intelligence, v.20 n.1, p.47-58, January-February 2004
	T. O. Bonates , Peter L. Hammer , A. Kogan, Maximum patterns in datasets, Discrete Applied Mathematics, v.156 n.6, p.846-861, March, 2008
	Thomas Weise , Michael Zapf, Evolving distributed algorithms with genetic programming: election, Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, June 12-14, 2009, Shanghai, China
	Hugo Jair Escalante , Manuel Montes , Luis Enrique Sucar, Particle Swarm Model Selection, The Journal of Machine Learning Research, 10, p.405-440, June 2009