Share Email Print
cover

Proceedings Paper

Finding the reduct by granular computing using bit maps: decision rules mining
Author(s): Ping Yin
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 21 March 2003
PDF: 12 pages
Proc. SPIE 5098, Data Mining and Knowledge Discovery: Theory, Tools, and Technology V, (21 March 2003); doi: 10.1117/12.498867
Show Author Affiliations
Ping Yin, San Jose State Univ. (United States)


Published in SPIE Proceedings Vol. 5098:
Data Mining and Knowledge Discovery: Theory, Tools, and Technology V
Belur V. Dasarathy, Editor(s)

© SPIE. Terms of Use
Back to Top