A Fast Greedy Algorithm for Outlier Mining

  • Zengyou He
  • Shengchun Deng
  • Xiaofei Xu
  • Joshua Zhexue Huang
Conference paper

DOI: 10.1007/11731139_67

Volume 3918 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
He Z., Deng S., Xu X., Huang J.Z. (2006) A Fast Greedy Algorithm for Outlier Mining. In: Ng WK., Kitsuregawa M., Li J., Chang K. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2006. Lecture Notes in Computer Science, vol 3918. Springer, Berlin, Heidelberg

Abstract

The task of outlier detection is to find small groups of data objects that are exceptional when compared with rest large amount of data. Recently, the problem of outlier detection in categorical data is defined as an optimization problem and a local-search heuristic based algorithm (LSA) is presented. However, as is the case with most iterative type algorithms, the LSA algorithm is still very time-consuming on very large datasets. In this paper, we present a very fast greedy algorithm for mining outliers under the same optimization model. Experimental results on real datasets and large synthetic datasets show that: (1) Our new algorithm has comparable performance with respect to those state-of-the-art outlier detection algorithms on identifying true outliers and (2) Our algorithm can be an order of magnitude faster than LSA algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zengyou He
    • 1
  • Shengchun Deng
    • 1
  • Xiaofei Xu
    • 1
  • Joshua Zhexue Huang
    • 2
  1. 1.Department of Computer Science and EngineeringHarbin Institute of TechnologyChina
  2. 2.E-Business Technology InstituteThe University of Hong KongHong Kong