基于近邻关系的离群约简搜索算法  

Searching Algorithm for Outlying Reduction Based on Neighbor Relation

作　　者：胡云[1,2] 潘祝山 施珺[1] 

机构地区：[1]淮海工学院计算机工程学院,江苏连云港222000 [2]南京大学计算机科学与技术系,南京210000

出　　处：《计算机工程》2011年第21期38-39,42,共3页Computer Engineering

基　　金：江苏省自然科学基金资助项目(BK2008190)

摘　　要：针对传统离群点检测过程中属性多、维度大等问题,结合粗糙集理论,提出一种基于近邻关系的离群约简搜索算法。利用属性约简技术解决对象不相容的问题,并有效缩减离群搜索的属性空间。计算任意点与其他所有点间的距离和,通过计算基于近邻的加权离群因子来判定离群点,并在通用数据集上进行测试。实验结果表明,该离群检测算法的搜索精度较高。Traditional outlier detection algorithms often take all attributes of the dataset into account thus result in heavy cost for handling high dimensional data.This paper proposes a searching algorithm for outlying reduction based on neighbor relation inspired by rough set theory and related techniques.This approach employs attribute reduction technology on the inconsistent decision table,which reduces the attribute fields.It computes the sum distance of the current point to all the other points and formulates a neighbor-based outlier factor to judge the abnormality of the data object.Experimental results on the public dataset show that this method is efficient and effective.

关 键 词：离群点检测 离群因子 核属性集 决策表 近邻关系 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]