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

• 计算机 • 上一篇    下一篇

一种基于分类目标的启发式离散化算法

孙英娟1,2, 黄岚1, 翟延东1, 蒲东兵3, 周春光1   

  1. 1. 吉林大学 计算机科学与技术学院, 长春 130012;2. 长春师范学院 计算机科学与技术学院, 长春 130032; 3. 东北师范大学 计算机科学学院, 长春 130024
  • 收稿日期:2009-07-24 出版日期:2009-11-26 发布日期:2010-01-07
  • 通讯作者: 周春光 E-mail:cgzhou@jlu.edu.cn.

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

中图分类号: 

  • TP18