Efficient algorithms for mining outliers from large data sets
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Outlier detection for high dimensional data
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Outlier Detection Using Replicator Neural Networks
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Discovering cluster-based local outliers
Pattern Recognition Letters
A fast greedy algorithm for outlier mining
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Mining outliers with ensemble of heterogeneous detectors on random subspaces
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Isolation-Based Anomaly Detection
ACM Transactions on Knowledge Discovery from Data (TKDD)
Outlier ensembles: position paper
ACM SIGKDD Explorations Newsletter
Hi-index | 0.00 |
This paper proposes a unified framework for outlier detection in high dimensional spaces from an ensemble-learning viewpoint. Moreover, to demonstrate the usefulness of our framework, we developed a very simple and fast algorithm, namely SOE1, in which only subspaces with one dimension is used for mining outliers from large categorical datasets. Experimental results demonstrate the superiority of SOE1 algorithm.