CAIM DISCRETIZATION ALGORITHM PDF

Skip to Main Content. A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. Use of this web site signifies your agreement to the terms and conditions. Personal Sign In. For IEEE to continue sending you helpful information on our products and services, please consent to our updated Privacy Policy.

Author:Tazahn Kaziktilar
Country:Turkey
Language:English (Spanish)
Genre:Travel
Published (Last):1 September 2017
Pages:260
PDF File Size:5.77 Mb
ePub File Size:6.79 Mb
ISBN:538-5-41497-246-3
Downloads:99434
Price:Free* [*Free Regsitration Required]
Uploader:Kalar



Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. DOI: Kurgan and Krzysztof J. Kurgan , Krzysztof J. The task of extracting knowledge from databases is quite often performed by machine learning algorithms. The majority of these algorithms can be applied only to data described by discrete numerical or nominal attributes features. In the case of continuous attributes, there is a need for a discretization algorithm that transforms continuous attributes into discrete ones.

View on IEEE. Save to Library. Create Alert. Launch Research Feed. Share This Paper. Tables and Topics from this paper. Citations Publications citing this paper. Discretization of continuous attributes through low frequency numerical values and attribute interdependency Md. Incremental filter and wrapper approaches for feature discretization Artur J. Figueiredo Computer Science Neurocomputing Figueiredo , Sara C. Madeira Medicine Journal of integrative bioinformatics Systems Science References Publications referenced by this paper.

Cios , Lukasz A. Kurgan Mathematics, Computer Science Inf. Computer Science, Univ. Ching , Andrew K. Wong , Keith C. Pattern Anal.

Fayyad , Keki B. Edinburgh: Intelligent Terminals. Paterson , T. Irani Computer Science Machine Learning Cios Computer Science Kurgan Computer Science StatLib Project Repository. Kaufman , Ryszard S. Related Papers. By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy , Terms of Service , and Dataset License.

BUCYRUS 49HR PDF

CAIM discretization algorithm

Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. Kurgan and Krzysztof J. Kurgan , Krzysztof J. Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an attribute is that some of the machine learning algorithms perform poorly with continuous attribute and thus require front-end discretization of the input data.

MAC97A6 PDF

Fast Class-Attribute Interdependence Maximization (CAIM) Discretization Algorithm

Skip to Main Content. Try These Tips. A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. Use of this web site signifies your agreement to the terms and conditions. Personal Sign In.

IF I CAN YOU CAN BY SALLY EICHHORST PDF

Select a Web Site

Updated 17 Oct The task of extracting knowledge from databases is quite often performed by machine learning algorithms. The majority of these algorithms can be applied only to data described by discrete numerical or nominal attributes features. In the case of continuous attributes, there is a need for a discretization algorithm that transforms continuous attributes into discrete ones. One can start with "ControlCenter. If there is any problem , please let me know. I will answer you as soon as possible.

Related Articles