DocumentCode :
1815477
Title :
Reduct Equivalent Rule Induction Based On Rough Set Theory
Author :
Kovacs, Eva ; Ignat, Losif
Author_Institution :
Tech. Univ of Cluj-Napoca, Napoca
fYear :
2007
fDate :
6-8 Sept. 2007
Firstpage :
9
Lastpage :
15
Abstract :
Rough set theory is successfully used within data mining for prediction, classification (S. Abidi et al., 2001),(J.S. Deogun et al., 1995),(A. Kusiak, 2001),(P. Lingras, 2002),(P. Lingras et al., 2003), discovery of associations (J. Guan et al., 2003) and reduction of attributes (L. Mazlack et al., 2000), (M. Zhang and J.T. Yao, 2004). Having as motto "Let data speak for themselves", we can state that this approach is not invasive for the processed data set as it uses only the information of the data set without presuming the existence of different models in it (V. Raghavan and H. Sever, 1995). This article presents original contributions for the classifications of the objects of a database using the elements of rough set theory. Reduct equivalent rule induction (or RERT), is presented as a new classification method based on rough set theory. This article describes the mathematical essence of the reduct equivalent rule induction method, as well as the algorithm and the obtained experimental results.
Keywords :
data mining; learning by example; object-oriented databases; pattern classification; rough set theory; attribute classification; attribute prediction; data mining; database object classification; reduct equivalent rule induction; Data analysis; Data mining; Databases; Information systems; Set theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Computer Communication and Processing, 2007 IEEE International Conference on
Conference_Location :
Cluj-Napoca
Print_ISBN :
978-1-4244-1491-8
Type :
conf
DOI :
10.1109/ICCP.2007.4352136
Filename :
4352136
Link To Document :
بازگشت