DocumentCode :
3356631
Title :
Research on Data Mining Model Based on Rough Sets
Author :
Li, Longshu ; Yang, Weimin ; Li, Xuejun ; Xu, Yi
Author_Institution :
Key Lab IC&SP, Anhui Univ., Hefei
fYear :
2006
fDate :
3-5 Aug. 2006
Firstpage :
851
Lastpage :
855
Abstract :
The aim of this work is to show how data mining technology based on rough set can be used for efficient implementation. In this paper, we discuss rough set theory in detail. In order to discover new rules from databases based on rough set, an object-oriented software architecture being propitious to data mining is given. And the algorithms for data reduction, rule discovery and rule reduction are introduced. From information table defined by primitive database, discernibility matrix, reduction table and rule table are created. In the last, an example is given. This shows that our model and algorithms are feasible
Keywords :
data mining; data reduction; knowledge representation; matrix algebra; object-oriented databases; rough set theory; software architecture; data mining; data reduction; databases; discernibility matrix; knowledge representation; object-oriented software architecture; rough set theory; rule discovery; rule reduction; Data mining; Educational technology; Knowledge representation; Object oriented databases; Object oriented modeling; Pervasive computing; Rough sets; Set theory; Software architecture; Uncertainty; Algorithms; Data Mining; Knowledge Representation; Rough Set; Software Architecture;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pervasive Computing and Applications, 2006 1st International Symposium on
Conference_Location :
Urumqi
Print_ISBN :
1-4244-0326-x
Electronic_ISBN :
1-4244-0326-x
Type :
conf
DOI :
10.1109/SPCA.2006.297545
Filename :
4079116
Link To Document :
بازگشت