全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于差别信息树的roughset属性约简算法

DOI: 10.13195/j.kzyjc.2014.0724, PP. 1531-1536

Keywords: 粗糙集,差别矩阵,属性约简,差别信息树

Full-Text   Cite this paper   Add to My Lib

Abstract:

差别矩阵为粗糙集属性约简提供了很好的思路,但差别矩阵中存在冗余的重复和父集元素.为了消除这些冗余元素,提出一棵有序树:差别信息树,该树能消除差别矩阵中的重复元素,同时在大多数情况下也能完全消除父集元素,实现对差别矩阵中非空元素的压缩存储.为了验证差别信息树的有效性,提出一种属性约简完备算法,并使该算法的时间复杂度降为??(∣??∣∣??∣2).

References

[1]  Pawlak Z. Rough sets[J]. Int J of Computer and Information Science, 1982, 11(5): 341-356.
[2]  Thangavel K, Pethalakshmi A. Dimensionality reduction based on rough set theory: A review[J]. Applied Soft Computing, 2009, 9(1): 1-12.
[3]  Skowron A, Rauszer C. The discernibility matrices and functions in information systems[C]. Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory. Dordrecht, 1991: 331-362.
[4]  Yao Y Y, Zhao Y. Discernibility matrix simplification for constructing attribute reducts[J]. Information Sciences, 2009, 179(5): 867-882.
[5]  Hu Q H, Xie Z X, Yu D R. Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation[J]. Pattern Recognition, 2007, 40(12): 3509-3521.
[6]  Yuhua Qian, Jiye Liang, Witold Pedrycz, et al. Positive approximation: An accelerator for attribute reduction in rough set theory[J]. Artificial Intelligence, 2010, 174(9/10): 597-618.
[7]  Qian Y H, Liang J Y. Combination entropy and combination granulation in rough set theory[J]. Int J of Uncertainty, Fuzziness and Knowledge-Based Systems, 2008, 16(2): 179-193.
[8]  蒋瑜, 王燮, 叶振. 基于差别矩阵的Rough 集属性约简算法[J]. 系统仿真学报, 2008, 20(14): 3717-3720.
[9]  (Jiang Y, Wang X, Ye Z. Attribute reduction algorithm of rough sets based on discernibility matrix[J]. J of System Simulation, 2008, 20(14): 3717-3720.)
[10]  Chen D G, Zhao S Y, Zhang L, et al. Sample pair selection for attribute reduction with rough set[J]. IEEE Trans on Knowledge and Data Engineering, 2012, 24(11): 2080-2093.
[11]  Yang M, Yang P. A novel condensing tree structure for rough set feature selection[J]. Neurocomputing, 2008, 71(4): 1092-1100.
[12]  杨明, 吕静. 一种基于C-Tree 的属性约简增量式更新算法[J]. 控制与决策, 2012, 27(12): 1769-1775.
[13]  (Yang M, L¨u J. An incremental updating algorithm for attribute reduction based on C-Tree[J]. Control and Decision, 2012, 27(12): 1769-1775.)
[14]  Neil Mac Parthaláin, Qing Shen, Richard Jensen. A distance measure approach to exploring the rough set boundary region for attribute reduction[J]. IEEE Trans on Knowledge and Data Engineering, 2010, 22(3): 305-317.
[15]  Jiang Yu. Minimal attribute reduction for rough set based on attribute enumeration tree[J]. Int J of Advancements in Computing Technology, 2012, 4(19): 391-399.
[16]  蒋瑜, 王鹏, 王燮, 等. 基于差别矩阵的属性约简完备算法[J]. 计算机工程与应用, 2007, 43(19): 185-187.
[17]  (Jiang Y, Wang P, Wang X, et al. Complete algorithm for attribute reduction based on discernibility matrix[J]. Computer Engineering and Applications, 2007, 43(19): 185-187.)
[18]  王宾, 陈善本. 一种基于差别矩阵的属性约简完备算法[J]. 上海交通大学学报, 2004, 38(1): 43-46.
[19]  (Wang B, Chen S B. A complete algorithm for attribute reduction based on discernibility matrix[J]. J of Shanghai Jiaotong University, 2004, 38(1): 43-46.)

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133