计算机科学 ›› 2020, Vol. 47 ›› Issue (3): 87-91.doi: 10.11896/jsjkx.190500162

• 数据库&大数据&数据科学 • 上一篇    下一篇

基于局部可调节多粒度粗糙集的属性约简

侯成军1,米据生1,梁美社1,2   

  1. (河北师范大学数学与信息科学学院 石家庄050024)1;
    (石家庄职业技术学院科技发展与校企合作部 石家庄050081)2
  • 收稿日期:2019-05-30 出版日期:2020-03-15 发布日期:2020-03-30
  • 通讯作者: 米据生(mijsh@263.net)
  • 基金资助:
    国家自然科学基金(61573127);河北省自然科学基金(A2018210120);河北师范大学研究生创新项目基金(CXZZSS2017046)

Attribute Reduction Based on Local Adjustable Multi-granulation Rough Set

HOU Cheng-jun 1,MI Ju-sheng1,LIANG Mei-she1,2   

  1. (College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050024, China)1;
    (Department of Scientific Development and Technology and School-Business Cooperation, Shijiazhuang University of Applied Technology, Shijiazhuang 050081, China)2
  • Received:2019-05-30 Online:2020-03-15 Published:2020-03-30
  • About author:HOU Cheng-jun,postgraduate.His research interests include rough set and granular computing. MI Ju-sheng,Ph.D,professor.His research interests include granular computing and approximate reasoning.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61573127), Natural Science Foundation of Hebei province (A2018210120), Graduate Innovation Project Foundation of Hebei Normal University (CXZZSS2017046).

摘要: 经典的多粒度粗糙集模型采用多个等价关系(多粒度结构)来逼近目标集。根据乐观和悲观策略,常见的多粒度粗糙集分为两种类型:乐观多粒度粗糙集和悲观多粒度粗糙集。然而,这两个模型缺乏实用性,一个过于严格,另一个过于宽松。此外,多粒度粗糙集模型由于在逼近一个概念时需要遍历所有的对象,因此非常耗时。为了弥补这一缺点,进而扩大多粒度粗糙集模型的使用范围,首先在不完备信息系统中引入了可调节多粒度粗糙集模型,随后定义了局部可调节多粒度粗糙集模型。其次,证明了局部可调节多粒度粗糙集和可调节多粒度粗糙集具有相同的上下近似。通过定义下近似协调集、下近似约简、下近似质量、下近似质量约简、内外重要度等概念,提出了一种基于局部可调节多粒度粗糙集的属性约简方法。在此基础上,构造了基于粒度重要性的属性约简的启发式算法。最后,通过实例说明了该方法的有效性。实验结果表明,局部可调节多粒度粗糙集模型能够准确处理不完备信息系统的数据,降低了算法的复杂度。

关键词: 不完备信息系统, 粗糙集, 多粒度, 近似质量, 属性约简

Abstract: In classical multi-granulation rough set models,multiple equivalent relations (multiple granular structures) are used to approximate a target set.According to optimistic and pessimistic strategies,there are two types of common multi-granulation called optimistic multi-granulation and pessimistic multi-granulation respectively.The two combination rules seem to lack of practicability since one is too restrictive and the other too relaxed.In addition,multi-granulation rough set model is highly time-consuming because it is necessary to scan all the objects when approximating a concept.To overcome this disadvantage and enlarge the using range of multi-granulation rough set model,this paper firstly introduced the adjustable multi-granulation rough set model in incomplete information system and defined the local adjustable multi-granulation rough set model.Secondly,this paper proved that local adjustable multi-granulation rough set and adjustable multi-granulation rough set have the same upper and lower approximations.By defining the concepts of lower approximation cosistent set,lower approximation reduction,lower approximation quality,lower approximation quality reduction,and importance of internal and external,a local adjustable multi-granulation rough set model for attribute reduction was proposed.Furthermore,a heuristic algorithm of attribute reduction was constructed based on granular significance.Finally,the effectiveness of the method was illustrated through examples.The experimental results show that local adjustable size rough set model can accurately process the data of incomplete information system,and it can reduce the complexity of the algorithm.

Key words: Approximate quality, Attribute reduction, Incomplete information system, Multi-granulation, Rough set

中图分类号: 

  • TP18
[1]PAWLAK Z.Rough sets[J].International Journal of Computer and Information Sciences,1982,11(5):341-356.
[2]PAWLAK Z.Rough sets:some extensions[J].Information Sciences,2007,177(1):3-27.
[3]PAWLAK Z.Rough sets:Theoretical aspects of reasoning about data[M].Kluwer Academic Publishers,Dordrecht,1991.
[4]QIAN Y H,LIANG J Y,PEDRYCZ W.Positive approximation: an accelerator for attribute reduction in rough set theory[J].Artificial Intellegence.2010,174 (9):597-618.
[5]MA X A,WANG G Y,YU H,et al.Decision region distribution preservation reduction in decision-theoretic rough set model[J]. Information Sciences,2014,278:614-640.
[6]YAO Y Y,ZHAO Y.Attribute reduction in decision-theoretic rough set models[J].Information Sciences,2008,178(17):3356-3373.
[7]DU Y,HU Q H,ZHU P F,et al.Rule learning for classification based on neighborhood covering reduction[J].Information Sciences,2011,181 (24):5457-5467.
[8]LI J H,MEI C L,LV Y J.Incomplete decision contexts:Ap- proximate concept construction,rule acquisition and knowledge reduction[J].International Journal of Approximate Reasoning,2013,54(1):149-165.
[9]POLKOWSKI L,SKOWRON A.Rough mereology:A new paradigm for approximate reasoning[J].International Journal of Approximate Reasoning,1996,15(4):333-365.
[10]SHE Y H,HE X L.On the structure of the multigranulation rough set model[J].Knowledge-Based System,2012,36:81-92.
[11]QIAN Y H,LIANG J Y,WU W Z,et al.Information Granularity in Fuzzy Binary GrC Model[J].IEEE Transactions on Fuzzy Systems,2011,19(2):253-264.
[12]SWINIARSKI R,SKOWRON A.Rough set methods in feature selection and recognition[J].Pattern Recognition Letters,2003,24(6):833-849.
[13]WEI J M,WANG S Q,YUAN X J.Ensemble Rough Hypercuboid Approach for Classifying Cancers[J].IEEE Transactions on Knowledge and Data Engineering,2010,22(3):381-391.
[14]LIU Z G,YU H,WANG G Y.An automatic method to determine the number of clusters using decision-theoretic rough set[J].International Journal of Approximate Reasoning,2014,55(1):101-115.
[15]CHEN H M,LI T R,LUO C,et al.A decision-theoretic rough set approach for dynamic data mining[J].IEEE Transactions on Fuzzy Systems,2015,23(6):1-14.
[16]LIU D,LI T R,LIANG D C.Incorporating logistic regression to decision-theoretic rough sets for classifications[J].International Journal of Approximate Reasoning,2014,55(1):197-210.
[17]QIAN Y H,LIANG J Y,YAO Y Y,et al.A multigranulation rough set[J].Information Sciences,2010,180:949-970.
[18]XU W H,SUN W X,ZHANG X Y,et al.Multiple granulation rough set approach to ordered information systems[J].International Journal of General Systems,2012,41(5):475-501.
[1] 秦琪琦, 张月琴, 王润泽, 张泽华.
基于知识图谱的层次粒化推荐方法
Hierarchical Granulation Recommendation Method Based on Knowledge Graph
计算机科学, 2022, 49(8): 64-69. https://doi.org/10.11896/jsjkx.210600111
[2] 程富豪, 徐泰华, 陈建军, 宋晶晶, 杨习贝.
基于顶点粒k步搜索和粗糙集的强连通分量挖掘算法
Strongly Connected Components Mining Algorithm Based on k-step Search of Vertex Granule and Rough Set Theory
计算机科学, 2022, 49(8): 97-107. https://doi.org/10.11896/jsjkx.210700202
[3] 张源, 康乐, 宫朝辉, 张志鸿.
基于Bi-LSTM的期货市场关联交易行为检测方法
Related Transaction Behavior Detection in Futures Market Based on Bi-LSTM
计算机科学, 2022, 49(7): 31-39. https://doi.org/10.11896/jsjkx.210400304
[4] 许思雨, 秦克云.
基于剩余格的模糊粗糙集的拓扑性质
Topological Properties of Fuzzy Rough Sets Based on Residuated Lattices
计算机科学, 2022, 49(6A): 140-143. https://doi.org/10.11896/jsjkx.210200123
[5] 方连花, 林玉梅, 吴伟志.
随机多尺度序决策系统的最优尺度选择
Optimal Scale Selection in Random Multi-scale Ordered Decision Systems
计算机科学, 2022, 49(6): 172-179. https://doi.org/10.11896/jsjkx.220200067
[6] 杨斐斐, 沈思妤, 申德荣, 聂铁铮, 寇月.
面向数据融合的多粒度数据溯源方法
Method on Multi-granularity Data Provenance for Data Fusion
计算机科学, 2022, 49(5): 120-128. https://doi.org/10.11896/jsjkx.210300092
[7] 陈于思, 艾志华, 张清华.
基于三角不等式判定和局部策略的高效邻域覆盖模型
Efficient Neighborhood Covering Model Based on Triangle Inequality Checkand Local Strategy
计算机科学, 2022, 49(5): 152-158. https://doi.org/10.11896/jsjkx.210300302
[8] 孙林, 黄苗苗, 徐久成.
基于邻域粗糙集和Relief的弱标记特征选择方法
Weak Label Feature Selection Method Based on Neighborhood Rough Sets and Relief
计算机科学, 2022, 49(4): 152-160. https://doi.org/10.11896/jsjkx.210300094
[9] 王子茵, 李磊军, 米据生, 李美争, 解滨.
基于误分代价的变精度模糊粗糙集属性约简
Attribute Reduction of Variable Precision Fuzzy Rough Set Based on Misclassification Cost
计算机科学, 2022, 49(4): 161-167. https://doi.org/10.11896/jsjkx.210500211
[10] 王志成, 高灿, 邢金明.
一种基于正域的三支近似约简
Three-way Approximate Reduction Based on Positive Region
计算机科学, 2022, 49(4): 168-173. https://doi.org/10.11896/jsjkx.210500067
[11] 薛占熬, 侯昊东, 孙冰心, 姚守倩.
带标记的不完备双论域模糊概率粗糙集中近似集动态更新方法
Label-based Approach for Dynamic Updating Approximations in Incomplete Fuzzy Probabilistic Rough Sets over Two Universes
计算机科学, 2022, 49(3): 255-262. https://doi.org/10.11896/jsjkx.201200042
[12] 胡艳丽, 童谭骞, 张啸宇, 彭娟.
融入自注意力机制的深度学习情感分析方法
Self-attention-based BGRU and CNN for Sentiment Analysis
计算机科学, 2022, 49(1): 252-258. https://doi.org/10.11896/jsjkx.210600063
[13] 王栋, 周大可, 黄有达, 杨欣.
基于多尺度多粒度特征的行人重识别
Multi-scale Multi-granularity Feature for Pedestrian Re-identification
计算机科学, 2021, 48(7): 238-244. https://doi.org/10.11896/jsjkx.200600043
[14] 李艳, 范斌, 郭劼, 林梓源, 赵曌.
基于k-原型聚类和粗糙集的属性约简方法
Attribute Reduction Method Based on k-prototypes Clustering and Rough Sets
计算机科学, 2021, 48(6A): 342-348. https://doi.org/10.11896/jsjkx.201000053
[15] 王政, 姜春茂.
一种基于三支决策的云任务调度优化算法
Cloud Task Scheduling Algorithm Based on Three-way Decisions
计算机科学, 2021, 48(6A): 420-426. https://doi.org/10.11896/jsjkx.201000023
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!