首页 | 本学科首页   官方微博 | 高级检索  
     

基于共享最近邻的离群检测算法
引用本文:苏晓珂,郑远攀,万仁霞.基于共享最近邻的离群检测算法[J].计算机应用研究,2012,29(7):2426-2428.
作者姓名:苏晓珂  郑远攀  万仁霞
作者单位:1. 郑州轻工业学院计算机与通信工程学院,郑州,450002
2. 北方民族大学信息与计算科学学院,银川,750021
基金项目:国家自然科学基金资助项目(61163017); 郑州轻工业学院博士科研基金资助项目(2010BSJJ039); 河南省科技攻关资助项目(122102210125); 河南教育厅自然科学基础研究计划资助项目(12B520051)
摘    要:为识别混合属性数据集中的离群点,提出了一种基于共享最近邻的离群检测算法,通过计算增量聚类结果簇间的共享最近邻相似度,不但能够发现任意形状的簇,还可以检测到变密度数据集中的全局离群点。算法时间复杂度关于数据集的大小和属性个数呈近似线性。在人工数据集和真实数据集上的实验结果显示,提出的算法能有效检测到数据集中的离群点。

关 键 词:共享最近邻  离群检测  任意形状簇  混合属性

Outlier detection algorithm based on shared nearest neighbor
SU Xiao-ke,ZHENG Yuan-pan,WAN Ren-xia.Outlier detection algorithm based on shared nearest neighbor[J].Application Research of Computers,2012,29(7):2426-2428.
Authors:SU Xiao-ke  ZHENG Yuan-pan  WAN Ren-xia
Affiliation:1. School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China; 2. College of Information & Computation Science, Beifang University for Nationalities, Yinchuan 750021, China
Abstract:This paper introduced an outlier detection algorithm based on the shared nearest neighbor clustering in order to detect the outliers with the mixed attributes. The algorithm calculated the shared nearest neighbor similarity measure between result clusters caused by the incremental clustering. It could not only find the arbitrary shape clusters but also identify the global outlier in large and high-dimensional dataset with different density. Presented approach had nearly linear time complexity with the number of attributes and the size of dataset which results in good scalability.
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号