期刊文献+

基于概念格的规则产生集挖掘算法 被引量:56

An Algorithm for Extracting Rule-Generating Sets Based on Concept Lattice
下载PDF
导出
摘要 传统的规则提取算法产生的规则集合相当庞大 ,其中包含许多冗余的规则 使用闭项集可以减少规则的数目 ,而概念格结点间的泛化和例化关系非常适用于规则提取 基于概念格理论和闭项集的概念 ,提出了一种新的更有利于规则提取的格结构 ,给出了相应的基于闭标记的渐进式构造算法和规则提取算法 最后提供给用户的是直观的、易理解的规则子集 ,用户可以有选择地从中推导出其他的规则 The rule sets extracted by traditional algorithm are usually very large, because it includes many redundant rules. The number of rules can be reduced using closed item sets. The relationship of generalization and specialization among concepts of concept lattice is very suitable for extracting rules. A new and more advantageous lattice structure for extracting rules is proposed based on the theory of concept lattice and the concept of closed item set. Then, an incremental algorithm based on closed label for constructing lattice and algorithm for rules extracting are developed. Finally, a visual and easily understandable set of rules is presented to user, who can selectively derive other rules of interest. The example shows that the algorithm used in this paper can efficiently extract rule-generating set.
出处 《计算机研究与发展》 EI CSCD 北大核心 2004年第8期1339-1344,共6页 Journal of Computer Research and Development
基金 国家自然科学基金资助项目 ( 60 2 75 0 19) 山西省自然科学基金资助项目 ( 2 0 0 3 10 3 6)
关键词 概念格 闭项集 规则产生集 规则提取 concept lattice closed item set rule-generating set rule extracting
  • 相关文献

参考文献15

  • 1史忠植.知识发现.北京:清华大学出版社,2002(Shi Zhongzhi. Knowledge Discovery ( in Chinese ) . Beijing:Tsinghua University Press, 2002)
  • 2R Wille. Restructuring lattice theory: An approach based on hierarchies of concepts. In: I Rival ed. Ordered Sets. DordrechtBoston: Reidel, 1982. 445~470
  • 3R 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
  • 4G W Mineau, R Godin. Automatic structuring of knowledge bases by conceptual clustering. IEEE Trans on Knowledge and Data Engineering, 1995, 7(5): 824~828
  • 5C Carpineto, G Romano. A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning,1996, 24(2): 95~122
  • 6R Cole, P Eklund. Scalability in formal concept analysis.Computational Intelligence, 1999, 15( 1 ): 11 ~ 27
  • 7R 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
  • 8R Godin, R Missaoui. An incremental concept formation approach for learning from databases. Theoretical Computer Science, 1994,133:387~419
  • 9N 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
  • 10N Pasquier, Y Bastide, R Taouil, et al. Efficient mining of association rules using closed itemset lattice. Information Systems,1999, 24(1): 25~46

二级参考文献7

  • 1Hu Keyun,Proceedings of PAKDD-99[C],1999年,109页
  • 2Hu Keyun,Proceedings of RSFDGr C99,1999年,443页
  • 3王志海,清华大学学报,1998年,38卷,增2期,14页
  • 4Ho T B,KDD:Techniques and Applications,1997年,49页
  • 5Ho T B,IEICE Trans Inf Syst,1995年,E78-D卷,5期,553页
  • 6Cheung D W,Proc of 1996 Int’l Conf on Data Engineering (ICDE’96 ),1996年
  • 7王志海,马光胜.一种求解多值逻辑函数接近最小覆盖的算法[J].计算机学报,1990,13(11):875-877. 被引量:5

共引文献237

同被引文献462

引证文献56

二级引证文献261

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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