Title of article :
A Suitability Study of Discretization Methods for Associative Classifiers
Author/Authors :
Kavita Das، نويسنده , , O. P. Vyas، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Pages :
6
From page :
46
To page :
51
Abstract :
Discretization is a popular approach for handling numeric attributes in machine learning. The attributes in the datasets are both nominal and continuous. Most of the Classifiers are capable to be applied on discretized data. Hence, pre-processing of continuous data for converting them into discretized data is a necessary step before being used for the Classification Rule Mining approaches. Recently developed Associative Classifiers like CBA, CMAR and CPAR are almost equal in accuracy and have outperformed traditional classifiers. The distribution of continuous data into discrete ranges may affect the accuracy of classification. This work provides a comparative study of few discretization methods with these new classifiers. The target is to find some suitable discretization methods that are more suitable with these associative classifiers.
Keywords :
USD , MDLP , ChiMerge , ID3 , EFD , EWD , ARM , CRM , CBA , CMAR , CPAR , CADD
Journal title :
International Journal of Computer Applications
Serial Year :
2010
Journal title :
International Journal of Computer Applications
Record number :
660003
Link To Document :
بازگشت