A Genetic-Based Incremental Local Outlier Factor Algorithm for Efficient Data Stream Processing

Omar Alghushairy, Raed Alsini, Xiaogang Ma, T. Soule
{"title":"A Genetic-Based Incremental Local Outlier Factor Algorithm for Efficient Data Stream Processing","authors":"Omar Alghushairy, Raed Alsini, Xiaogang Ma, T. Soule","doi":"10.1145/3388142.3388160","DOIUrl":null,"url":null,"abstract":"Interest in outlier detection methods is increasing because detecting outliers is an important operation for many applications such as detecting fraud transactions in credit card, network intrusion detection and data analysis in different domains. We are now in the big data era, and an important type of big data is data stream. With the increasing necessity for analyzing high-velocity data streams, it becomes difficult to apply older outlier detection methods efficiently. Local Outlier Factor (LOF) is a well-known outlier algorithm. A major challenge of LOF is that it requires the entire dataset and the distance values to be stored in memory. Another issue with LOF is that it needs to be recalculated from the beginning if any change occurs in the dataset. This research paper proposes a novel local outlier detection algorithm for data streams, called Genetic-based Incremental Local Outlier Factor (GILOF). The algorithm works without any previous knowledge of data distribution, and it executes in limited memory. The outcomes of our experiments with various real-world datasets demonstrate that GILOF has better performance in execution time and accuracy than other state-of-the-art LOF algorithms.","PeriodicalId":409298,"journal":{"name":"Proceedings of the 2020 the 4th International Conference on Compute and Data Analysis","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 the 4th International Conference on Compute and Data Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3388142.3388160","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Interest in outlier detection methods is increasing because detecting outliers is an important operation for many applications such as detecting fraud transactions in credit card, network intrusion detection and data analysis in different domains. We are now in the big data era, and an important type of big data is data stream. With the increasing necessity for analyzing high-velocity data streams, it becomes difficult to apply older outlier detection methods efficiently. Local Outlier Factor (LOF) is a well-known outlier algorithm. A major challenge of LOF is that it requires the entire dataset and the distance values to be stored in memory. Another issue with LOF is that it needs to be recalculated from the beginning if any change occurs in the dataset. This research paper proposes a novel local outlier detection algorithm for data streams, called Genetic-based Incremental Local Outlier Factor (GILOF). The algorithm works without any previous knowledge of data distribution, and it executes in limited memory. The outcomes of our experiments with various real-world datasets demonstrate that GILOF has better performance in execution time and accuracy than other state-of-the-art LOF algorithms.
用于高效数据流处理的基于遗传的增量局部离群因子算法
对离群值检测方法的兴趣与日俱增,因为检测离群值是许多应用中的重要操作,如检测信用卡欺诈交易、网络入侵检测和不同领域的数据分析。我们现在正处于大数据时代,而大数据的一个重要类型就是数据流。随着分析高速数据流的需求不断增加,要有效地应用旧的离群点检测方法变得十分困难。局部离群因子(LOF)是一种著名的离群值算法。LOF 面临的一个主要挑战是,它需要将整个数据集和距离值存储在内存中。LOF 的另一个问题是,如果数据集发生任何变化,都需要从头开始重新计算。本研究论文提出了一种新颖的数据流局部离群点检测算法,称为基于遗传的增量局部离群点因子(GILOF)。该算法无需事先了解数据分布情况,并在有限的内存中执行。我们用各种真实数据集进行的实验结果表明,GILOF 在执行时间和准确性方面都优于其他最先进的 LOF 算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信