Mining outliers with faster cutoff update and space utilization

Angiulli, 2002, Fast outlier detection in high dimensional spaces, 15 Asuncion, A., Newman, D., 2007. UCI Machine Learning Repository. <http://www.ics.uci.edu/∼mlearn/MLRepository.html>. Bay, 2003, Mining distance-based outliers in near linear time with randomization and a simple pruning rule, 29 Ghoting, 2008, Fast mining of distance-based outliers in high-dimensional datasets, Data Min. Knowl. Discov., 16, 349, 10.1007/s10618-008-0093-2 Grabner, 1997, Maximum statistics of N random variables distributed by the negative binomial distribution, Comb. Probab. Comput., 6, 179, 10.1017/S0963548397002939 Hettich, S., Bay, S.D., 1999. The UCI KDD Archive. <http://kdd.ics.uci.edu>. Knorr, 1998, Algorithms for mining distance-based outliers in large datasets, 392 Kriegel, H.-P., Kröger, P., Zimek, A., 2009. Outlier detection techniques. In: Tutorial at the 13th Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD 2009), Bangkok, Thailand. Ramaswamy, 2000, Efficient algorithms for mining outliers from large data sets, SIGMOD Rec., 29, 427, 10.1145/335191.335437 Szeto, 2009, Mining outliers with faster cutoff update and space utilization, vol. 5476, 823 Tao, 2006, Mining distance-based outliers from large databases in any metric space, 394