Iterative data squashing for boosting based on a distribution-sensitive distance

Yuta Choki, Einoshin Suzuki

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

Abstract

This paper proposes, for boosting, a novel method which prevents deterioration of accuracy inherent to data squashing methods. Boosting, which constructs a highly accurate classification model by combining multiple classification models, requires long computational time. Data squashing, which speeds-up a learning method by abstracting the training data set to a smaller data set, typically lowers accuracy. Our SB (Squashing-Boosting) loop, based on a distribution-sensitive distance, alternates data squashing and boosting, and iteratively refines an SF (Squashed-Feature) tree, which provides an appropriately squashed data set. Experimental evaluation with artificial data sets and the KDD Cup 1999 data set clearly shows superiority of our method compared with conventional methods. We have also empirically evaluated our distance measure as well as our SF tree, and found them superior to alternatives.

Original languageEnglish
Title of host publicationPrinciples of Data Mining and Knowledge Discovery - 6th European Conference, PKDD 2002, Proceedings
Pages86-98
Number of pages13
Publication statusPublished - Dec 1 2002
Externally publishedYes
Event6th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2002 - Helsinki, Finland
Duration: Aug 19 2002Aug 23 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2431 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2002
CountryFinland
CityHelsinki
Period8/19/028/23/02

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Choki, Y., & Suzuki, E. (2002). Iterative data squashing for boosting based on a distribution-sensitive distance. In Principles of Data Mining and Knowledge Discovery - 6th European Conference, PKDD 2002, Proceedings (pp. 86-98). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2431 LNAI).