Finding Intensional Knowledge of Distance-Based Outliers
暂无分享，去创建一个
[1] Theodore Johnson,et al. Fast Computation of 2-Dimensional Depth Contours , 1998, KDD.
[2] Raymond T. Ng,et al. Algorithms for Mining Distance-Based Outliers in Large Datasets , 1998, VLDB.
[3] Laks V. S. Lakshmanan,et al. Exploratory mining and pruning optimizations of constrained associations rules , 1998, SIGMOD '98.
[4] Dimitrios Gunopulos,et al. Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.
[5] Hannu Toivonen,et al. Efficient discovery of functional and approximate dependencies using partitions , 1998, Proceedings 14th International Conference on Data Engineering.
[6] Rajeev Motwani,et al. Beyond market baskets: generalizing association rules to correlations , 1997, SIGMOD '97.
[7] P. Rousseeuw,et al. Computing depth contours of bivariate point clouds , 1996 .
[8] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[9] Tomasz Imielinski,et al. An Interval Classifier for Database Mining Applications , 1992, VLDB.
[10] Peter J. Rousseeuw,et al. Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .
[11] V. Barnett,et al. Outliers in Statistical Data , 1980 .