Finding Outliers in Distributed Data Streams Based on Kernel Density Estimation

Yang Yidong; Sun Zhihui; Zhang Jing

Journal of Computer Research and Development > 2005 > 42(9): 1498-1504.

Yang Yidong, Sun Zhihui, Zhang Jing. Finding Outliers in Distributed Data Streams Based on Kernel Density Estimation[J]. Journal of Computer Research and Development, 2005, 42(9): 1498-1504.

Citation:

Yang Yidong, Sun Zhihui, Zhang Jing. Finding Outliers in Distributed Data Streams Based on Kernel Density Estimation[J]. Journal of Computer Research and Development, 2005, 42(9): 1498-1504.

Citation:

Yang Yidong, Sun Zhihui, Zhang Jing. Finding Outliers in Distributed Data Streams Based on Kernel Density Estimation[J]. Journal of Computer Research and Development, 2005, 42(9): 1498-1504.

PDF (496 KB)

Finding Outliers in Distributed Data Streams Based on Kernel Density Estimation

1(Department of Computer Science and Engineering, Southeast University, Nanjing 210096) 2(College of Electronic and Information Engineering, Jiangsu University, Zhenjiang 212001)

More Information

Published Date: September 14, 2005

Graphical Abstract

Abstract

Abstract

Recently, there has been occurring more and more applications based on data stream models. Data mining in data stream, such as clustering, classifying, etc, becomes a hot research field. This paper presents an algorithm for outlier detection in distributed data streams. The data stream on every distributed node is taken for a subset of the global data stream, which consists of data on all distributed nodes. Because of huge network traffic, it is impossible to send all data to a central node and do detection. Based on the communication of distribution information between distributed nodes and the central node, the algorithm maintains the density estimation for the union of all streams. On every distributed node, global outliers can be detected by the estimation. Details of communication schedule and outlier detection are also discussed in this paper. Experimental results show promising availabilities of the approach.
- distributed data streams,
- outlier detection,
- kernel density estimation

FullText(HTML)

References (0)

[1]	Li Chen, Chen Yidong, Lu Zhonghua, Yang Xueying, Wang Zitian, Chi Xuebin. A Parallel Multi-Objective Dividing Rectangles Algorithm Based on Normalized Decomposition[J]. Journal of Computer Research and Development, 2024, 61(11): 2909-2922. DOI: 10.7544/issn1000-1239.202330093
[2]	Liu Quan, Fu Qiming, Yang Xudong, Jing Ling, Li Jin, Li Jiao. A Scalable Parallel Reinforcement Learning Method Based on Intelligent Scheduling[J]. Journal of Computer Research and Development, 2013, 50(4): 843-851.
[3]	Zhou Hanxun, Zhao Hong, Wen Yingyou. Modeling and Analysis of Divide-and-Rule-Hybrid-Benign Worms[J]. Journal of Computer Research and Development, 2009, 46(7): 1110-1116.
[4]	Li Jianfu, Guo Maozu, and Liu Yang. An Evolutionary Tree Reconstruction Method Combining Quartet Puzzling and Neighbor Joining[J]. Journal of Computer Research and Development, 2008, 45(11): 1965-1973.
[5]	Li Kenli, Liu Jie, Yang Lei, Liu Wenbin. An O(1.414\+n) Volume Molecular Solutions for the Exact Cover Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2008, 45(10): 1782-1788.
[6]	Wang Li, Zhang Suwei, Li Zhansheng, Song Linjian. A Multi-Path Routing Protocol Based on Divide and Conquer Strategy in Ad Hoc Network[J]. Journal of Computer Research and Development, 2008, 45(1).
[7]	Lin Jiao, Wang Shanying, Wang Chongyu. A Study of Parallel DVM-DAC Algorithm in Multiscale Physics[J]. Journal of Computer Research and Development, 2007, 44(10): 1667-1672.
[8]	Li Kenli, Yao Fengjuan, Li Renfa, Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2007, 44(6): 1063-1070.
[9]	He Lijian and Zhang Wei. An Agent Organization Structure for Solving DCOP Based on the Partitions of Constraint Graph[J]. Journal of Computer Research and Development, 2007, 44(3).
[10]	Hou Yuexian, Ding Zheng, and He Pilian. Self-Organizing Isometric Embedding[J]. Journal of Computer Research and Development, 2005, 42(2): 188-195.