6 search results - page 1 / 2 » A near-linear time approximation algorithm for angle-based o... |
KDD
2003
ACM
14 years 5 months ago
2003
ACM
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 o...
STOC
1998
ACM
13 years 8 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
CSDA
2008
13 years 4 months ago
2008
A computationally fast procedure for identifying outliers is presented, that is particularly effective in high dimensions. This algorithm utilizes simple properties of principal c...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...