首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于类别属性关联程度最大化离散算法
引用本文:杨萍,杨天社,杜小宁,李济生,黄永宣.一种基于类别属性关联程度最大化离散算法[J].控制与决策,2011,26(4):592-596.
作者姓名:杨萍  杨天社  杜小宁  李济生  黄永宣
作者单位:西安交通大学,系统工程研究所,西安,710049
摘    要:针对现有离散化算法难以兼顾计算速度和求解质量这一难题,提出一种新的基于类别属性关联程度最大化监督离散化算法.该算法考虑了类别、属性值的空间分布特征,根据类别与属性之间的内在联系构造离散化框架,使离散化后类别和属性的关联程度最大.实验结果表明,基于类别属性关联程度最大化离散算法在保证计算速度的前提下能有效提高分类精度,减少分类规则个数.

关 键 词:离散化  关联程度最大化  分类  数据挖掘
收稿时间:2010/1/22 0:00:00
修稿时间:2010/5/20 0:00:00

A class-attribute interdependency maximization based algorithm for supervised discretization
YANG Ping,YANG Tian-she,DU Xiao-ning,LI Ji-sheng,HUANG Yong-xuan.A class-attribute interdependency maximization based algorithm for supervised discretization[J].Control and Decision,2011,26(4):592-596.
Authors:YANG Ping  YANG Tian-she  DU Xiao-ning  LI Ji-sheng  HUANG Yong-xuan
Affiliation:(Systems Engineering Institute,Xi’an Jiaotong University,Xi’an 710049,China.)
Abstract:

Considering that the existing discretization algorithms do not give simultaneously attention to evolution speed
and solution’s quality, a new class-attribute interdependency maximization based algorithm for supervised discretization
is proposed in this paper. The algorithm considers the distribution of both class and continuous attributes, and according
to the underlying correlation structure of them, the discretization scheme is constructed which can maintain the highest
interdependence between the target class and all the discretized attributes. The experiment results show that, with a reasonable
execution time, the proposed algorithm can improve the accuracy of the classification result and reduce the number of
classification rules.

Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《控制与决策》浏览原始摘要信息
点击此处可从《控制与决策》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号