loading...
A Vertical Outlier Detection Algorithm with Clusters as By-Product
Boca Raton, Florida November 15-November 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2004.2216th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dongmei Ren, North Dakota State University
Imad Rahal, North Dakota State University
William Perrizo, North Dakota State University
Outlier detection can lead to discovering unexpected and interesting knowledge, which is critically important to some areas such as monitoring of criminal activities in electronic commerce, credit card fraud, and the like. In this paper, we propose an efficient outlier detection method with clusters as by-product, which works efficiently for large datasets. Our contributions are: a) We introduce a Local Connective Factor (LCF); b) Based on LCF, we propose an outlier detection method which can efficiently detect outliers and group data into clusters in a one-time process. Our method does not require the beforehand clustering process, which is the first step in other state-of-the-art clustering-based outlier detection methods; c) The performance of our method is further improved by means of a vertical data representation, P-trees¹. We tested our method with real dataset. Our method shows around five-time speed improvements compared to the other contemporary clustering-based outlier-detection approaches.
Citation:
Dongmei Ren, Imad Rahal, William Perrizo, "A Vertical Outlier Detection Algorithm with Clusters as By-Product," ictai, pp.22-29, 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.