期刊文献+

弦二部图的概念格表示 被引量:3

Representing Chordal Bipartite Graph Using Concept Lattice Theory
在线阅读 下载PDF
导出
摘要 本文首先讨论了二部图中双单纯边与概念格中概念之间的对应关系;其次研究了弦二部图和约简的形式背景的若干性质;最后将概念格中元素的消除理论应用于二部图的研究,给出了弦二部图的概念格刻画.结果表明,一个二部图是弦二部图当且仅当对应的概念格中有一个∨∧—不可约元的完美消除序列. In this paper,the relation between bisimplicial edges in a bipartite graph and their corresponding concepts are discussed,and some properties of reduced contexts and chordal bipartite graphs are investigated.Then,we apply the element elimination for a concept lattice to bipartite graph theory,and obtain a representation of chordal bipartite graphs.More precisely,we show that a bipartite graph is chordal bipartite graph if and only if there is a join and meet irreducible element elimination ordering with respect to its corresponding concept lattice.
出处 《电子学报》 EI CAS CSCD 北大核心 2013年第7期1384-1388,共5页 Acta Electronica Sinica
基金 中央高校基本科研业务费专项资金(No.K50511700008) 陕西省教育厅自然科学专项基金(No.11JK1051 No.2013JK1098 No.2013JK1130 No.2013JK1182)
关键词 知识推理 约简形式背景 概念格 弦二部图 边完美消除序列 reduced context concept lattice chordal bipartite graph perfect edge without vertex elimination ordering
  • 相关文献

参考文献12

  • 1R WiUe. Restructuring lattice Theory:An Approach Based on Hierarchies of Concept [ M ]. R Ivan Rival ( ED. ), Or- dered Sets, Reidel, Dordecht. Boston, 1982.445 - 470.
  • 2B Ganter, R WiUe. Fomml Concept Analysis: Mathematical Foundations[ M]. Springer - Verlag, Berlin, 1999.
  • 3张文修,魏玲,祁建军.概念格的属性约简理论与方法[J].中国科学(E辑),2005,35(6):628-639. 被引量:203
  • 4WEI Ling,QI JianJun,ZHANG WenXiu.Attribute reduction theory of concept lattice based on decision formal contexts[J].Science in China(Series F),2008,51(7):910-923. 被引量:39
  • 5L F Li, J K Zhang. Attribute reduction in fuzzy concept lat- rices based on the T implication[ J]. Knowledge-Based Sys- tems,2010,23(6) :497 - 503.
  • 6李立峰,张东晓.概念格在二值命题逻辑命题集约简中的应用[J].电子学报,2007,35(8):1538-1542. 被引量:11
  • 7J Amilhastre,M C Vilarem, P Janssen. Complexity of mini- mum biclique cover and minimum biclique decomposition for bipartite domino-free graphs[ J]. Discrete Applied Mathemat- ics, 1998,86:125 - 144.
  • 8A Berry, A Sigayret. Representing a concept lattice by a graph[ J] .Discrete Applied Mathematics,2004,144( 1 - 2) : 27-42.
  • 9A Berry,R M MeConnell,A Sigayret, J P Spinrad. Very fast instances for concept generation [ J ]. LNCS, 2006,3874: 119 - 129.
  • 10A Berry, E SanJuanb, A Sigayret. Generalized domination in closure systems [ J ]. Discrete Applied Mathematics, 2006,154:1064 - 1084.

二级参考文献37

  • 1强宇,刘宗田,林炜,时百胜,李云.模糊概念格在知识发现的应用及一种构造算法[J].电子学报,2005,33(2):350-353. 被引量:21
  • 2张文修,魏玲,祁建军.概念格的属性约简理论与方法[J].中国科学(E辑),2005,35(6):628-639. 被引量:203
  • 3ZHANG Wenxiu,WEI Ling,QI Jianjun.Attribute reduction theory and approach to concept lattice[J].Science in China(Series F),2005,48(6):713-726. 被引量:76
  • 4任燕,马晓珏,王洪涛.~*命题集的约简及命题集的根[J].模糊系统与数学,2006,20(2):23-27. 被引量:6
  • 5Oosthuizen G D. The Application of Concept Lattice to Machine Learning. Technical Report, University of Pretoria, South Africa, 1996.
  • 6Ho T B. Incremental conceptual clustering in the framework of Galois lattice. In: Lu H, Motoda H, Liu H, eds. KDD: Techniques and Applications. Singapore: World Scientific, 1997. 49~64.
  • 7Kent R E. Bowman C M. Digital Libraries, Conceptual Knowledge Systems and the Nebula Interface. Technical Report, University of Arkansas, 1995.
  • 8Corbett D, Burrow A L. Knowledge reuse in SEED exploiting conceptual graphs. In: International Conference on Conceptual Graphs (ICCS'96). Sydney, 1996. University of New South Wales, 1996. 56~60.
  • 9Schmitt I, Saake G. Merging Inheritance hierarchies for scheme integration based on concept lattices [EB/OL]. http: //www.mathematic.tu-darm stadt.de/ags/ag1.
  • 10Siff M, Reps T. Identifying modules via concept analysis. In: Harrold M J, Visaggio G, eds. International conference on software maintenance. Bari, Italy. Washington, DC: IEEE Computer Society, 1997. 170~179.

共引文献241

同被引文献15

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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