discretization of the input data. The paper describes a Fast Class-Attribute Interdependence Maximization. (F-CAIM) algorithm that is an extension of the. MCAIM: Modified CAIM Discretization Algorithm for. Classification. Shivani V. Vora. (Research) Scholar. Department of Computer Engineering, SVNIT. CAIM (Class-Attribute Interdependence Maximization) is a discretization algorithm of data for which the classes are known. However, new arising challenges.

Author: Gahn Mucage
Country: Cyprus
Language: English (Spanish)
Genre: Art
Published (Last): 6 October 2008
Pages: 360
PDF File Size: 14.68 Mb
ePub File Size: 10.17 Mb
ISBN: 351-7-37936-182-3
Downloads: 75022
Price: Free* [*Free Regsitration Required]
Uploader: Kigakora

Yu Li Yu Li view profile. Learn About Live Editor.

The majority of these algorithms can be applied only to data described by discrete numerical or nominal attributes features. Select the China site in Chinese or English for best site performance. Updated alorithm Oct Select a Web Site Choose a web site to get translated content where available and see local events and offers.

You are now following this Submission You will see updates in your activity feed You may receive emails, depending on your notification preferences.

Balanced data sets information Data set Instances Attributes Real Integer Nominal Classes abalone 8 7 0 1 28 arrhythmia 0 73 16 glass 9 9 0 0 7 heart 13 1 4 8 2 ionosphere 33 32 0 1 2 iris 4 4 0 0 3 jm1 21 13 8 0 2 madelon 0 0 2 mc1 38 10 28 0 2 mfeat-factors 0 0 10 mfeat-fourier 76 76 0 0 10 mfeat-karhunen 64 64 0 0 10 mfeat-zernike 47 47 0 0 10 pc2 36 13 23 0 2 penbased 16 16 0 0 10 pendigits 16 0 16 0 10 pima 8 8 0 0 2 satimage 36 0 36 0 7 segment 19 19 0 0 7 sonar 60 60 0 0 2 spambase 57 57 0 0 2 spectrometer 0 2 48 texture 40 40 0 0 11 thyroid 21 6 0 15 3 vowel 13 11 0 2 11 waveform 40 40 0 0 3 winequality-red 11 11 0 0 11 winequality-white 11 11 0 0 Tags Add Tags classification data mining discretization.


Based on your location, we recommend that you select: Comments and Ratings 4. If there is any problemplease let me know. These algorithms were used in Garcia et al. Hemanth Hemanth view profile. Third, the runtime of the algorithm is lower than CAIM’s. Discretized data sets are available to download for each discretization method.

Second, the quality of the intervals is improved based on the data classes distribution, which leads to better classification performance on balanced and, especially, unbalanced data.

Hi, I got a error, can u help me? Updates 17 Oct 1. I will answer you as soon as possible.

The data sets are available to download balanced and unbalanced. Thanks for the code Guangdi Li.

ur-CAIM: Improved CAIM Discretization for Unbalanced and Balanced Data

Aren’t the class label supposed to be a binary indicator matrix with 1ofK coding? Then I could test it and find the problem. The algorithm has been designed free-parameter and it self-adapts to the problem complexity and the data class distribution.

This code is based on paper: The ur-CAIM was compared with 9 well-known discretization methods on 28 balanced, and 70 unbalanced data sets. Choose a web site to get translated content where available and see local events and offers. Supervised discretization is one of basic data preprocessing techniques used alvorithm data mining.

Could you please send me the data directly? These data sets are discretizztion different in terms of their complexity, number of classes, number of attributes, number of instances, and unbalance ratio ratio of size of the majority class to minority class. In the case of continuous attributes, there is a need for a discretization algorithm that transforms continuous attributes into discrete ones. The results obtained were contrasted through non-parametric statistical tests, which show that our proposal outperforms CAIM and many of the other methods on both types of data but especially on unbalanced data, which is its significant advantage.


CAIM class-attribute interdependence maximization is designed to discretize continuous data. I am not able to understand the class labels assigned to the Yeast dataset.

ur-CAIM: An Improved CAIM Discretization Algorithm for Unbalanced and Balanced Data Sets

First, it generates more flexible discretization schemes while producing a small number of intervals. One can start with “ControlCenter.

I have a question regarding the class labels. The task discrretization extracting knowledge from databases is quite often performed by machine learning algorithms.

CAIM Discretization Algorithm – File Exchange – MATLAB Central

Attempted to access B 0 ; index must be a positive integer or logical. Full results for each discretization and classification algorithm, and for each data set are available to download in CSV format. Hello sir i am student of jntuk university. However, new arising challenges algorlthm as the presence of unbalanced data sets, call for new algorithms capable of handling them, in addition to balanced data.

Other MathWorks country sites discretizatkon not optimized for visits from your location. Discover Live Editor Create scripts with code, output, and formatted text in a single executable document. Guangdi Li Guangdi Li view profile. One fold is used for pruning, the rest for growing the rules.