Algorithms for Speeding up Distance-Based Outlier Detection
The problem of distance-based outlier detection is difficult
to solve efficiently in very large datasets because of potential
quadratic time complexity. We address this problem and
develop sequential and distributed algorithms that are significantly
more efficient than state-of-the-art methods while
still guaranteeing the same outliers. By combining simple
but effective indexing and disk block accessing techniques,
we have developed a sequential algorithm iOrca that is up to
an order-of-magnitude faster than the state-of-the-art. The
indexing scheme is based on sorting the data points in order
of increasing distance from a fixed reference point and
then accessing those points based on this sorted order. To
speed up the basic outlier detection technique, we develop
two distributed algorithms (DOoR and iDOoR) for modern
distributed multi-core clusters of machines, connected
on a ring topology. The first algorithm passes data blocks
from each machine around the ring, incrementally updating
the nearest neighbors of the points passed. By maintaining
a cutoff threshold, it is able to prune a large number
of points in a distributed fashion. The second distributed
algorithm extends this basic idea with the indexing scheme
discussed earlier. In our experiments, both distributed algorithms
exhibit significant improvements compared to the
state-of-the-art distributed methods.
Complete Metadata
| bureauCode |
[ "026:00" ] |
|---|---|
| identifier | DASHLINK_450 |
| issued | 2011-08-15 |
| landingPage | https://c3.nasa.gov/dashlink/resources/450/ |
| programCode |
[ "026:029" ] |
