期刊文献+

概念格节点的内涵缩减及其计算 被引量:11

Intent Reduct of Concept Lattice Node and Its Computing
下载PDF
导出
摘要 首先给出了概念结点的内涵缩减的形式化定义,然后,提出并证明了几个相关的定理,以此作为基础,设计出内涵缩减集计算的算法,最后,简要说明了基于内涵缩减的蕴含规则提取。 In this paper, intent reduct of a concept node is first defined formally, then several theorems are presented and proved, based on which an algorithm for computing the intent reduct set is developed. Finally, this Paper briefly explains the implication rule extraction based on intent reduct set.
出处 《计算机工程》 CAS CSCD 北大核心 2001年第3期9-10,39,共3页 Computer Engineering
基金 国家自然科学基金资助项目(69985004)
关键词 概念格 内涵缩减 蕴含规则 算法 程序设计语言 Concept lattice Intent reduct Implication rule Algorithm
  • 相关文献

参考文献5

  • 1[1]Wille-R. Restructuring Lattice Theory:An Approach Based on Hierarchies of Concepls. ln:Rival I(ed.). Ordered Sets. Dordrecht:D Reidel Publishing Company,1982:445-470
  • 2[2]Godin R, Missaoui R.An Incremental Concept For-mation Approach for Learning from Database. Theoretical Computer Science, 1994,133:387-419
  • 3[3]Godin R,Missaoui R.Alaui H.IncrementalConcept Formation Algorithms Based on Galois(Concept) Lattices. Computational Intelligence. 1995,11 (2):246-267
  • 4[4]Missaoui R,Godin R. Extracting Exact andApproximate Rules from Databses. ln:Alagar V S, Bergler S, Dong F Q(Eds).lncompleteness and Uncertainty in Information Systems. London:Springer-Verlag, 1994:209-22
  • 5[5]Carpineto C, Romano G.A Lattice Conceptual Clustering System and Its Application to Browsing Retrieva1 Machine Lcarning, 1996,24:95-122

同被引文献130

引证文献11

二级引证文献47

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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