Modelling classification performance for large data sets: An empirical study

Baohua Gu, Feifang Hu, Huan Liu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations

Abstract

For many learning algorithms, their learning accuracy will increase as the size of training data increases, forming the well-known learning curve. Usually a learning curve can be fitted by interpolating or extrapolating some points on it with a specified model. The obtained learning curve can then be used to predict the maximum achievable learning accuracy or to estimate the amount of data needed to achieve an expected learning accuracy, both of which will be especially meaningful to data mining on large data sets. Although some models have been proposed to model learning curves, most of them do not test their applicability to large data sets. In this paper, we focus on this issue. We empirically compare six potentially useful models by fitting learning curves of two typical classification algorithms¾C4.5 (decision tree) and LOG (logistic discrimination) on eight large UCI benchmark data sets. By using all available data for learning, we fit a full-length learning curve; by using a small portion of the data, we fit a part-length learning curve. The models are then compared in terms of two performances: (1) how well they fit a full-length learning curve, and (2) how well a fitted part-length learning curve can predict learning accuracy at the full length. Experimental results show that the power law (y = a-b*x-c) is the best among the six models in both the performances for the two algorithms and all the data sets. These results support the applicability of learning curves to data mining.

Original languageEnglish (US)
Title of host publicationAdvances in Web-Age Information Management - 2nd International Conference, WAIM 2001, Proceedings
PublisherSpringer Verlag
Pages317-328
Number of pages12
Volume2118
ISBN (Print)9783540477143
StatePublished - 2001
Event2nd International Conference on Web-Age Information Management, WAIM 2001 - Xi’an, China
Duration: Jul 9 2001Jul 11 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2118
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2nd International Conference on Web-Age Information Management, WAIM 2001
CountryChina
CityXi’an
Period7/9/017/11/01

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Modelling classification performance for large data sets: An empirical study'. Together they form a unique fingerprint.

  • Cite this

    Gu, B., Hu, F., & Liu, H. (2001). Modelling classification performance for large data sets: An empirical study. In Advances in Web-Age Information Management - 2nd International Conference, WAIM 2001, Proceedings (Vol. 2118, pp. 317-328). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2118). Springer Verlag.