Outlier detection and evaluation by network flow Online publication date: Wed, 10-Dec-2008
by Ying Liu, Alan P. Sprague
International Journal of Computer Applications in Technology (IJCAT), Vol. 33, No. 2/3, 2008
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com