Scalable bootstrap attribute reduction for massive data Online publication date: Mon, 10-Dec-2018
by Suqin Ji; Hongbo Shi; Yali Lv; Min Guo
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 12, No. 4, 2018
Abstract: Attribute reduction is one of the fundamental techniques for knowledge acquisition in rough set theory. Traditional attribute reduction algorithms have to load the whole dataset into the memory at a time, however, it is unfeasible for attribute reduction of the massive decision table due to hard limitation. To solve this problem, we propose the bag of little bootstraps attribute reduction algorithm (BLBAR), which combines the bag of little bootstraps with attribute discernibility. Specifically, the algorithm first samples from the original decision table to generate a number of decision sub-tables; and then finds the reducts of bootstrap samples of each sub-table through attribute discernibility; finally, all of the reducts are integrated as the reduct of the original massive decision table. Experimental results demonstrate that BLBAR leads to the improved feasibility, scalability and efficiency for attribute reduction on massive decision table.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook