The Community for Technology Leaders
2013 IEEE 5th International Conference on Cloud Computing Technology and Science (2011)
Athens, Greece
Nov. 29, 2011 to Dec. 1, 2011
ISBN: 978-0-7695-4622-3
pp: 75-80
ABSTRACT
Distributed and Parallel algorithms have attracted a vast amount of interest and research in recent decades, to handle large-scale data set in real-world applications. In this paper, we focus on a parallel implementation of KD-Tree based outlier detection method to deal with large-scale data set. As one of the state-of-the-art outlier detection methods, KD-Tree based has been approved to be an effective algorithm. However, it still cannot process large-scale data set efficiently due to its serial implementation. Based on the current and powerful parallel programming framework -- MapReduce, we propose to implement the parallel KD-Tree based outlier detection algorithm (e.g., PKDTree for short). Experimental results demonstrate the efficiency of PKDTree according to the evaluation criterions of scale up, speedup and size up.
INDEX TERMS
Data mining, Parallel Outlier Detection, KD-Tree, MapReduce
CITATION
Qun Wang, Zhongzhi Shi, Qing He, Fuzhen Zhuang, Yunlong Ma, "Parallel Outlier Detection Using KD-Tree Based on MapReduce", 2013 IEEE 5th International Conference on Cloud Computing Technology and Science, vol. 00, no. , pp. 75-80, 2011, doi:10.1109/CloudCom.2011.20
178 ms
(Ver 3.3 (11022016))