A local outlier detection approach based on graph-cut

Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009

Volumn 1, Issue , 2009, Pages 714-718

  Zhong, Caiming ^a   Lin, Xueming ^a   Zhang, Ming ^a  

^a NINGBO UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH-CUT; K-NEAREST NEIGHBORS; LOCAL OUTLIERS; MINIMUM SPANNING TREES; REAL DATA SETS;

COMBINED SEWERS; MOTION COMPENSATION;

GRAPH THEORY;

EID: 70649103890     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSO.2009.272     Document Type: Conference Paper

References (12)

1. A. Arning, R. Agrawal, and P. Raghavan. A linear method for deviation detection in large databases. In Proceedings of 2nd International Conference of Knowledge Discovery and Data Mining, pages 164-169, Portland, 1996.
2. M. M. Breunig, H. P. Kriegel, R. T. Ng, and J. Sander. Lof: Identifying density-based local outliers. In Proceedings of 2000 ACM SIGMOD International Conference on Management of Data, pages 93-104, Dallas, Texas, 2000.
3. V. Hautamäki, I. Kärkkäinen, and P. Fränti. Outlier detection using k-nearest neighbour graph. In Proceedings of 17th International Conference on Pattern Recognition, pages 430-433, Washington, DC, USA, 2004.
4. S. Hawkins, H. He, G. Williams, and R. Baxter. Outlier detection using replicator neural networks. In Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery, pages 170-180, Aix-en-Provence, France, 2002.
5. Z. He, X. Xu, and S. Deng. Discovering cluster-based local outliers. Pattern Recognition Letters, 24(9-10):1641-1650, June 2003.
6. E. M. Knorr and R. T. Ng. Algorithms for mining distancebased outliers in large datasets. In Proceedings of VLDB'98, pages 392-403, New York, USA, 1998.
7. S. Ramaswamy, R. Rastogi, and K. Shim. Efficient algorithms for mining outliers from large data sets. In In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pages 93-104, Dallas, Texas, 2000.
8. I. Ruts and P. Rousseeuwb. Computing depth contours of bivariate point clouds. Computational Statistics & Data Analysis, 23(1):153-168, Novermber 1996.
9. R. Smith, A. Bivens, and M. Embrechts. Clustering approaches for anomaly based intrusion detection. In Proceedings of Intelligent Engineering Systems through Artificial Neural Network, pages 579-584, ASME Press, 2002.
10. K. Yamanishi, J. Takeuchi, G. Williams, and P. Milne. Online unsupervised outlier detection using finite mixtures with discounting learning algorithms. Data Mining and Knowledge Discovery, 8(5):275-300, May 2004.
11. C. T. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. on Computers, C- 20(1):68-86, January 1971.
12. Y. Zhang, S. Yang, and Y. Wang. Ldbod: A novel local distribution based outlier detector. Pattern Recognition Letters, 29(7):967-976, May 2008.