Please use this identifier to cite or link to this item:
|Title: ||A Discretization Algorithm Based on Class-Attribute Contingency Coefficient|
|Authors: ||Cheng-Jung Tsai;Chien-I. Lee;Wei-Pang Yang|
|Keywords: ||Data mining;Classification;Decision tree;Discretization;Contingency coefficient|
|Issue Date: ||2011-05-10T06:29:08Z
|Publisher: ||Elsevier Science|
|Abstract: ||Discretization algorithms have played an important role in data mining and knowledge discovery. They not only produce a concise summarization of continuous attributes to help the experts understand the data more easily, but also make learning more accurate and faster. In this paper, we propose a static, global, incremental, supervised and top-down discretization algorithm based on Class-Attribute Contingency Coefficient. Empirical evaluation of seven discretization algorithms on 13 real datasets and four artificial datasets showed that the proposed algorithm could generate a better discretization scheme that improved the accuracy of classification. As to the execution time of discretization, the number of generated rules, and the training time of C5.0, our approach also achieved promising results.|
|Relation: ||Information Sciences, 178(3):714-731|
|Appears in Collections:||[數學系] 期刊論文|
Files in This Item:
There are no files associated with this item.
All items in NCUEIR are protected by copyright, with all rights reserved.