J4 ›› 2009, Vol. 47 ›› Issue (6): 1251-1254.

Previous Articles     Next Articles

Heuristic Discretization Algorithm Based on Objective Planning

SUN Yingjuan1,2, HUANG Lan1, ZHAI Yandong1, PU Dongbing3, ZHOU Chunguang1   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;2. College of Computer Science and Technology, Changchun Normal University, Changchun 130032, China;3. School of Computer Science, Northeast Normal University, Changchun 130024, China
  • Received:2009-07-24 Online:2009-11-26 Published:2010-01-07
  • Contact: ZHOU Chunguang E-mail:cgzhou@jlu.edu.cn.

Abstract:

In order to solve the problem of rough sets theory in continuous attributes discretization a heuristic discretization algorighm on objective planning is proposed. With the wealthy calculation on objective planning and the importance of attributes considered, the heuristic discretization algorithm not only reduces decision rulers but also finishes attribute value reduction. The comparison between the algorithms in this paper and the other paper on teataste signals shows the algorithm in this paper produces less rulers and the short average length of rulers. The rulers in this algorithm have been decided, too. Consequently, the decision system has a high efficiency.

Key words: rough set; importance degree; discretization; interval partition; decision ruler

CLC Number: 

  • TP18