Decision tree induction from numeric data stream

Satoru Nishimura, Masahiro Terabe, Kazuo Hashimoto

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

1 Citation (Scopus)

Abstract

Hoeffding Tree Algorithm is known as a method to induce decision trees from a data stream. Treatment of numeric attribute on Hoeffding Tree Algorithm has been discussed for stationary input. It has not yet investigated, however, for non-stationary input where the effect of concept drift is apparent. This paper identifies three major approaches to handle numeric values, Exhaustive Method, Gaussian Approximation, and Discretizaion Method, and through experiment shows the best suited modeling of numeric attributes for Hoeffding Tree Algorithm. This paper also experimentaly compares the performance of two known methods for concept drift detection, Hoeffding Bound Based Method and Accuracy Based Method.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages311-317
Number of pages7
Volume5360 LNAI
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event21st Australasian Joint Conference on Artificial Intelligence, AI 2008 - Auckland
Duration: 2008 Dec 12008 Dec 5

Publication series

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

Other

Other21st Australasian Joint Conference on Artificial Intelligence, AI 2008
CityAuckland
Period08/12/108/12/5

Fingerprint

Decision trees
Data Streams
Numerics
Decision tree
Proof by induction
Tree Algorithms
Concept Drift
Trees (mathematics)
Attribute
Gaussian Approximation
Experiments
Modeling
Experiment

Keywords

  • Concept drift
  • Hoeffding tree
  • Numeric data stream

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Nishimura, S., Terabe, M., & Hashimoto, K. (2008). Decision tree induction from numeric data stream. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5360 LNAI, pp. 311-317). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5360 LNAI). https://doi.org/10.1007/978-3-540-89378-3_30

Decision tree induction from numeric data stream. / Nishimura, Satoru; Terabe, Masahiro; Hashimoto, Kazuo.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5360 LNAI 2008. p. 311-317 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5360 LNAI).

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

Nishimura, S, Terabe, M & Hashimoto, K 2008, Decision tree induction from numeric data stream. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5360 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5360 LNAI, pp. 311-317, 21st Australasian Joint Conference on Artificial Intelligence, AI 2008, Auckland, 08/12/1. https://doi.org/10.1007/978-3-540-89378-3_30
Nishimura S, Terabe M, Hashimoto K. Decision tree induction from numeric data stream. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5360 LNAI. 2008. p. 311-317. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-89378-3_30
Nishimura, Satoru ; Terabe, Masahiro ; Hashimoto, Kazuo. / Decision tree induction from numeric data stream. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5360 LNAI 2008. pp. 311-317 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{44ca1240251e4988b27162a3e8911ffb,
title = "Decision tree induction from numeric data stream",
abstract = "Hoeffding Tree Algorithm is known as a method to induce decision trees from a data stream. Treatment of numeric attribute on Hoeffding Tree Algorithm has been discussed for stationary input. It has not yet investigated, however, for non-stationary input where the effect of concept drift is apparent. This paper identifies three major approaches to handle numeric values, Exhaustive Method, Gaussian Approximation, and Discretizaion Method, and through experiment shows the best suited modeling of numeric attributes for Hoeffding Tree Algorithm. This paper also experimentaly compares the performance of two known methods for concept drift detection, Hoeffding Bound Based Method and Accuracy Based Method.",
keywords = "Concept drift, Hoeffding tree, Numeric data stream",
author = "Satoru Nishimura and Masahiro Terabe and Kazuo Hashimoto",
year = "2008",
doi = "10.1007/978-3-540-89378-3_30",
language = "English",
isbn = "3540893776",
volume = "5360 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "311--317",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Decision tree induction from numeric data stream

AU - Nishimura, Satoru

AU - Terabe, Masahiro

AU - Hashimoto, Kazuo

PY - 2008

Y1 - 2008

N2 - Hoeffding Tree Algorithm is known as a method to induce decision trees from a data stream. Treatment of numeric attribute on Hoeffding Tree Algorithm has been discussed for stationary input. It has not yet investigated, however, for non-stationary input where the effect of concept drift is apparent. This paper identifies three major approaches to handle numeric values, Exhaustive Method, Gaussian Approximation, and Discretizaion Method, and through experiment shows the best suited modeling of numeric attributes for Hoeffding Tree Algorithm. This paper also experimentaly compares the performance of two known methods for concept drift detection, Hoeffding Bound Based Method and Accuracy Based Method.

AB - Hoeffding Tree Algorithm is known as a method to induce decision trees from a data stream. Treatment of numeric attribute on Hoeffding Tree Algorithm has been discussed for stationary input. It has not yet investigated, however, for non-stationary input where the effect of concept drift is apparent. This paper identifies three major approaches to handle numeric values, Exhaustive Method, Gaussian Approximation, and Discretizaion Method, and through experiment shows the best suited modeling of numeric attributes for Hoeffding Tree Algorithm. This paper also experimentaly compares the performance of two known methods for concept drift detection, Hoeffding Bound Based Method and Accuracy Based Method.

KW - Concept drift

KW - Hoeffding tree

KW - Numeric data stream

UR - http://www.scopus.com/inward/record.url?scp=58349122169&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58349122169&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89378-3_30

DO - 10.1007/978-3-540-89378-3_30

M3 - Conference contribution

SN - 3540893776

SN - 9783540893776

VL - 5360 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 311

EP - 317

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -