Discretization of Continuous Attributes in Decision Table Based on Decision Power
Gui Xian-cai
Abstract
Gui Xian-cai
Abstract
The discretization of continuous attributes values of a decision system is divides continuous values into different space and allo-cates some discrete values to each space. In this paper a new discretization algorithm of continue attributes in decision table is offered. First-ly,the decision power used to measure the importance of condition attributes,according to which the condition attributes are sorted in anascending order. Secondly,all break points of every condition attributes are examined and the redundant ones are eliminated. Finally,eachvalue in the decision table is replaced by a number representing the break point,and then the decision table is discretized. The algorithm isconstructed with good understandability and simple computation. The time complexity of this algorithm is O(3kn2).
A significance statement is not available in the OpenAlex record.
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 continuous attributes values of a decision system is divides continuous values into different space and allo-cates some discrete values to each space. In this paper a new discretization algorithm of continue attributes in decision table is offered. First-ly,the decision power used to measure the importance of condition attributes,according to which the condition attributes are sorted in anascending order. Secondly,all break points of every condition attributes are examined and the redundant ones are eliminated. Finally,eachvalue in the decision table is replaced by a number representing the break point,and then the decision table is discretized. The algorithm isconstructed with good understandability and simple computation. The time complexity of this algorithm is O(3kn2).
Key concepts: Discretization, Decision table, Discretization of continuous features, Computer science, Table (database), Computation, Algorithm, Point (geometry)