RRIA: A rough set and rule tree based incremental knowledge acquisition algorithm

被引:1
作者
Zheng, Z [1 ]
Wang, GY [1 ]
机构
[1] Chongqing Univ Posts & Telecommun, Inst Comp Sci & Technol, Chongqing, Peoples R China
关键词
rough set; rule tree; incremental learning; knowledge acquisition; data mining;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
As a special way in which the human brain is learning new knowledge, incremental learning is an important topic in AI. It is an object of many AI researchers to find an algorithm that can learn new knowledge quickly, based on original knowledge learned before, and in such way that the knowledge it acquires is efficient in real use. In this paper, we develop a rough set and rule tree based incremental knowledge acquisition algorithm. It can learn from a domain data set incrementally. Our simulation results show that our algorithm can learn more quickly than classical rough set based knowledge acquisition algorithms, and the performance of knowledge learned by our algorithm can be the same as or even better than classical rough set based knowledge acquisition algorithms. Besides, the simulation results also show that our algorithm outperforms ID4 in many aspects.
引用
收藏
页码:299 / 313
页数:15
相关论文
共 21 条
[1]  
CERCONE N, 1993, IEEE T KNOWL DATA EN, V5, P901
[2]  
FAYYAD UM, 1996, ADV KNOWLEDGE DISCOV
[3]  
Han J., 2012, Data Mining, P393, DOI [DOI 10.1016/B978-0-12-381479-1.00009-5, 10.1016/B978-0-12-381479-1.00001-0]
[4]   LEARNING IN RELATIONAL DATABASES - A ROUGH SET APPROACH [J].
HU, XH ;
CERCONE, N .
COMPUTATIONAL INTELLIGENCE, 1995, 11 (02) :323-338
[5]   ROUGH SET REDUCTION OF ATTRIBUTES AND THEIR DOMAINS FOR NEURAL NETWORKS [J].
JELONEK, J ;
KRAWIEC, K ;
SLOWINSKI, R .
COMPUTATIONAL INTELLIGENCE, 1995, 11 (02) :339-347
[6]  
KOU YJ, 2001, J COMPUTER RES DEV, V38, P947
[7]  
Liu Zong-Tian, 1999, Acta Electronica Sinica, V27, P96
[8]  
LU RQ, 2002, ARTIFICIAL INTELLIGE
[9]  
Miao D.Q., 1997, THESIS CHINESE ACAD
[10]  
PIATETSKYSHAPIR.L, 1991, KNOWLEDGE DISCOVERY