Sciweavers

81 search results - page 2 / 17
» Mining top-n local outliers in large databases
Sort
View
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
14 years 5 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
DAGSTUHL
2007
13 years 6 months ago
Subspace outlier mining in large multimedia databases
Abstract. Increasingly large multimedia databases in life sciences, ecommerce, or monitoring applications cannot be browsed manually, but require automatic knowledge discovery in d...
Ira Assent, Ralph Krieger, Emmanuel Müller, T...
SIGMOD
2000
ACM
137views Database» more  SIGMOD 2000»
13 years 9 months ago
LOF: Identifying Density-Based Local Outliers
For many KDD applications, such as detecting criminal activities in E-commerce, finding the rare instances or the outliers, can be more interesting than finding the common pattern...
Markus M. Breunig, Hans-Peter Kriegel, Raymond T. ...
KDD
1995
ACM
216views Data Mining» more  KDD 1995»
13 years 8 months ago
Robust Decision Trees: Removing Outliers from Databases
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...
George H. John
VLDB
1998
ACM
192views Database» more  VLDB 1998»
13 years 9 months ago
Algorithms for Mining Distance-Based Outliers in Large Datasets
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...
Edwin M. Knorr, Raymond T. Ng