Neighbourhood rough set model for knowledge acquisition using MapReduce Online publication date: Tue, 04-Aug-2015
by Shruthi Hiremath; Pallavi Chandra; Anne Mary Joy; B.K. Tripathy
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 15, No. 2/3, 2015
Abstract: Data mining techniques are used to generate information from enormous amount of raw data collected from different sources so that prediction of future events can be made. Rough set theory, which is used to perform data mining for knowledge acquisition has imitations and hence is not efficient in handling heterogeneous real datasets. In this paper, we use a neighbourhood based rough set model and propose a method to determine reduced neighbourhood subsets derived from samples of the universal set. We compare the accuracy and coverage of the computations obtained by using parallel rough set-based methods using the conventional MapReduce technique. The results provide strong evidence of reduced reasoning time in both the cases. Although the subset formation method defines a range of values to which the rules give a better result of the computational analysis, the covering method reduces the number of rules at some cost of the values computed.
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 Communication Networks and Distributed Systems (IJCNDS):
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