Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
LOF: identifying density-based local outliers
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
ROCK: a robust clustering algorithm for categorical attributes
Information Systems
Data mining: concepts and techniques
Data mining: concepts and techniques
Outlier detection for high dimensional data
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Graph Algorithms
Blobworld: Image Segmentation Using Expectation-Maximization and Its Application to Image Querying
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms for Mining Distance-Based Outliers in Large Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Finding Intensional Knowledge of Distance-Based Outliers
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Chance Discovery
Novelty detection: a review—part 1: statistical approaches
Signal Processing
On-Line Unsupervised Outlier Detection Using Finite Mixtures with Discounting Learning Algorithms
Data Mining and Knowledge Discovery
Network flow for outlier detection
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Outlier Detection and Data Cleaning in Multivariate Non-Normal Samples: The PAELLA Algorithm
Data Mining and Knowledge Discovery
Numerical Methods for Engineers
Numerical Methods for Engineers
Feature bagging for outlier detection
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Region-based image clustering and retrieval using multiple instance learning
CIVR'05 Proceedings of the 4th international conference on Image and Video Retrieval
Outliers in biometrical data: What's old, What's new
International Journal of Biometrics
| Hi-index | 0.00 |
This paper introduces a novel method to separate abnormal points from normal data, based on network flow. This approach uses the Maximum Flow Minimum Cut theorem from graph theory to find the outliers and strong outlier groups, and evaluate the outliers by outlier degrees. Similar outliers are discovered together and delivered to the user together; in an application where outliers are the points of the greatest interest, this will allow similar outliers to be analysed together. Effectiveness of the method is demonstrated in comparison with three other outlier detection algorithms. Further experimental application testifies this algorithm can improve the query accuracy on a content-based image data set. This algorithm is effective on higher dimensional data as well as low dimension.