一种基于关系矩阵的决策表正域约简算法

计算机科学 ›› 2013, Vol. 40 ›› Issue (11): 261-264.

一种基于关系矩阵的决策表正域约简算法

景运革,李天瑞

山西运城学院公共计算机教学部运城044000;山西运城学院公共计算机教学部运城044000

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
本文受国家自然科学基金项目(60873108)资助

Reduction Algorithm of Positive Domain for Decision Table Based on Relationship Matrix

JING Yun-ge and LI Tian-rui

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 研究了粗糙集属性约简问题,引入等价关系矩阵的诱导矩阵和矩阵的λ-截矩阵等概念来计算决策表的上、下近似集,进而给出基于关系矩阵的决策表正域求解方法,并从理论上证明了该方法的正确性。提出了粗糙集属性核的启发式约简,并用该方法计算最小约简,在属性动态增加时,用矩阵快速更新的方法来改变属性等价关系矩阵,可以快速地计算属性变化后的正域。最后,通过实例分析说明了属性约简的具体操作方法和算法的有效可行性。

关键词: 粗糙集,决策表,正域约简,关系矩阵

Abstract: This paper discussed the problem of attributes reduction in rough set．We first introduced both induced matrix and λ-cut matrix of equivalence relation matrix to calculate upper and lower approximation of decision tables and then proposed a reduction algorithm of positive domain for decision table based on relationship matrix with the prove of correctness in theory．What’s more,a heuristic reduction of attribute core in rough set was proposed to calculate the minimum reduction．With dynamical updating of attributes,we updated attribute equivalence relationship matrix through the method of update of matrix and calculated the positive domain after update of attribute rapidly．The example confirms the feasibility and effectiveness of proposed operation and method of attribute reduction.

Key words: Rough set,Decision tables,Positive domain reduction,Relation matrix

景运革,李天瑞. 一种基于关系矩阵的决策表正域约简算法[J]. 计算机科学, 2013, 40(11): 261-264. https://doi.org/

JING Yun-ge and LI Tian-rui. Reduction Algorithm of Positive Domain for Decision Table Based on Relationship Matrix[J]. Computer Science, 2013, 40(11): 261-264. https://doi.org/

参考文献

[1] Pawalk Z．Rough Sets[J]．International Journal of Computerand Information Science,1982,1(5):341-356
[2] Jensen R,Shen Q.Fuzzy-rough sets assisted attribute selection[J].IEEE Transactions on Fuzzy Systems,2007,5(1):73-89
[3] Skowron A,Swiniarski R,Synak P.Approximation Spaces andInformation Granulation[C]∥Proc of the International Confe-rence on Rough Sets and Current Trends in Computing.Uppsala,Sweden,2004:116-126
[4] Guan J W,Bell D A,Guan Z．Matrix Computation for Information System[J]．Information Sciences,2001,131(1-4):129-156
[5] 杨勇．粗糙集的矩阵定义[J]．计算机工程与应用,2007,3(14):1-2
[6] Liu Gui-long．The Axiomatization of Rough Set Upper Approximation Operation[J]．Fundamenta Informaticae,2006,9(3):331-342
[7] 王磊,等．基于矩阵的粗糙集上下近似的计算方法[J].模式识别与人工智能,2011,4(6):757-762
[8] 刘清．Rough集及Rough推理[M]．北京:科学出版社,2001:60-70
[9] 陈昊,等．变精度粗糙集的属性核和最小属性约简算法[J].计算机学报,2012,5(5):1012-1016
[10] Cheng Y．The incremental method for fast computing the rough fuzzy approximations[J].Data & Knowledge Engineering,2011,70:84-100
[11] Li T R,Ruan D,Gerret W,et al．A rough set based characteristic relation approach for dynamic attribute generalization in data mining[J]．Knowledge-based Systems,2007,20(5):485-494

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed