ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2018, Vol. 55 ›› Issue (11): 2395-2405.doi: 10.7544/issn1000-1239.2018.20170607

• 人工智能 • 上一篇    下一篇

粒化单调的条件邻域熵及其相关属性约简

周艳红1,2,3,张贤勇1,3,莫智文1,3   

  1. 1(College of Mathematics and Software Science, Sichuan Normal University, Chengdu 610068); 2(College of Computer, Civil Aviation Flight University of China, Guanghan, Sichuan 618307); 3(Institute of Intelligent Information and Quantum Information, Sichuan Normal University, Chengdu 610068)
  • 出版日期: 2018-11-01
  • 基金资助: 
    国家自然科学基金项目(61673285,61203285,11671284);高等学校博士学科点专项科研基金项目(20135134110003);四川省科技计划项目(2017JY0197,2017JQ0046)

Conditional Neighborhood Entropy with Granulation Monotonicity and Its Relevant Attribute Reduction

Zhou Yanhong1,2,3, Zhang Xianyong1,3, Mo Zhiwen1,3   

  1. 1(四川师范大学数学与软件科学学院 成都 610068); 2(中国民用航空飞行学院计算机学院 四川广汉 618307); 3(四川师范大学智能信息与量子信息研究所 成都 610068) (zhouyanhong515@163.com)
  • Online: 2018-11-01

摘要: 在邻域粗糙集中,基于信息度量的属性约简具有重要应用意义.然而,条件邻域熵具有粒化非单调性,故其属性约简具有应用局限性.对此,采用粒计算技术及相关的3层粒结构,构建具有粒化单调性的条件邻域熵,进而研究其相关属性约简.首先,揭示条件邻域熵的粒化非单调性及其根源;其次,采用3层粒结构,自底向上构建一种新型条件邻域熵,获得其粒化单调性;进而,基于粒化单调的条件邻域熵,建立属性约简及启发式约简算法;最后,采用UCI(University of CaliforniaIrvine)数据实验,验证改进条件邻域熵的单调性与启发式约简算法的有效性.所得结果表明:新建条件邻域熵具有粒化单调性,改进了条件邻域熵,其诱导的属性约简具有应用前景.

关键词: 邻域粗糙集, 条件邻域熵, 粒计算, 3层粒结构, 属性约简

Abstract: In the neighborhood rough sets, the attribute reduction based on information measures holds fundamental research value and application significance. However, the conditional neighborhood entropy exhibits granulation non-monotonicity, so its attribute reduction has the research difficulty and application limitation. Aiming at this issue, by virtue of the granular computing technology and its relevant three-layer granular structure, a novel conditional neighborhood entropy with granulation monotonicity is constructed, and its relevant attribute reduction is further investigated. At first, the granulation non-monotonicity and its roots of the conditional neighborhood entropy are revealed; then, the three-layer granular structure is adopted to construct a new conditional neighborhood entropy by the bottom-up strategy, and the corresponding granulation monotonicity is gained; furthermore, relevant attribute reduction and its heuristic reduction algorithm are studied, according to this proposed information measure with the granulation monotonicity; finally, data experiments based on the UCI (University of CaliforniaIrvine) machine learning repository are implemented, and thus they verify both the granulation monotonicity of the constructed conditional neighborhood entropy and the calculation effectiveness of the related heuristic reduction algorithm. As shown by the obtained results, the established conditional neighborhood entropy has the granulation monotonicity to improve the conditional neighborhood entropy, and its induced attribute reduction has broad application prospects.

Key words: neighborhood rough set, conditional neighborhood entropy, granular computing, three-layer granular structure, attribute reduction

中图分类号: