English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6469/11641
Visitors : 18467641      Online Users : 219
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/8858

Title: A Discretization Algorithm Based on Class-Attribute Contingency Coefficient
Authors: Cheng-Jung Tsai;Chien-I. Lee;Wei-Pang Yang
Contributors: 數學系
Keywords: Data mining;Classification;Decision tree;Discretization;Contingency coefficient
Date: 2008-02
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.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback