南京大学学报(自然科学版) ›› 2013, Vol. 49 ›› Issue (2): 244–249.

• • 上一篇    下一篇

 概念格上的近似概念*

  李进金,李克典**,吴燕华   

  • 出版日期:2015-10-23 发布日期:2015-10-23
  • 作者简介:(漳州师范学院数学与信息科学系,漳州,363000)
  • 基金资助:
     国家自然科学基金(10971186,11061004,71140004),福建省教育厅资助省属高校科研专项基金(JK2011031)

 The approximation concept of concept lattices

 Li .Jin-.Jin ,Li Ke -Dian ,Wu Yan-Hua   

  • Online:2015-10-23 Published:2015-10-23
  • About author: (Department of Mathematics and information Science,Zhangzhou Normal University,Zhangzhou,363000 , China)

摘要:  探讨在形式背景中的任意概念,由其外延形成的上近似概念和下近似概念,以及由其内涵形
成的上近似概念和下近似概念这四者之间的关系.在形式背景中,从任意对象集(或属性集)出发,利用
确定的概念格建立该对象(或属性)的下近似概念外延(或内涵)与上近似外延(或内涵),从而得到由对
象(或属性)集形成的上近似概念和下近似概念;对于任意一概念,由其外延形成的上近似概念和下近似
概念是它木身,且由其内涵形成的上近似概念和下近似概念也是它木身.通过实例说明这种方法的可行
性,由此得到概念格理论中,生成上(下)近似概念的一种有效方法.

Abstract:  The notion of the formal concept in a formal context is studied in this paper.The relationship among the
upper and lower approximation concepts formed respectively by the extent and intent is investigated. For any object
(or attribute)set in a formal context,the lower and upper approximation concept extents (or intents)can be estab-
lished via the concept lattice.Thus the lower and upper approximation concepts formed by its extent (or attribute)set
can be obtained. For any concept of the concept lattice,the upper and the lower approximation concepts formed re
spectivcly by the extent and intent arc all itself. Finally,an example is given to show the validity of our method for
generating the upper (or lower) approximation concept of the concept lattice.

[1]Ganter B, Wille R. Formal concept analysis. Springer,1999,284.
[2]Zhang W X,Qiu G F. Uncertain decision making based on rough sets. Beijing;Tsinghua University
Publishing,2005,249-255.(张文修,仇国芳.基于粗糙集的不确定决策.北京:清华大学出版社,2005:249一255).
[3]Miao D Q, Wang G Y,Liu Q, et al. Granular computing; Past,present and prospects. Beijing;
Science Publishing, 2001,262一274.(苗夺谦,王国胤,刘清等,粒计算:过去,现在与展望.北京:科学出版社,2001 ;262-274).
[4]Zhang W X, Yao Y Y,Leung Y. Rough set and concept lattices. Xi’an; Xi’an Jiaotong University
Publishing,2006,357-380.(张文修,姚一豫,梁怡.粗糙集与概念格.西安:西安交通大学出版社,2006:357一380).
[5]Zhang W X,Wei L,Qi J J. Attribute reduction theory and methods of concept lattices. Science in
China E:lnformation Science,2005,35(6):628一639.(张文修,魏玲,祁建军.概念格的属性约
简理论与方法.中国科学F辑:信息科学,2005, 35(6):628一639).
[6]Qiu G F, Chen J. Concept knowledge system and concept information granular lattice. Journal of
Engineering Mathematics,2005,22(6):963一969.(仇国芳,陈劲.概念知识系统与概念信息粒格.工程数学学报,2005,22(6):963-969).
[7]Liang J Y,Wang J H. An algorithm for extracting rulrgenerating sets based on concept lattice.
Compute Research and Development,2001,41 (8) :1339- 1344.(梁吉业,王俊红.基于概念格
的规则产生集挖掘算法.计算机研究与发展,2004,41 (8):1339一1344).
[8]Wu W Z,Mi J S,Zhang W X. Combination of ap- proximation spaces and its applications. Journal of
Engineering Mathematics, 2002,19(3):93一94. (吴伟志,米据生,张文修.近似空间的合成及其应用.Z程数学学报,2002,19(3):93-94).
[9]Yao Y Q, Mi J S, Li Z J,et al.The construction of fuzzy cncept lattices based on(θ , σ)一fuzzy
rough approximation operators. Fundamenta in- formaticac,2011,111(1):33一45.
[10]Qian Y H,Lung J Y,Yao Y Y,et al. MGRS: A multi-granulation rough set, Information Sci- ences,2010,108(6):949一970.
[11]Xu H S, Wang T Z. The research of constructing rough concept lattices model. Applied Mechanics and Materials,2011,63一65:664一667.
[12]Mi J S,Leung Y, Wu W Z. Approaches to attribute  reduction in conceptlattices induced byaxialitics. Knowledge-Based Systems,2010,23(6):504一511.
[13]Carpincto C, Romano G. Information tetrieval through hybrid navigation of lattice representations.
International Journal of Human Computer Studies, 1996,45:553一578.
[14]Hu K Y, Lu Y C, Shi C Y. Concept lattice and its application progress. Journal of Tsinghua University
(Natural Sciences),2000,40(9);77-81.(胡可云,陆玉昌,石纯一概念格及其应用进展.清华大学学报(自然科学),2000,40(9);77-81 ).
[15]Zhu F, Wang F Y. Some basic results of covering generalized rough sets. Pat tern Recognition and
Artificial Intelligence,2002,15(1):6一12.(祝峰,王飞跃.关于覆盖广义粗集的一些基木结果. 模式识别与人工智能,2002,15(1):6-12).
[16]Zhu F, He H C. The axiomatization of the rough set. Journal of Computers, 2000,23(3):330一333.(祝峰,何华灿.粗集的公理化.计算机学
报,2000, 23 (3):330一333).
[17]Li L F, Wang G J. A method to rxplore the teduction of concept lattice. Computer Engineering and Appli-
canons,2006,42(40):147-119.(李立峰,王国俊. 一种求概念格属性约简的方法.计算机工程与应用,2006,42(40):147一149 .
[18]Wang L J,Yang X B,Yang J Y,et al. A new in- comlct multigranulation rough set. Journal of  Nanjing University(Natural Sciences),
2012,48 (4):436一444.(王丽娟,杨习贝,杨静宇等一种新的不完备多粒度粗糙集.南京大学学报(自然科学),2012,48(4):436一444).
[19]Wei L, Qi J J. Relation between concept lattice re duction and rough set reduction. Knowledge- Based Systems,2010,23:934一938.




No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!