Discretization algorithms: Class-Attribute Contingency Coefficient
by Guangdi Li
04 Jun 2009
(Updated 31 Jan 2011)
To discrete continuous data, CACC is a promising discretization scheme proposed in 2008
|
Watch this File
|
| File Information |
| Description |
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.
We implement the CACC algorithm is based on paper[1].
As for the code, one can open "ControlCenter.m" at first, there is a simple example here, along with one yeast database. Explanation is included inside this file too.
If there is any problem, just let me know, i will help you as soon as possible.
[1]Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang: A discretization algorithm based on Class-Attribute Contingency Coefficient. Inf. Sci. 178(3): 714-731 (2008) |
| MATLAB release |
MATLAB 7.6 (R2008a)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Updates |
| 04 Jul 2009 |
Improve it |
| 31 Jan 2011 |
improve the code |
|
Contact us at files@mathworks.com