形式概念的布尔计算方法

南京大学学报(自然科学版) ›› 2013, Vol. 49 ›› Issue (5): 553–560.

形式概念的布尔计算方法

李同军** ,王霞,徐优红

出版日期:2014-01-21 发布日期:2014-01-21
作者简介:浙江海洋学院数理与信息学院舟山316000
基金资助:
国家自然科学基金(11071284, 61075120, 61272021, 61202206), 浙江省自然科学基金重点项目(LY12F02021,LZ12F03002)

Boolean computation approach of formal concepts

Li Tong-Jun, Wang Xia, Xu You-Hong

Online:2014-01-21 Published:2014-01-21
About author:(School of Mathematics, Physics and Information Science, Zhejiang Ocean University, Zhoushan, 316004, China)

摘要/Abstract

摘要： 形式概念分析是用于知识表示和知识发现的一个重要方法. 将布尔矩阵方法引入形式概念分析之中, 提出布尔形式背景的概念, 利用布尔向量和布尔矩阵的蕴含运算, 给出了布尔形式概念的定义, 研究了布尔形式概念的计算和性质. 同时, 针对布尔形式背景的与、或和乘积运算, 研究对应的布尔形式概念的计算问题

Abstract: Formal concept analysis is an approach for knowledge representation and knowledge discovery. Boolean matrix theory is an important mathematical theory, it has been applied to many practical problems, and can also be used for formal concept analysis. In this paper, the notion of Boolean formal context is proposed, and Boolean formal concept is defined via the implication of Boolean vectors and Boolean matrixes. The properties of Boolean formal context are investigated, the mathematical structure and computation of Boolean formal concepts are examined in detail. Meanwhile, according to three types of Boolean matrix operations, that is, meet, join and product, the computation of corresponding Boolean formal concepts is studied

李同军** ,王霞,徐优红. 形式概念的布尔计算方法[J]. 南京大学学报(自然科学版), 2013, 49(5): 553–560.

Li Tong-Jun, Wang Xia, Xu You-Hong. Boolean computation approach of formal concepts[J]. Journal of Nanjing University(Natural Sciences), 2013, 49(5): 553–560.

参考文献

[1] Ganter B, Wille R. Formal concept analysis: Mathematical foundations. Berlin: Springer Verlag, 1999, 294.
[2] Wille R. Restructuring lattice theory: An approach based on hierarchies of concepts. Boston: Reidel, 1982, 445~470.
[3] Carpineto C, Romano G. Exploiting the potential of concept lattices for information retrieval with CREDO. Journal of Universal Computer Sciences, 2004, 10(8): 985~1013.
[4] Cole R, Eklund P, Stumme G. Document retrieval for e-mail search and discovery using formal concept analysis. Applied Artificial Intelligence, 2003, 17 (3): 257~280.
[5] Stumme G, Wille R, Wille U. Conceptual knowledge discovery in databases using formal concept analysis methods. Lecture Notes in Artificial Intelligence, 1998, 1510: 450~458.
[6] Yang S Q, Ding S L, Cai S Z, et al. An algorithm of constructing concept lattices for CAT with cognitive diagnosis. Knowledge- Based Systems, 2008, 21(8): 852~855.
[7] Ju C H, Shuai C Q, Feng Y. Feature selection of concept drifting in commerce data stream based on granular conputing. Journal of Nanjing University (Natural Sciences), 2011, 47(4): 391~397. (琚春华, 帅朝谦, 封毅. 基于粒计算的商业数据流概念漂移特征选择. 南京大学学报(自然科学), 2011, 47(4): 391~397).
[8] Chen Z, Zhang N, Wang S J. New algorithm of generating concept Lattice based on concept-matrix. Computer Science, 2010, 37(9): 180~183. (陈震, 张娜, 王甦菁. 一种基于概念矩阵的概念格生成算法.计算机科学, 2010, 37(9): 180~183).
[9] Zang G Q, Shen X J, Li G Y, et al. Vertical union of the synonymy concept lattices. Computer Engineering and Science, 2008, 30(3): 149~152. (臧国轻, 沈夏炯, 李国雁等. 同义概念格的纵向合并. 计算机工程与科学, 2008, 30(3): 149~152).
[10] Li Y, Liu Z T, Xu X H, et al. Horizontal union algorithm of multiple concept lattices. Acta Electronica Sinica, 2004, 32(11): 1849~1854. (李云, 刘宗田, 徐晓华等. 多概念格的横向合并算法.电子学报, 2004, 32(11): 1849~1854).
[11] Lu M, Hu C Q, Qi H, et al. A fast algorithm for conceptual clustering using attribute table. Journal of Fudan University (Natural Science), 2004, 43(5): 823~826. (卢明, 胡成全, 齐红等. 一种使用属性表的快速概念聚类算法. 复旦大学学报(自然科学版), 2004, 43(5): 823~826).
[12] Zhang W X, Wei L, Qi J J. Attribute reduction theory and approach to concept lattice. Science in China: Series F-Information Sciences, 2005, 35(6): 628~639. (张文修, 魏玲, 祁建军. 概念格的属性约简理论与方法, 中国科学F辑: 信息科学, 2005, 35(6): 628~639).
[13] Li T J, Wu W Z. Attribute reduction in formal contexts: A covering rough set approach. Fundamenta Informaticae, 2011, 111: 15~32.
[14] Wu W Z, Leung Y, Mi J S. Granular computing and knowledge reduction in formal contexts. IEEE Transactions on Knowledge and Data Engineering, 2009, 21: 1461~1474.
[15] Wang X, Zhang W X. Relations of attribute reduction between object and property oriented concept lattices. Knowledge-Based Systems, 2008, 21: 398~403.
[16] Wei L, Qi J J, Zhang W X. Attribute reduction theory of concept lattice based on decision formal contexts. Science in China: Series F-Information Sciences, 2008, 51(7): 910~923. (魏玲, 祁建军, 张文修. 决策形式背景的概念格属性约简, 中国科学F辑: 信息科学, 2008, 51(7): 910~923).
[17] Zhang Q X. The judgment method of consistent sets in decision formal context based on Boolean matrix. Journal of Zhangzhou Teachers College (Natural Science), 2012, 75(1): 22~25. (张清新. 基于布尔矩阵的决策形式背景协调集判断方法. 漳州师范学院学报(自然科学版), 2012, 75(1): 22~25).
[18] Liu Z T. An incremental arithmetic for the smallest reduction of attributes. Acta Electronica Sinica, 1999, 27(11): 96~98. (刘宗田. 属性最小约简的增量式算法. 电子学报, 1999, 27(11): 96~98).
[19] Li J J, Li K D, Wu Y H. Approximation notions on concpet lattice. Journal of Nanjing University (Natural Sciences), 2013, 49(2), 244~249. (李进金, 李克典, 吴燕华. 概念格上的近似概念. 南京大学学报(自然科学), 2013, 49(2): 244~249).
[20] Kim K H. Boolean matrix theory and applications. Marcel Dekber Inc, 1982, 288.
[21] Wang D L. Knowledge reduction algorithm based on elementary row transformation of Boolean matrix. Journal of Computer Applications, 2007, 27(9): 2267~2269. (王道林. 基于布尔矩阵的初等行变换的知识约简算法. 计算机应用, 2007, 27(9): 2267~2269).
[22] Zhou H Y. Attribute reduction based on incomplete information system. Computer Engineering and Applications, 2010, 46(1): 119~121. (周海岩. 采用布尔矩阵不完备信息系统的属性约简. 计算机工程与应用, 2010, 46(1): 119~121).

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed