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 are provided by a user at the run time. The objective is to return all outliers with the smallest I/O cost.This paper cons
β¦ LIBER β¦
[ACM Press the 12th ACM SIGKDD international conference - Philadelphia, PA, USA (2006.08.20-2006.08.23)] Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '06 - Mining distance-based outliers from large databases in any metric space
β Scribed by Tao, Yufei; Xiao, Xiaokui; Zhou, Shuigeng
- Book ID
- 120625935
- Publisher
- ACM Press
- Year
- 2006
- Weight
- 800 KB
- Category
- Article
- ISBN-13
- 9781595933393
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
[ACM Press the 12th ACM SIGKDD internati
β
Tao, Yufei; Xiao, Xiaokui; Zhou, Shuigeng
π
Article
π
2006
π
ACM Press
β 800 KB
[ACM Press the 12th ACM SIGKDD internati
β
Chakrabarti, Deepayan; Kumar, Ravi; Tomkins, Andrew
π
Article
π
2006
π
ACM Press
β 815 KB
[ACM Press the 12th ACM SIGKDD internati
β
Leskovec, Jure; Faloutsos, Christos
π
Article
π
2006
π
ACM Press
β 717 KB
[ACM Press the 12th ACM SIGKDD internati
β
Abe, Naoki; Zadrozny, Bianca; Langford, John
π
Article
π
2006
π
ACM Press
β 134 KB
[ACM Press the 12th ACM SIGKDD internati
β
Abe, Naoki; Zadrozny, Bianca; Langford, John
π
Article
π
2006
π
ACM Press
β 134 KB
Most existing approaches to outlier detection are based on density estimation methods. There are two notable issues with these methods: one is the lack of explanation for outlier flagging decisions, and the other is the relatively high computational requirement. In this paper, we present a novel app
[ACM Press the 12th ACM SIGKDD internati
β
HorvΓ‘th, TamΓ‘s; Ramon, Jan; Wrobel, Stefan
π
Article
π
2006
π
ACM Press
β 792 KB