Efficient splitting rules based on the probabilities of pre-assigned intervals

June Suh Cho, Nabil R. Adam

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

1 Scopus citations

Abstract

This paper describes new methods for classfication in order to find an optimal tree. Unlike the current splitting rules that are provided by searching all threshold values, this paper proposes the splitting rules that are based on the probabilities of pre-assigned intervals.

Original languageEnglish (US)
Title of host publicationProceedings - 2001 IEEE International Conference on Data Mining, ICDM'01
Pages584-585
Number of pages2
StatePublished - 2001
Event1st IEEE International Conference on Data Mining, ICDM'01 - San Jose, CA, United States
Duration: Nov 29 2001Dec 2 2001

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
ISSN (Print)1550-4786

Other

Other1st IEEE International Conference on Data Mining, ICDM'01
Country/TerritoryUnited States
CitySan Jose, CA
Period11/29/0112/2/01

All Science Journal Classification (ASJC) codes

  • General Engineering

Fingerprint

Dive into the research topics of 'Efficient splitting rules based on the probabilities of pre-assigned intervals'. Together they form a unique fingerprint.

Cite this