计算机科学 ›› 2014, Vol. 41 ›› Issue (2): 236-239.

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

两类概念格的依赖空间理论

包永伟,王霞,吴伟志   

  1. 浙江海洋学院数理与信息学院 舟山316022;浙江海洋学院数理与信息学院 舟山316022;浙江海洋学院数理与信息学院 舟山316022
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金项目(61202206,1,61075120,1,11071284,6,11071281),浙江省自然科学基金重点项目(LZ12F03002)资助

Dependence Space Based on Two Types of Concept Lattices

BAO Yong-wei,WANG Xia and WU Wei-zhi   

  • Online:2018-11-14 Published:2018-11-14

摘要: 对象定向概念格和属性定向概念格是经典概念格的两种推广模型。首先,利用对象幂集上的一对对偶近似算子分别定义了对象定向概念格和属性定向概念格上的同余关系。其次,分别基于两类同余关系构造了一个内部算子和一个闭包算子,并研究了内部算子与对象定向概念格的关系以及闭包算子与属性定向概念格的关系。最后将对象(属性)定向概念格之间的关系转化为相应的同余关系之间的关系。

关键词: 形式背景,对象定向概念格,属性定向概念格,同余关系,依赖空间 中图法分类号TP301文献标识码A

Abstract: Object oriented concept lattice and attribute oriented concept lattice are two types of generalized models of classical concept lattice.Firstly,two congruence relations were defined respectively on object power sets of object oriented concept lattice and attribute oriented concept lattice using a pair of dual approximation operators.Secondly,an inner operator and a closure operator were constructed based on two kinds of congruence relations.Then relationship between the inner operator and object oriented concept lattice was studied as well as relationship between the closure ope-rator and attribute oriented concept lattice.Finally,relationships between two object oriented concept lattices were transformed into relationships between the corresponding congruence relations.

Key words: Formal context,Object oriented concept lattice,Attribute oriented concept lattice,Congruence relation,Dependence space

[1] Wille R.Restructuring lattice theory:an approach based on hierarchies of concepts[M]∥Rival I,ed.Ordered Sets.Reidel,Dordrecht-Boston,1982:445-470
[2] Ganter B,Wille R.Formal Concept Analysis:MathematicalFoundations [M].Berlin:Springer,1999
[3] Yao Yi-yu.A comparative study of formal concept analysis and rough set theory in data analysis [J]. Rough Sets and Current Trends in Computing,Lecture Notes in Computer Science,2004,3066:59-68
[4] 刘保相,李言.随机决策形式背景下的概念格构建原理与算法[J].计算机科学,2013,0(Z6):90-92,9
[5] 宋笑雪,张文修,李红.变精度对象概念格的构造及其性质 [J].计算机科学,2010,7(12):197-200
[6] 张文修,仇国芳.基于粗糙集的不确定决策 [M].清华大学出版社,2005
[7] Zhang Wen-xiu,Wei Ling,Qi Jian-jun.Attribute reduction theory and approach to concept lattice [J].Science in China Series F:Information Science,2005,48(6):713-726
[8] Wei Ling,Qi Jian-jun,Zhang Wen-xiu.Attribute reduction theory of concept lattice based on decision formal contexts [J].Science in China Series F:Information Science,2008,51(7):910-923
[9] Liu Min,Shao Ming-wen,Zhang Wen-xiu,et al.Reduction method for concept lattices based on rough set theory and its application [J].Computers and Mathematics with Applications,2007,53:1390-1410
[10] Wang Xia,Ma Jian-min.A novel approach to attribute reduction in concept lattices[J].Rough Sets and Current Trends in Computing,Lecture Notes in Computer Science,2006,4062:522-529
[11] Wang Xia,Zhang Wen-xiu.Relations of attribute reduction between object and property oriented concept lattices [J].Knowledge-Based Systems,2008,21(5):398-403
[12] Wang Xia.Approaches to Attribute Reduction in Concept Lattices Based on Rough Set Theory [J].International Journal of Hybrid Information Technology,2012,5(2):67-80
[13] Wang Xia,Wu Wei-zhi.Approximate reduction in inconsistent formal decision contexts[C]∥Proceedings 2012IEEE International Conference on Granular Computing.Hangzhou,2012:616-621
[14] Novotny M.Dependence spaces of information system [M]∥Orlowska E ed.Incomplete Information:Rough Set Analysis.Physica-Verlag,Heidelberg-New York,1998:193-246

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!