A Fast Greedy Algorithm for Outlier Mining

Details A Fast Greedy Algorithm for Outlier Mining A Fast Greedy Algorithm for Outlier Mining

2005-07-27

arxiv.org/abs/cs/0507065v1

Computer Science

Databases

11 pages

Scientific paper

The task of outlier detection is to find small groups of data objects that are exceptional when compared with rest large amount of data. In [38], 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 algorithm has comparable performance with respect to those state-of-art outlier detection algorithms on identifying true outliers and (2) Our algorithm can be an order of magnitude faster than LSA algorithm.

Affiliated with

Also associated with

No associations

Rating

A Fast Greedy Algorithm for Outlier Mining does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Fast Greedy Algorithm for Outlier Mining, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Greedy Algorithm for Outlier Mining will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494726