An enhanced approach for LOF in data mining

V. Bhatt, K. G. Sharma, A. Ram
{"title":"An enhanced approach for LOF in data mining","authors":"V. Bhatt, K. G. Sharma, A. Ram","doi":"10.1109/ICGHPC.2013.6533918","DOIUrl":null,"url":null,"abstract":"Many techniques are available to find outliers. Out of those, local Outlier Factor (LOF) is quite efficient and well researched outliers mining algorithm. LOF quantifies, how much outlying an object is, in a given database. We proposed, in this paper, a modification in k-distance and named it m-distance that enhances the performance. k-distance is the distance between object and its kth nearest neighbor, while m-distance is mean distance of an object and its k-distance neighborhood, increased by user supplied value λto increase performance. Modified algorithm is named as MLOF. The evaluation on real dataset shows that the proposed modification on LOF detects outliers more effectively.","PeriodicalId":119498,"journal":{"name":"2013 International Conference on Green High Performance Computing (ICGHPC)","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Green High Performance Computing (ICGHPC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICGHPC.2013.6533918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Many techniques are available to find outliers. Out of those, local Outlier Factor (LOF) is quite efficient and well researched outliers mining algorithm. LOF quantifies, how much outlying an object is, in a given database. We proposed, in this paper, a modification in k-distance and named it m-distance that enhances the performance. k-distance is the distance between object and its kth nearest neighbor, while m-distance is mean distance of an object and its k-distance neighborhood, increased by user supplied value λto increase performance. Modified algorithm is named as MLOF. The evaluation on real dataset shows that the proposed modification on LOF detects outliers more effectively.
数据挖掘中LOF的一种增强方法
有许多技术可用于发现异常值。其中,局部离群因子(LOF)是一种高效且研究较多的离群因子挖掘算法。LOF量化一个对象在给定数据库中的距离。在本文中,我们提出了k-distance的一个改进,并将其命名为m-distance,以提高性能。K-distance是物体到它的第k个近邻的距离,m-distance是物体到它的第k个近邻的平均距离,增加用户提供的值λ以提高性能。将改进后的算法命名为MLOF。在真实数据集上的评价表明,改进后的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学术官方微信