Finding the reduct by granular computing using bit maps: decision rules mining

Ping Yin

doi:10.1117/12.498867

21 March 2003 Finding the reduct by granular computing using bit maps: decision rules mining

Ping Yin

Proceedings Volume 5098, Data Mining and Knowledge Discovery: Theory, Tools, and Technology V; (2003) https://doi.org/10.1117/12.498867
Event: AeroSense 2003, 2003, Orlando, Florida, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available