← Search

Text · dataset · 2025

Mining Distance-Based Outliers in Near Linear Time

Listed in Open NASA

Full title: Mining Distance-Based Outliers in Near Linear Time with Randomization and a Simple Pruning Rule

Description

Abstract

Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal of finding fast algorithms for this task. We show that a simple nested loop algorithm that in the worst case is quadratic can give near linear time performance when the data is in random order and a simple pruning rule is used.

Read the rest (1 more)

We test our algorithm on real high-dimensional data sets with millions of examples and show that the near linear scaling holds over several orders of magnitude. Our average case analysis suggests that much of the efficiency is because the time to process non-outliers, which are the majority of examples, does not depend on the size of the data set.

Links

Related

Provenance · 1 source records, 6 field assertions
SourceKeyLast seenRaw
Open NASA0e97b25d-c7ea-46ef-9ac4-255a3d66632b20 h agoJSON v1
FieldAssertionExtractorEvidence
created_datesource · open nasa govconnector:open_nasa_gov@1.0.0
descriptionsource · open nasa govconnector:open_nasa_gov@1.0.0/notes
license_textsource · open nasa govconnector:open_nasa_gov@1.0.0
publication_datesource · open nasa govconnector:open_nasa_gov@1.0.0
titlesource · open nasa govconnector:open_nasa_gov@1.0.0/title
updated_datesource · open nasa govconnector:open_nasa_gov@1.0.0