属性约简准则与约简信息损失的研究

doi:10.3969/j.issn.0372-2112.2017.02.019

电子学报 ›› 2017, Vol. 45 ›› Issue (2): 401-407.DOI: 10.3969/j.issn.0372-2112.2017.02.019

属性约简准则与约简信息损失的研究

邓大勇^1,2,3, 薛欢欢¹, 苗夺谦³, 卢克文¹

1. 浙江师范大学数理与信息工程学院, 浙江金华 321004;
2. 浙江师范大学行知学院, 浙江金华 321004;
3. 同济大学电子与信息工程学院, 上海 201804

收稿日期:2016-03-21 修回日期:2016-05-06 出版日期:2017-02-25
- 通讯作者:
- 邓大勇
- 作者简介:
- 薛欢欢,女,1990年出生于河南商丘.现为浙江师范大学数理信息工程学院计算机科学与技术专业硕士研究生.主要研究方向为粗糙集、数据挖掘.E-mail:1530043379@qq.com;苗夺谦,男,1964年出生,教授,博士,博士生导师,现为同济大学电信工程学院教师,主要研究方向为粗糙集、粒计算、数据挖掘、计算智能、图像处理等.E-mail:dqmiao@tongji.edu.cn;卢克文,男,1992年出生于安徽明光.现为浙江师范大学数理与信息工程学院计算机科学与技术专业硕士研究生.主要研究方向为粗糙集、数据挖掘.E-mail:709882771@qq.com
- 基金资助:
- 国家自然科学基金 (No.61572442，No.61203247，No.61273304，No.61573259，No.61472166）; 浙江省自然科学基金 (No.LY15F020012）; 浙江省自然科学青年基金 (No.Q13F020006）

Study on Criteria of Attribute Reduction and Information Loss of Attribute Reduction

DENG Da-yong^1,2,3, XUE Huan-huan¹, MIAO Duo-qian³, LU Ke-wen¹

1. College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, Zhejiang 321004, China;
2. Xingzhi College, Zhejiang Normal University, Jinhua, Zhejiang 321004, China;
3. School of Electronics and Information Engineering, Tongji University, Shanghai 201804, China

Received:2016-03-21 Revised:2016-05-06 Online:2017-02-25 Published:2017-02-25

摘要/Abstract

摘要：

属性约简是粗糙集的重要研究内容，信息熵是度量信息量的方法.在研究绝对约简和几种相对约简的基础上，归纳出属性约简的一般准则.定义了基于条件属性信息熵的属性约简和基于联合熵的属性约简，研究了几种属性约简与绝对约简之间的关系.定义了基于条件属性信息熵的约简信息损失，澄清了属性约简不损失信息的含糊观念，指出了属性约简只是在约简准则意义下不损失信息，在信息熵意义下可能损失信息.为进一步研究粗糙集、粒计算中属性约简与分类夯实了信息论基础.

关键词: 粗糙集, 属性约简, 信息熵, 联合熵, 信息损失

Abstract:

Attribute reduction is one of important topics in rough set theory,and information entropy is an index of measuring the amount of information.After investigating absolute attribute reduct and several kinds of relatively attribute reducts,a general criterion of reducts is induced in rough set theory.With this criterion of reducts,attribute reduct based on information entropy and attribute reduct based on joint entropy are defined.The relationships among attribute reducts and absolute attribute reduct are investigated.Moreover,information loss based on information entropy for attribute reducts is defined,which can measure information loss after attribute reduction has been conducted.The old concepts that attribute reduction can not lose information are improved,and attribute reduction and classification can be further investigated from information loss and information entropy.

Key words: rough sets, attribute reduction, information entropy, joint entropy, information loss

中图分类号:

TP18

邓大勇, 薛欢欢, 苗夺谦, 卢克文. 属性约简准则与约简信息损失的研究[J]. 电子学报, 2017, 45(2): 401-407.

DENG Da-yong, XUE Huan-huan, MIAO Duo-qian, LU Ke-wen. Study on Criteria of Attribute Reduction and Information Loss of Attribute Reduction[J]. Acta Electronica Sinica, 2017, 45(2): 401-407.

参考文献

[1] Hobbs J R.Granularity[A].Proc of the Ninth In-ternational Joint Conference on Artificial Intelligece[C].Los Angeles,1985.432-435.
[2] Lin T Y.Granular Computing[M].Announcementof the BASIC Special Interest Group on Granular Computing,1997.
[3] Zadel L A.Fuzzy sets[J].Information and Control,1965,8(3):338-353.
[4] Pawlak Z.Rough sets[J].International Journal of Computer and Information Sciences,1982,11(5):341-356.
[5] Pawlak Z.Rough Sets-Theoretical Aspect of Reasoning about Data[M].Dordrecht:Kluwer Academic Publishers,1991.
[6] 王国胤.Rough集理论与知识获取[M].西安:西安交通大学出版社,2001. Wang Guoyin.Rough Set Theory and Knowledge Acquisition[M].Xi'an:Xi'an Jiaotong University Press,2001.(in Chinese)
[7] Qian Y H,Liang J Y,Pedrycz W,et al.Positive approximation:An accelerator for attribute reduction in rough set theory[J].Artificial Intelligence,2010,174:597-618.
[8] 张钹,张铃.问题求解理论及应用[M].北京:清华大学出版社,1990. Zhang Bo,Zhang Ling.Theories and Applications for Problem Solving[M].Beijing:Tsinghua University Press,1990.(in Chinese).
[9] 李德毅,孟海军,史雪梅.隶属云和隶属云发生器[J].计算机研究与发展,1995,32(6):16-18. Li Deyi,Meng Haijun,Shi Xuemei.Membership clouds and Membership cloud generators[J].Journal of Computer Research and Development,1995,32(6):16-18.(in Chinese)
[10] Pawlak Z,.Skowron A.Rough membership functions[A].Adances in the Dempster Shafer Theory of Evidence[M].John Wiley,New York,1994.251-271.
[11] 苗夺谦,胡桂荣.知识约简的一种启发式算法[J].计算机研究与发展,1999,36(6):681-684. Miao Duoqian,Hu Guirong.A heuristic algorithm for reduction of knowledg[J].Journal of Computer Research and Development,1999,36(6):681-684.(in Chinese)
[12] 王国胤,于洪,杨大春.基于条件信息熵的决策表约简[J].计算机学报,2002,25(7):759-766. Wang Guoyin,Yu Hong,Yang Dachun.Decision table reduction on conditional information entropy[J].Chinese Journal of Computers,2002,25(7):759-766.(in Chinese)
[13] 杨明.决策表中基于条件信息熵的近似约简[J].电子学报,2007,35(11):2156-2160. Yang Ming.Approximate reduction based on conditional information entropy in decision tables[J].Acta Eletronica Sinica,2007,35(11):2156-2160.(in Chinese)
[14] Liang J Y,Chin K.S,Dang C.Y.A new method for measuring uncertainty and fuzziness in rough set theory[J].International Journal of General Systems,2002,31(4):331-342.
[15] 梁吉业,李德玉.信息系统中的不确定性与知识获取[M].北京:科学出版社,2005. Liang Jiye,Li Deyu.Uncertainty and Knowledge Acquisition in Information Systems[M].Beijing:Science Press,2005.(in Chinese)
[16] 张文修,魏玲,祁建军.概念格的属性约简理论与方法[J].中国科学 E辑信息科学,2005,35(6):628-639. Zhang Wenxiu,Wei Ling,Qi Jianjun.Theory and method of attribute reduction for concept lattices[J].Science in China Ser.E Information Sciences,2005,35(6):628-639.(in Chinese)
[17] 胡清华,于达仁,谢宗霞.基于邻域粒化和粗糙逼近的数值属性约简[J].软件学报,2008,19(3):640-649. Hu Qinghua,Yu Daren,Xie Zongxia.Numerical attribute reduction based on neighborhood granulation and rough approximation[J].Journal of Software,2008,19(3):640-649.(in Chinese)
[18] Jia Xiuyi,Li Weiwei,Shang Lin,et al.An optimization view-point on decision-theoretic rough set model[A].LNCS6954:Proceedings of the 6^th International Conference on Rough Sets and Knowledge Technology(RSKT11)Banff,Canada,Oct9-12,2011[C].Berlin,Heidelberg:Springer-Verlag,2011.457-465.
[19] 滕书华.基于粗糙集理论的不确定性度量和属性约简方法研究[D].国防科学技术大学,2010. Teng Shuhua.Study on methods for uncertainty measure and attribute reduction based on rough set theory[D].National University of Defense Technology,2010.(in Chinese)
[20] 张文修,仇国芳,吴伟志.粗糙集属性约简的一般理论[J].中国科学 E辑信息科学,2005,35(12):1304-1313. Zhang Wenxiu,Chou Guofang,Wu Weizhi.Generalized theory of attribute reduction in rough sets[J].Science in China Ser.E Information Sciences,2005,35(12):1304-1313.(in Chinese)
[21] 徐久成,孙林.一种新的基于决策熵的决策表约简方法[J].重庆邮电大学学报(自然科学版),2009,21(4):479-483. Xu Jiuchen,Sun Lin.New reduction method based on decision information entropy in decision table[J].Journal of Chongqing University of Posts and Telecommunications(Natural Science Editon),2009,21(4):479-483.(in Chinese)
[22] 周杰.概率粗糙集模型的知识获取算法研究[D].同济大学,2011. Zhou Jie.Research on knowledge acquisition algorithms in probabilistic rough set models[D].Tongji University,2011.(in Chinese)
[23] 高灿.基于粗糙集理论的机器学习方法研究[D].同济大学,2013. Gao Can.Rough sets~based machine learning research[D].Tongji University,2013.(in Chinese)
[24] 叶中行.信息论基础[M].高等教育出版社,2007. Ye Zhongxing.Information Theory Foundation[M].Higher Education Press,2007.(in Chinese)
[25] 邓大勇,黄厚宽,李向军.不一致决策系统中约简之间的比较[J].电子学报,2007,35(2):252-255. Deng Dayong,Huang Houkuan,Li Xiangjun.Comparison of various types of reductions in inconsistent system[J].Acta Eletronica Sinica,2007,35(2):252-255.(in Chinese)
[26] 邓大勇.基于粗糙集的数据约简及粗糙集扩展模型的研究[D].北京交通大学,2007. Deng Dayong.Research on data reduction based on rough sets and extension of rough set models[D].Beijing Jiaotong University,2007.(in Chinese)

属性约简准则与约简信息损失的研究

Study on Criteria of Attribute Reduction and Information Loss of Attribute Reduction

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	张宏伟, 张小虎, 曹勇. 贝叶斯序贯重要性积分滤波器[J]. 电子学报, 2022, 50(4): 823-831.
[2]	陈孟元, 丁陵梅, 张玉坤. 基于改进关键帧选取策略的快速PL-SLAM算法[J]. 电子学报, 2022, 50(3): 608-618.
[3]	胡钢, 牛琼, 许丽鹏, 卢志宇, 过秀成. 基于网络超链接信息熵的节点重要性序结构演化建模分析[J]. 电子学报, 2022, 50(11): 2638-2644.
[4]	魏钰轩, 陈莹. 基于自适应层信息熵的卷积神经网络压缩[J]. 电子学报, 2022, 50(10): 2398-2408.
[5]	李彦苍, 巩翔宇. 基于信息熵的改进狮群算法及其在组合优化中的应用[J]. 电子学报, 2021, 49(8): 1577-1585.
[6]	周涛, 陆惠玲, 任海玲, 霍兵强. 基于粗糙集的属性约简算法综述[J]. 电子学报, 2021, 49(7): 1439-1449.
[7]	盛魁, 王伟, 卞显福, 董辉, 马健. 混合数据的邻域区分度增量式属性约简算法[J]. 电子学报, 2020, 48(4): 682-696.
[8]	王树亮, 毕大平, 阮怀林, 杜明洋, 潘继飞. 基于信息熵准则的认知雷达机动目标跟踪算法[J]. 电子学报, 2019, 47(6): 1277-1284.
[9]	邓大勇, 葛雅雯, 黄厚宽. 属性约简簇的优化选择[J]. 电子学报, 2019, 47(5): 1111-1120.
[10]	程玉胜, 赵大卫, 王一宾, 裴根生. 非平衡化标签补全核极限学习机多标签学习[J]. 电子学报, 2019, 47(3): 719-725.
[11]	吴宁博, 彭长根, 牟其林. 面向关联属性的差分隐私信息熵度量方法[J]. 电子学报, 2019, 47(11): 2337-2343.
[12]	邓大勇, 卢克文, 黄厚宽, 邓志轩. 概念的属性约简及异构数据概念漂移探测[J]. 电子学报, 2018, 46(5): 1234-1239.
[13]	胡峰, 王蕾, 周耀. 基于三支决策的不平衡数据过采样方法[J]. 电子学报, 2018, 46(1): 135-144.
[14]	赵旭, 颜学雄, 王清贤, 魏强, 李继中. 面向资源泄漏的浏览器沙箱测试方法[J]. 电子学报, 2017, 45(7): 1775-1783.
[15]	续欣莹, 张扩, 谢珺, 谢刚. 基于互信息下粒子群优化的属性约简算法[J]. 电子学报, 2017, 45(11): 2695-2704.