Abstract
Mining Outlier in database is to find exceptional objects that deviate from the rest of the datasets. Besides classical outlier analysis algorithms, recent studies have focused on mining local outliers. The outliers that have density distribution significantly different from their neighborhood. However, the existing outlier detection algorithms suffer the drawbacks that they are inefficient in dealing with large scale datasets. In this paper, we propose a novel approach for outlier detection with voluminous data. This approach involves a neighborhood fuzzy rough set theory to rank outlier according to fuzzy membership function computed in rough approximation space. In order to improve the speed of computation, an efficient parallel computing system based on Map Reduce model is developed
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IAES International Journal of Artificial Intelligence (IJ-AI)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
