Translator Disclaimer
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 "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); https://doi.org/10.1117/12.498867
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

IRIS: our prototype rule generation system
Proceedings of SPIE (February 24 1999)
Real-time intelligent decision making with data mining
Proceedings of SPIE (March 03 2004)
Data modeling for data mining
Proceedings of SPIE (March 11 2002)
OASIS: an EOSDIS science computing facility
Proceedings of SPIE (November 10 1996)
Adapting the right web pages to the right users
Proceedings of SPIE (April 05 2000)

Back to Top