Efficient algorithms for mining outliers from large data sets
暂无分享,去创建一个
[1] Hans-Peter Kriegel,et al. LOF: identifying density-based local outliers , 2000, SIGMOD 2000.
[2] Raymond T. Ng,et al. Algorithms for Mining Distance-Based Outliers in Large Datasets , 1998, VLDB.
[3] Anil K. Jain,et al. Algorithms for Clustering Data , 1988 .
[4] P. Rousseeuw,et al. Computing depth contours of bivariate point clouds , 1996 .
[5] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[6] Yossi Matias,et al. New sampling-based summary statistics for improving approximate query answers , 1998, SIGMOD '98.
[7] Hans-Peter Kriegel,et al. A Database Interface for Clustering in Large Spatial Databases , 1995, KDD.
[8] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[9] Vic Barnett,et al. Outliers in Statistical Data , 1980 .
[10] Jiawei Han,et al. Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.
[11] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[12] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[13] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .
[14] Nimrod Megiddo,et al. Discovery-Driven Exploration of OLAP Data Cubes , 1998, EDBT.
[15] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[16] Prabhakar Raghavan,et al. A Linear Method for Deviation Detection in Large Databases , 1996, KDD.
[17] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[18] Raymond T. Ng,et al. Finding Intensional Knowledge of Distance-Based Outliers , 1999, VLDB.