Non-persistent stratified sampling based IQRA_IG for scalable reduct generation
by P.S.V.S. Sai Prasad; C. Raghavendra Rao
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 3, No. 3, 2014

Abstract: Feature selections in large datasets using reduct based on rough set principles is computationally expensive. The existing scalable sampling-based reduct computation algorithms suffer from limitations like redundancy and inadequacy. This paper develops two algorithms for finding reduct based on stratified sampling and non-persistent stratified sampling techniques which addresses adequacy and to certain extent redundancy. This paper compares the performance of these algorithms against discernbility matrix-based sampling approximate reduct algorithm (SARA) and sample guided improved quick reduct algorithm with information gain heuristic (SGIQRA_IG). The performance of these algorithms is demonstrated on benchmark large dataset repository of Arizona State University.

Online publication date: Tue, 29-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com