Lingras, P.J.; Yao, Y.Y.: Data mining using extensions of the rough set model (1998)
0.00
0.0026473717 = product of:
0.0052947435 = sum of:
0.0052947435 = product of:
0.010589487 = sum of:
0.010589487 = weight(_text_:a in 2910) [ClassicSimilarity], result of:
0.010589487 = score(doc=2910,freq=10.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.19940455 = fieldWeight in 2910, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=2910)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Examines basic issues of data mining using the theory of rough sets, which is a recent proposal for generalizing classical set theory. The Pawlak rough set model is based on the concept of an equivalence relation. A generalized rough set model need not be based on equivalence relation axioms. The Pawlak rough set model has been used for deriving deterministic as well as probabilistic rules froma complete database. Demonstrates that a generalised rough set model can be used for generating rules from incomplete databases. These rules are based on plausability functions proposed by Shafer. Discusses the importance of rule extraction from incomplete databases in data mining
- Footnote
- Contribution to a special issue devoted to knowledge discovery and data mining
- Type
- a
