New Algorithm for Discretization Based on Information Entropy
Yan De
Abstract
Yan De
Abstract
The discretization of continues attributes is always with great contribution to the followed process of machine learning or data mining.A new algorithm based on information entropy for discretization of decision table was proposed.Through inconsistency checking of decision table,we deleted some redundant cut points on the basis of preliminary discretization scheme.The experiments of classification of discreted data were performed by using SVM,and meanwhile compared with other algorithms,the presented algorithm is effective.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The discretization of continues attributes is always with great contribution to the followed process of machine learning or data mining.A new algorithm based on information entropy for discretization of decision table was proposed.Through inconsistency checking of decision table,we deleted some redundant cut points on the basis of preliminary discretization scheme.The experiments of classification of discreted data were performed by using SVM,and meanwhile compared with other algorithms,the presented algorithm is effective.
Key concepts: Discretization, Computer science, Discretization of continuous features, Entropy (arrow of time), Algorithm, Support vector machine, Decision table, Scheme (mathematics)