Indexed by:
Abstract:
The existing rough set based attribute reduction algorithms are mainly designed for the problem of the underlying data residing in the main memory. Therefore, the limitation of their application to attribute reduction computation of huge data results in a relatively poor scalability. Inspired by supervised learning in quest (SLIQ) algorithm, a specific data pre-processing strategy is introduced and a fast attribute reduction algorithm is proposed with time complexity O(|U||C|). The experimental results show that the proposed algorithm is of good scalability.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
Pattern Recognition and Artificial Intelligence
ISSN: 1003-6059
CN: 34-1089/TP
Year: 2009
Issue: 2
Volume: 22
Page: 234-239
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: