Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Yu, Qingyinga; b | Luo, Yonglonga; b; * | Chen, Chuanmingb | Bian, Weixinb
Affiliations: [a] School of Territorial Resources and Tourism, Anhui Normal University, Wuhu, Anhui, China | [b] School of Mathematics and Computer Science, Anhui Normal University, Wuhu, Anhui, China
Correspondence: [*] Corresponding author: Yonglong Luo, School of Territorial Resources and Tourism, Anhui Normal University, No. 189, south road of Jiuhua Road, Wuhu 241003, Anhui, China. Tel.: +86 0553 5910645; E-mail:ylluo@ustc.edu.cn
Abstract: Outlier detection is an interesting issue in data mining and machine learning. In this paper, to detect outliers, an information-entropy-based k-nearest neighborhood relevant outlier factor algorithm is proposed that is combined with Shannon information theory and the triangle pruning strategy. The algorithm accounts for the data points whose k-nearest neighbors are distributed on the edge of the range within the designated radius. In particular, the neighborhood influence on each point is considered to address the problem of information concealment and submergence. Information entropy is used to calculate the weights to distinguish the importance of each attribute. Then, based on the attribute weights, the improved pruning strategy reduces the computational complexity of the subsequent procedures by removing some inliers and obtaining the outlier candidate dataset. Finally, according to the weighted distance between the objects in the candidate dataset and those in the original dataset, the algorithm calculates the dissimilarity between each object and its k-nearest neighbors. The data points with the top $r$ dissimilarity are regarded as the outliers. Experimental results show that, compared to existing methods, the proposed approach improves pruning and detection rates while maintaining the coverage rate.
Keywords: Outlier detection, information entropy, attribute weights, pruning, k-nearest neighborhood relevant outlier factor (kNNROF)
DOI: 10.3233/IDA-150301
Journal: Intelligent Data Analysis, vol. 20, no. 6, pp. 1247-1265, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl