An Incremental Rule Acquisition Algorithm Based on Rough Set 被引量：4

An Incremental Rule Acquisition Algorithm Based on Rough Set

导出

摘要 Rough Set is a valid mathematical theory developed in recent years, which hasthe ability to deal with imprecise, uncertain, and vague information. This paper presents a newincremental rule acquisition algorithm based on rough set theory. First, the relation of the newinstances with the original rule set is discussed. Then the change law of attribute reduction andvalue reduction are studied when a new instance is added. Follow, a new incremental learningalgorithm for decision tables is presented within the framework of rough set. Finally, the newalgorithm and the classical algorithm are analyzed and compared by theory and experiments. Rough Set is a valid mathematical theory developed in recent years, which hasthe ability to deal with imprecise, uncertain, and vague information. This paper presents a newincremental rule acquisition algorithm based on rough set theory. First, the relation of the newinstances with the original rule set is discussed. Then the change law of attribute reduction andvalue reduction are studied when a new instance is added. Follow, a new incremental learningalgorithm for decision tables is presented within the framework of rough set. Finally, the newalgorithm and the classical algorithm are analyzed and compared by theory and experiments.

作者 YUHong YANGDa-chun

机构地区 InstituteofComputerScience&Technology ChongqingR&DInstituteofZTECorp.

出处《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2005年第1期47-52,共6页 中国邮电高校学报（英文版）

基金 This work is supported by National Science Foundation of China (No.60373111).

关键词 incremental algorithm rule acquisition rough set theory decision table incremental algorithm rule acquisition rough set theory decision table

分类号 TP18 [自动化与计算机技术—控制理论与控制工程]

引文网络
相关文献

参考文献6

1王志海,胡可云,胡学钢,刘宗田,张奠成.概念格上规则提取的一般算法与渐进式算法[J].计算机学报,1999,22(1):66-70. 被引量：66
2刘宗田.属性最小约简的增量式算法[J].电子学报,1999,27(11):96-98. 被引量：43
3梁吉业,王俊红.基于概念格的规则产生集挖掘算法[J].计算机研究与发展,2004,41(8):1339-1344. 被引量：56
4王国胤,于洪,杨大春.基于条件信息熵的决策表约简[J].计算机学报,2002,25(7):759-766. 被引量：594
5YUHong,YANGDa-chun.A Knowledge Reduction Algorithm Based on Conditional Entropy[J].The Journal of China Universities of Posts and Telecommunications,2001,8(3):23-27. 被引量：5
6黄兵,何新,周献中.基于广义粗集覆盖约简的粗糙熵(英文)[J].软件学报,2004,15(2):215-220. 被引量：31

二级参考文献23

1王国胤.Rough集理论和知识获取[M].西安:西安交通大学出版社,2001..
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