loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First IEEE International Conference on Data Mining (ICDM'01)
San Jose, California
November 29-December 02
ISBN: 0-7695-1119-8
ASCII Text
x 
 
June-Suh Cho, Nabil R. Adam, "Efficient Splitting Rules Based on the Probabilities of Pre-assigned Intervals," Data Mining, IEEE International Conference on, pp. 584, First IEEE International Conference on Data Mining (ICDM'01), 2001.
 
 
BibTex
x
 
@article{ 10.1109/ICDM.2001.989570,
author = {June-Suh Cho and Nabil R. Adam},
title = {Efficient Splitting Rules Based on the Probabilities of Pre-assigned Intervals},
journal ={Data Mining, IEEE International Conference on},
volume = {0},
year = {2001},
isbn = {0-7695-1119-8},
pages = {584},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2001.989570},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Mining, IEEE International Conference on
TI - Efficient Splitting Rules Based on the Probabilities of Pre-assigned Intervals
SN - 0-7695-1119-8
SP
EP
A1 - June-Suh Cho,
A1 - Nabil R. Adam,
PY - 2001
VL - 0
JA - Data Mining, IEEE International Conference on
ER -
 
This paper describes new methods for classification 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.
Citation:
June-Suh Cho, Nabil R. Adam, "Efficient Splitting Rules Based on the Probabilities of Pre-assigned Intervals," icdm, pp.584, First IEEE International Conference on Data Mining (ICDM'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.