期刊文献+

偏序集、包含度与形式概念分析 被引量:52

Posets,Inclusion Degree Theory and FCA
在线阅读 下载PDF
导出
摘要 在形式背景上建立了3个偏序集:G偏序集、M偏序集和GM偏序集,并将包含度的概念引入到3个偏序集上.讨论了偏序集上的偏序关系和包含度与概念格之间的联系,并且证实了形式概念分析中的内涵、外延和蕴涵规则均可归结为偏序集上的序表示及包含度表示,这将有助于人们深刻理解形式概念分析中概念的含义及概念格的结构,为从定量分析角度研究形式概念分析提供了依据. Formal Concept Analysis (FCA) is an order-theoretic method for the mathematical analysis of scientific data, pioneered by R. Wille in mid 80's. Over the past twenty years, FCA has been widely studied and become a powerful tool for machine learning, software engineering and information retrieval. In addition to being a technique for classifying and defining concepts from data, FCA may be exploited to discover implications among the objects and the attributes. On the other hand, inclusion degree theory proposed by Prof. Zhang W. X. is a measure theory for order theory. In fact the synthesis between FCA and inclusion degree theory will be greatly advanta- geous to the further development of such domains as intelligent control, pattern recognition, knowledge processing etc. This paper serves to introduce partially ordered set (poset) and inclusion degree theory to FCA. For this, the authors establish three posets, namely, G poset, M poset as well as GM poset and based on the three posets, they define three inclusion degrees on them. Then they show the relationship between the posets and concept lattice, and prove that the basic concepts such as intents, extents and implications can be reconstructed either by the partial orders or by the inclusion degrees of the posets. These results will be very helpful for people to understand the essence of concepts and the structure of concept lattice in FCA, and can be regarded as the main foundation of quantitative measures which are defined for FCA.
出处 《计算机学报》 EI CSCD 北大核心 2006年第2期219-226,共8页 Chinese Journal of Computers
基金 国家自然科学基金(70471003 60275019) 高等学校博士学科点专项科研基金(20050108004) 山西省自然科学基金(20031036 20041040 20041014)资助
关键词 形式概念分析 概念格 偏序集 包含度 概念 formal concept analysis concept lattice poset inclusion degree concept
  • 相关文献

参考文献17

  • 1Wille R..Restructuring lattice theory:An approach based on hierarchies of concepts.In:Rival I.ed..Ordered Sets.Dordrecht:Reidel,1982,445~470.
  • 2Ganter B.,Wille R..Formal Concept Analysis:Mathematical Foundations.Berlin:Springer-Verlag,1999.
  • 3Yao Y.Y..Concept lattices in rough set theory.In:Proceed ings of 2004 Annual Meeting of North American Fuzzy Information Processing Society,Canada,2004,796~801.
  • 4Qu K.S.,Liang J.Y.,Wang J.H.et al..The algebraic properties of concept lattice.Journal of Systems Science and Information,2004,2(2):271~277.
  • 5谢志鹏,刘宗田.概念格的快速渐进式构造算法[J].计算机学报,2002,25(5):490-496. 被引量:122
  • 6Zupa B.,Bohance M..Learning by discovering concept hierarchies.Artificial Intelligence,1999,109(1~2):211~242.
  • 7Tonella.Using a concept lattice of decomposition slices for program understanding and impact analysis.IEEE Transactions on Software Engineering,2003,29(6):495~509.
  • 8Dekel U..Revealing Java class structure with concept lattices[M.S.dissertation].Technion-Israel Institute of Technology,2003.
  • 9Arevalo G.,Mens T..Analyzing object-oriented application frameworks using concept analysis.Lecture Notes in Computer Science 2426,2002,53~63.
  • 10Dekel U.,Gil Y..Revealing class structure with concept lattices.In:Proceedings of the 10th Working Conference on Reverse Engineering,Canada,2003,353~365.

二级参考文献32

  • 1陈雁,徐萍,张文修.关系数据库的证据生成与合成[J].计算机学报,1994,17(10):729-735. 被引量:2
  • 2史忠植.知识发现.北京:清华大学出版社,2002(Shi Zhongzhi. Knowledge Discovery ( in Chinese ) . Beijing:Tsinghua University Press, 2002)
  • 3R Wille. Restructuring lattice theory: An approach based on hierarchies of concepts. In: I Rival ed. Ordered Sets. DordrechtBoston: Reidel, 1982. 445~470
  • 4R Godin, G Mine au, R Missaoui, et al. Applying concept formation methods to software reuse. International Journal of Knowledge Engineering and Software Engineering, 1995, 5 ( 1 ):119~ 142
  • 5G W Mineau, R Godin. Automatic structuring of knowledge bases by conceptual clustering. IEEE Trans on Knowledge and Data Engineering, 1995, 7(5): 824~828
  • 6C Carpineto, G Romano. A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning,1996, 24(2): 95~122
  • 7R Cole, P Eklund. Scalability in formal concept analysis.Computational Intelligence, 1999, 15( 1 ): 11 ~ 27
  • 8R Cole, P Eklund, G Stumme. CEM-A program for visualization and discovery in email. In: The 4th European Conf on Principles and Practice of Knowledge Discovery in Databases.Berlin: Springer-Verlag, 2000
  • 9R Godin, R Missaoui. An incremental concept formation approach for learning from databases. Theoretical Computer Science, 1994,133:387~419
  • 10N Pasquier, Y Bastide, R Taouil, et al. Discovering frequent closed itemsets for association rules. The 7th Int'l Conf on Databases Theory. Jerusalem, Israel, 1999

共引文献294

同被引文献505

引证文献52

二级引证文献237

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部