李美争,李磊军,米据生,解滨.概念格中基于粗糙熵的属性约简方法[J].计算机科学,2018,45(1):84-89
概念格中基于粗糙熵的属性约简方法
Rough Entropy Based Algorithm for Attribute Reduction in Concept Lattice
投稿时间:2017-03-03  修订日期:2017-07-02
DOI:10.11896/j.issn.1002-137X.2018.01.013
中文关键词:  概念格,属性约简,启发式算法,粗糙熵
英文关键词:Concept lattice,Attribute reduction,Heuristic algorithm,Rough entropy
基金项目:本文受国家自然科学基金项目(61502144,7,61672206,2),河北省高等学校自然科学基金项目(QN2017095,QN2016133),河北省高校创新团队领军人才培育计划项目(LJRC022),河北省博士后择优资助
作者单位E-mail
李美争 河北师范大学信息技术学院 石家庄050024
河北省网络与信息安全重点实验室 石家庄050024 
 
李磊军 河北师范大学数学与信息科学学院 石家庄050024
河北省计算数学与应用重点实验室 石家庄050024 
liljun1985@163.com 
米据生 河北师范大学数学与信息科学学院 石家庄050024
河北省计算数学与应用重点实验室 石家庄050024 
 
解滨 河北师范大学信息技术学院 石家庄050024
河北省网络与信息安全重点实验室 石家庄050024 
 
摘要点击次数: 546
全文下载次数: 342
中文摘要:
      属性约简是概念格理论的研究重点内容之一。通过将粗糙熵引入概念格理论中,定义了一种粗糙熵约简。首先,基于所有概念外延定义了形式背景的粗糙熵,并分析了它的性质;其次,定义了形式背景的粗糙熵约简,并揭示了粗糙熵约简与概念格约简之间的关系;在此基础上,基于属性重要度设计了计算粗糙熵的启发式算法,并通过实验验证了该算法的有效性。
英文摘要:
      Attribute reduction is one of the crucial issues in the theory study of concept lattice.In this paper,rough entropy was introduced to conduct a kind of attribute reduction.Firstly,rough entropy in a formal context was defined via the whole set of all concept extents,and the properties of rough entropy were analyzed.Secondly,a rough entropy based attribute reduction of a formal context was given,and the relationship between the rough entropy-based reduct and the concept lattice-based reduct was revealed.Based on this,a heuristic algorithm based on the attribute significance was proposed to compute a rough entropy-based reduct,and some numerical experiments were conducted to show the efficiency of the proposed methods.
查看全文  查看/发表评论  下载PDF阅读器