Page 255 - Contributed Paper Session (CPS) - Volume 8

CPS2274 Nadiah M. et al.

4. Discussion and Conclusion
In this work, we use sliding windows to study the problem of continuous
outlier detection over data streams. As shown in the performance evaluation
results, we can identify the outlier and inlier in the data depend on the value
W, R and k that we choose. However, there are improvement needs to be done
in order to get the suitable value of W, R and k to get the optimum result.
There are several directions for future research. It is interesting to design
outlier detections algorithms over uncertain data streams. A second direction
is producer a better framework in processing data in official statistics.

References
1. Angiulli, F., & Fassetti, F. (2007). Detecting distance-based outliers in
streams of data. In Proceedings of the sixteenth ACM conference on
Conference on information and knowledge management (pp. 811-820).
ACM.
2. Angiulli, F., & Fassetti, F. (2007). Very efficient mining of distance-based
outliers. In Proceedings of the sixteenth ACM conference on Conference
on information and knowledge management (pp. 791-800). ACM.
3. Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000). LOF:
Identifying Density-Based Local Outliers. Proceedings of the 2000 Acm
Sigmod International Conference on Management of Data, 1–12.
4. Gupta, M., Gao, J., & Aggarwal, C. C. (2013). Outlier Detection for
Temporal Data: A Survey. Ieee Transactions on Knowledge and Data
Engineering, 25(1), 1–20.
5. Hung, E., & Cheung, D. W. (1999). Parallel algorithm for mining outliers in
large database. In Proc. 9th International Database Conference (IDC'99),
Hong Kong.
6. Jin, W., Tung, A. K., & Han, J. (2001). Mining top-n local outliers in large
databases. In Proceedings of the seventh ACM SIGKDD international

244 | I S I W S C 2 0 1 9