基于相对密度的孤立点和边界点识别算法-计算机科学.PDF

Vo 1. 43 No. 6A 第 43 卷第6A 期 计算机科学 2016 年 6 月 Computer Science June 2016 基于相对密度的孤立点和边界点识别算法 李光兴 (成都农业科技职业学院 成都 611130) 摘 要 根据孤立点是数据集合中与大多数数据的属性不一致的数据，边界点是位于不同密度数据区域边缘的数据 对象，提出了基于相对密度的孤立点和边界点识别算法(OBRD) 。该算法判断一个数据点是否为边界点或孤立点的 方法是:将以该数据点为中心、γ 为半径的邻域按维平分为 2 个半邻域，由这些半邻域与原邻域的相对密度确定该数 据点的孤立度和边界度，再结合l司值作出判断。实验结果表明，该算法能精准有效地对多密度数据集的孤立点和聚类 边界点进行识别。 关键词 邻域，密度，孤立度，孤立点，边界度，边界点 中圄法分类号 TP311 文献标识码 A Recognition Algorithm of Outlier and Bounda叮 Points Based on Relative Density LI Guang-xing (Chengdu Agricultural College ,Chengdu 611130 ,China) Abstract According to the fact that outlier points are the data that are inconsistent with most of data in a data set ,and that boundary points are located on the edge of data area with different densities ,an algorithm based on relative density was proposed to determine the outlier and boundary points. Through dividing the neighborhood area ,which is centered by this point with a radius of ηinto two semi-neighborhood areas ,and determining this data point s isolation level and boundary level based on the relative density of these serni-neighborhood areas with the original neighborhood area ,a fi- nal judgment whether a data point is boundary or outlier point can be made according to the threshold value. Experimen tal results indicate that this algorithm can effectively and accurately identify the outlier and boundary points from multi- density data sets. Ke归10时s Neighborhood ,Density , lsolation level ， Outli町，Boundary level , Boundary points 基于网格的孤立点算法[川1J 是将存储数据对象的空间