Rough sets based approach to reduct approximation: RSBARA

Simple item page
dc.contributor.authorFoitong, Sombut
dc.contributor.authorSrinil, Phaitoon
dc.contributor.authorPinngern, Ouen
dc.date.accessioned2026-08-06T09:57:43Z
dc.date.available2026-08-06T09:57:43Z
dc.date.issued2008-12-01
dc.description.abstractAttribute reduction is the process of choosing a subset of attributes from the original set of attributes forming patterns in a given dataset. The subset should be necessary and sufficient to describe target concepts. Rough set theory has been used as an attribute reduction method with impressive success, but current methods are inadequate at finding optimal reductions. On the other hand, the optimal reducts can be obtained by using the stochastic approaches, but it is not easy because its computational complexity for computing reducts is at least O (NxM<sup>2</sup>), where N is the number of attributes and M is the total number of objects. In this paper, we propose an algorithm which uses rough set theory to approximate the reduct and reduces the required computational effort to O(N<sup>2</sup>xM). Experimentation is carried out, using UCI data, which compares with a particle swarm approach and other deterministic rough set reduction algorithms. The experimental results show that the purposed method is more efficient both accuracy and attribute reduction. © 2008 IEEE.
dc.identifier.citationProceedings 5th International Conference on Fuzzy Systems and Knowledge Discovery Fskd 2008, 2, 250-254, 2008
dc.identifier.doi10.1109/FSKD.2008.393
dc.identifier.other2-s2.0-58049195365
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/2329
dc.sourceProceedings 5th International Conference on Fuzzy Systems and Knowledge Discovery Fskd 2008
dc.subjectAttribute reduction
dc.subjectReduct approximation
dc.subjectRough sets
dc.titleRough sets based approach to reduct approximation: RSBARA
dc.typeConference Paper

Files

Collections

Research