期刊文献+

概念格上一类新的序同构关系 被引量:1

New order isomorphic relation in concept lattice
下载PDF
导出
摘要 在形式背景的对象集合幂集P(G)和属性集合幂集P(M)上定义了偏序关系。证明了偏序集(P(G),≤)或(P(M),≤)与概念格∪(K)之间存在序同构关系。给出了一种利用序同构关系构造∪(K)中所有概念的内涵和外延的方法。所得的若干定理拓展了文献中的研究结果。 Based on the formal context with object set G and attribute set M,we defined two partially ordered sets(poset in brief),namely,P(G) poset and P(M) poset.A new order isomorphic relation was found between poset(P(G),≤) and concept lattice ∪(K),or between(P(M),≤) and ∪(K).With the new order isomorphic relation,a method was given for constructing the intension and extension of the concepts in ∪(K).Theorems inferred from this paper have expanded the results in the bibliography.
出处 《苏州科技学院学报(自然科学版)》 CAS 2010年第2期9-12,共4页 Journal of Suzhou University of Science and Technology (Natural Science Edition)
基金 安徽省高校自然科学基金资助项目(KJ2007B245)
关键词 概念格 序同构 概念 concept lattice order isomorphism concept
  • 相关文献

参考文献9

  • 1Wille R.Restructuring lattice theory:An Approach Based on Hierarchies of Concepts in Ordered Sets[M].Dordrecht-Boston:Reidel,1982:445-470.
  • 2Tonella P.Using a concept lattice of decomposition slices for program understanding and impact analysis[J].IEEE Transactions on Software Engineering,2003,29(6):495-509.
  • 3Vahchev P,Missaoui R,Godin R,ef al.Generating frequent item sets incrementally:Two novel approaches based on galois lattice theory[J].Journal of Experimental & Theoretical Artificial Intelligence,2002.14(2-3):115-142.
  • 4梁吉业,王俊红.基于概念格的规则产生集挖掘算法[J].计算机研究与发展,2004,41(8):1339-1344. 被引量:57
  • 5Carpineto C,Romano G.Information retrieval through hybrid navigation of lattice representations[J].International Journal of Human Computer Studies,1996,45:553-578.
  • 6谢志鹏,刘宗田.概念格的快速渐进式构造算法[J].计算机学报,2002,25(5):490-496. 被引量:120
  • 7Gedin R,Missaoui R,Alaoui H.Incremental concept formation algorithms based on Galois(concept)lattices[J].Computational Intelligence,1995,11(2):246-267.
  • 8曲开社,翟岩慧.偏序集、包含度与形式概念分析[J].计算机学报,2006,29(2):219-226. 被引量:52
  • 9Ganter B,Wille R.Formal Concept Analysis:Mathematical Foundations[M].Berlin:Springer-Verlag,1999.

二级参考文献41

  • 1梁吉业,王俊红.基于概念格的规则产生集挖掘算法[J].计算机研究与发展,2004,41(8):1339-1344. 被引量:57
  • 2张文修,梁广锡,梁怡.包含度及其在人工智能中的应用[J].西安交通大学学报,1995,29(8):111-116. 被引量:10
  • 3张文修,徐宗本,梁怡,梁广锡.包含度理论[J].模糊系统与数学,1996,10(4):1-9. 被引量:49
  • 4史忠植.知识发现.北京:清华大学出版社,2002(Shi Zhongzhi. Knowledge Discovery ( in Chinese ) . Beijing:Tsinghua University Press, 2002)
  • 5R Wille. Restructuring lattice theory: An approach based on hierarchies of concepts. In: I Rival ed. Ordered Sets. DordrechtBoston: Reidel, 1982. 445~470
  • 6R 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
  • 7G W Mineau, R Godin. Automatic structuring of knowledge bases by conceptual clustering. IEEE Trans on Knowledge and Data Engineering, 1995, 7(5): 824~828
  • 8C Carpineto, G Romano. A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning,1996, 24(2): 95~122
  • 9R Cole, P Eklund. Scalability in formal concept analysis.Computational Intelligence, 1999, 15( 1 ): 11 ~ 27
  • 10R 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

共引文献197

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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