ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2014, Vol. 51 ›› Issue (12): 2623-2632.doi: 10.7544/issn1000-1239.2014.20131048

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

序粒度标记结构及其粗糙近似

吴伟志1,2,高仓健1,李同军1   

  1. 1(浙江海洋学院数理与信息学院 浙江舟山 316022);2(计算智能重庆市重点实验室 重庆 400065) (wuwz@zjou.edu.cn)
  • 出版日期: 2014-12-01
  • 基金资助: 
    基金项目:国家自然科学基金项目(61272021,61075120,11071284,61173181);浙江省自然科学基金重点项目(LZ12F03002);计算智能重庆市重点实验室开放基金项目(CQ-LCI-2013-01)

Ordered Granular Labeled Structures and Rough Approximations

Wu Weizhi1,2, Gao Cangjian1, Li Tongjun1   

  1. 1(School of Mathematics, Physics and Information Science, Zhejiang Ocean University, Zhoushan, Zhejiang 316022); 2(Chongqing Key Laboratory of Computational Intelligence, Chongqing 400065)
  • Online: 2014-12-01

摘要: 粒计算是知识表示和数据挖掘的一个重要方法.它模拟人类思考模式,以粒为基本计算单位,以处理大规模复杂数据和信息等建立有效的计算模型为目标.针对具有多粒度标记的序信息系统的知识获取问题,提出了基于序粒度标记结构的粗糙近似.首先,介绍了序标记结构的概念,并在序标记结构的对象集中定义了一个优势关系,同时给出了由优势关系导出的优势标记块,并进一步定义了基于优势关系的集合的序下近似与序上近似和序标记下近似与序标记上近似的概念,给出了近似算子的一些性质.证明了由序标记结构导出的集合的下近似质量与上近似质量是一对对偶的必然性测度与可能性测度.最后,定义了多粒度序标记结构的概念,并讨论了多粒度序标记结构中不同粒度下近似集之间的关系.

关键词: 近似算子, 粒计算, 标记块, 序标记结构, 粗糙集

Abstract: Granular computing, which imitates human beings thinking, is an approach for knowledge representation and data mining. Its basic computing unit is called granule, and its objective is to establish effective computation models for dealing with large scale complex data and information. In order to study knowledge acquisition in ordered information systems with multi-granular labels, rough set approximations based on ordered granular labeled structures are explored. The concept of ordered labeled structures is first introduced. A dominance relation on the universe of discourse from an ordered labeled structure is also defined. Dominated labeled blocks determined by the dominance relation are constructed. Ordered lower approximations and ordered upper approximations, as well as ordered labeled lower approximations and ordered labeled upper approximations of sets based on dominance relations, are then proposed. Properties of approximation operators are examined. It is further proved that the qualities of lower and upper approximations of a set derived from an ordered labeled structure are a dual pair of necessity measure and possibility measure. Finally, multi-scale ordered granular labeled structures are defined and relationships among rough approximations with different scales induced from multi-scale ordered granular labeled structures are discussed.

Key words: approximation operators, granular computing, labeled blocks, ordered labeled structures, rough sets

中图分类号: