Divisible Rough Sets Based on Self-organizing Maps
The rough sets theory has proved to be useful in knowledge discovery from databases, decision-making contexts and pattern recognition. However this technique has some difficulties with complex data due to its lack of flexibility and excessive dependency on the initial discretization of the continuous attributes. This paper presents the divisible rough sets as a new hybrid technique of automatic learning able to overcome the problems mentioned using a combination of variable precision rough sets with self-organizing maps and perceptrons. This new technique divides some of the equivalence classes generated by the rough sets method in order to obtain new certain rules under the data which originally were lost. The results obtained demonstrate that this new algorithm obtains a higher decision-making success rate in addition to a higher number of classified examples in the tested data sets.
- 6.Browne, C., Düntsch, I., Gediga, G.: IRIS Revisited, A Comparison of Discriminant and Enhanced Rough Set Data Analysis. In: Polkowski, L., Slowron, A. (eds.) Rough Sets in Knowledge Discovery, vol. 2, pp. 345–368. Physica Verlag, Heidelberg (1998)Google Scholar
- 8.Nguyen, H.S., Szczuka, M.S., Slezak, D.: Neural Networks Design: Rough Set Approach to Continuous Data. In: Komorowski, J., Żytkow, J.M. (eds.) PKDD 1997. LNCS, vol. 1263, pp. 359–366. Springer, Heidelberg (1997)Google Scholar
- 11.Merz, C.J., Murphy, P.M.: UCI repository of machine learning databases. Irvine, CA: University of California, Department of Information and Computer Science (1996), http://www.ics.uci.edu/~mlearn/MLRepository.html
- 12.Nguyen, H.S., Nguyen, S.H.: Discretization Methods in Data Mining. In: Polkowski, L., Slowron, A. (eds.) Rough Sets in Knowledge Discovery, vol. 1, pp. 451–482. Physica Verlag, Heidelberg (1998)Google Scholar