[1]陆 悠,华 泽,奚雪峰,等.一种面向增删操作的粗糙集属性约简更新算法[J].南京师大学报(自然科学版),2015,38(01):48.
 Lu You,Hua Ze,Xi Xuefeng,et al.An Attribute Reduction Update Algorithm for Object’sAdding-Deleting Based on Rough Set Theory[J].Journal of Nanjing Normal University(Natural Science Edition),2015,38(01):48.
点击复制

一种面向增删操作的粗糙集属性约简更新算法()
分享到:

《南京师大学报》(自然科学版)[ISSN:1001-4616/CN:32-1239/N]

卷:
第38卷
期数:
2015年01期
页码:
48
栏目:
计算机科学
出版日期:
2015-06-30

文章信息/Info

Title:
An Attribute Reduction Update Algorithm for Object’sAdding-Deleting Based on Rough Set Theory
作者:
陆 悠华 泽奚雪峰张 妮吴宏杰
苏州科技学院电子与信息工程学院,江苏 苏州 215000
Author(s):
Lu YouHua ZeXi XuefengZhang NiWu Hongjie
School of Electronical and Information Engineering,Suzhou University of Science and Technology,Suzhou 215000,China
关键词:
粗糙集增量式数据挖掘属性约简
Keywords:
rough setincremental data miningreduction of attribute
分类号:
TP18
文献标志码:
A
摘要:
属性约简是粗糙集理论的核心内容之一,在信息系统的对象信息不断出现增删等更新操作的环境下,如何进行快速有效的属性约简则是一个亟需解决的迫切问题. 提出一种面向增删操作的属性约简更新算法,面向更新前后的决策表,首先分析了对象信息动态增加与删除情况下信息熵的变化机制以及约简属性对新增或删除对象的区分情况,然后提出基于区分情况的新条件熵值的计算方法,最后给出基于散列表的属性约简更新算法. 实验结果证明,本文方法可以快速求解出增删更新后的属性约简结果,其性能较传统方法有较大优势.
Abstract:
Attribute reduction is one of the important topics in the research on rough set theory. When an object was added to or deleted from the original decision table,how to calculate attribute reduction fast and effectively is a pressing problem. This paper proposed an attribute reduction update algorithm. Firstly,the changing mechanism of conditional entropy was analyzed when object is added to or removed from the table,and then we divided the added or removed objects into different cases. Furthermore,we presented the update algorithm based on these cases and implemented it based on hash table. Experiment results show that our algorithm can calculate the attribute reduction fast and outperforms the existing methods.

参考文献/References:

[1] Kim H,Claffy K,Fomenkov M,et al. Internet traffic classification demystified:myths,caveats,and the best practices[C]//Proceedings of ACM CoNEXT’08. New York,2008:1-12.
[2]Zhang D,Qiu J,Li X. Attribute reduction based on equivalence classes with multiple decision values in rough set[C]//Proceedings of the International Conference on Information Engineering and Applications(IEA)2012. London:Springer,2013:505-512.
[3]Jia X,Tang Z,Liao W,et al. On an optimization representation of decision-theoretic rough set model[J]. International Journal of Approximate Reasoning,2014,55(1):156-166.
[4]陆悠,罗军舟,李伟,等. 面向网络状态的自适应用户行为评估方法[J]. 通信学报,2013(7):71-80.
[5]钱文彬,杨炳儒,徐章艳. 基于信息熵的核属性增量式高效更新算法[J]. 模式识别与人工智能,2013,26(1):42-49.
[6]Janusz A,Slzak D. Rough set methods for attribute clustering and selection[J]. Applied Artificial Intelligence,2014,28(3):220-242.

相似文献/References:

[1]吴国兵,黄兵.粗糙群定义的缺陷与修正[J].南京师大学报(自然科学版),2011,34(04):39.
 Wu Guobing,Huang Bing.Defect and Revision of Definition of Rough Group[J].Journal of Nanjing Normal University(Natural Science Edition),2011,34(01):39.
[2]张 静,鞠恒荣,杨习贝,等.柔性多粒化决策理论粗糙集模型[J].南京师大学报(自然科学版),2017,40(01):48.[doi:10.3969/j.issn.1001-4616.2017.01.008]
 Zhang Jing,Ju Hengrong,Yang Xibei,et al.A Flexible Multigranulation Decision-Theoretic Rough Set Model[J].Journal of Nanjing Normal University(Natural Science Edition),2017,40(01):48.[doi:10.3969/j.issn.1001-4616.2017.01.008]
[3]吴婷婷,李 艳,郭娜娜,等.基于优势-等价关系的属性约简算法[J].南京师大学报(自然科学版),2017,40(03):45.[doi:10.3969/j.issn.1001-4616.2017.03.007]
 Wu Tingting,Li Yan,Guo Nana,et al.Attribute Reduction Algorithms Based on Dominance-Equivalence Relations[J].Journal of Nanjing Normal University(Natural Science Edition),2017,40(01):45.[doi:10.3969/j.issn.1001-4616.2017.03.007]

备注/Memo

备注/Memo:
收稿日期:2014-08-16.
基金项目:江苏省自然科学基金(BK20131154).
通讯联系人:陆悠,博士生,讲师,研究方向:网络应用及安全,用户行为控制. E-mail:luyou. china@gmail. Com
更新日期/Last Update: 2015-03-30