2011•Kongzhi yu jueceRequires access

Heuristic discretization technique based on the class-attribute interdependence

NI Yan-sen

Open publisher page 1 citations

Abstract

Discretization algorithms play an important role in many areas such as data mining,machine learning and artificial intelligence.Therefore,a heuristic discretization technique based on the class-attribute interdependence is proposed.A new discretization criterion is defined,which selects best cut points in terms of characteristics of the data itself and overcomes the existing deficiencies of state-of-the-art top-down discretization methods.A novel measure of inconsistency based on variable precision rough sets(VPRS) model is developed,which effectively controls information loss generated by discretization and allows an adaptive degree of misclassification.Empirical experiments and statistical analysis show that the proposed technique generates a better discretization scheme which significantly improves the accuracy of classification by running J4.8 and SVM.

About this research paper

What this paper is about

Discretization algorithms play an important role in many areas such as data mining,machine learning and artificial intelligence.Therefore,a heuristic discretization technique based on the class-attribute interdependence is proposed.A new discretization criterion is defined,which selects best cut points in terms of characteristics of the data itself and overcomes the existing deficiencies of state-of-the-art top-down discretization methods.A novel measure of inconsistency based on variable precision rough sets(VPRS) model is developed,which effectively controls information loss generated by discretization and allows an adaptive degree of misclassification.Empirical experiments and statistical analysis show that the proposed technique generates a better discretization scheme which significantly improves the accuracy of classification by running J4.8 and SVM.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Discretization algorithms play an important role in many areas such as data mining,machine learning and artificial intelligence.Therefore,a heuristic discretization technique based on the class-attribute interdependence is proposed.A new discretization criterion is defined,which selects best cut points in terms of characteristics of the data itself and overcomes the existing deficiencies of state-of-the-art top-down discretization methods.A novel measure of inconsistency based on variable precision rough sets(VPRS) model is developed,which effectively controls information loss generated by discretization and allows an adaptive degree of misclassification.Empirical experiments and statistical analysis show that the proposed technique generates a better discretization scheme which significantly improves the accuracy of classification by running J4.8 and SVM.

Key concepts: Discretization, Discretization of continuous features, Heuristic, Rough set, Class (philosophy), Support vector machine, Variable (mathematics), Measure (data warehouse)

Related papers

Back to paper searchBrowse research topicsOriginal source
Heuristic discretization technique based on the class-attribute interdependence — Research Paper | ScholarLens