21 March 2003 Finding the reduct by granular computing using bit maps: decision rules mining
Author Affiliations +
Abstract
Finding reduct is the core theme in rough set theory, and could be considered one form of data mining. However to find the "perfect" reduct has been proved to be an NP-hard problem. In this paper, we compute a reduct based on granular data model; each granule is represented by a bit string. The computing is very fast.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ping Yin, Ping Yin, } "Finding the reduct by granular computing using bit maps: decision rules mining", Proc. SPIE 5098, Data Mining and Knowledge Discovery: Theory, Tools, and Technology V, (21 March 2003); doi: 10.1117/12.498867; https://doi.org/10.1117/12.498867
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

A step toward the foundations of data mining
Proceedings of SPIE (March 21 2003)
Diamond Eye: a distributed architecture for image data mining
Proceedings of SPIE (February 25 1999)
Data mining in metadata repositories
Proceedings of SPIE (March 12 2002)
Real-time intelligent decision making with data mining
Proceedings of SPIE (March 04 2004)

Back to Top