基于邻接图的离群数据聚类算法  

Clustering Algorithm of Outliers Based on Adjacency Graph

作　　者：金义富[1] 朱庆生[2] 邹咸林[2] 

机构地区：[1]湛江师范学院信息学院,湛江524048 [2]重庆大学计算机学院,重庆400044

出　　处：《计算机工程》2008年第11期72-73,76,共3页Computer Engineering

基　　金：重庆市自然科学基金资助项目(2005BB2224)

摘　　要：离群数据是数据中的小模式,因其固有的少数据与稀疏性等特征,使得基于距离或基于统计等常规聚类方式不适用于对离群数据的分类。该文根据离群对象关键域子空间的重合度,定义了离群共享属性集与离群相似度等概念,提出β-离群簇分析技术。通过构建离群邻接图并将其稀疏化,将β-离群簇搜索与相应的离群邻接图的最大完全子图搜索一一对应,给出一种基于邻接图的离群数据聚类算法。算例及实验结果表明,该方法具有较高的效率及良好的直观性。Outliers are small pattern in data space. General clustering approaches, such as distance-based and statistics-based, are not adapted to classification of outliers because of their characteristic of fewness data and sparseness. This paper defines concepts of outlying shared attribute and outlying similarity based on the key attribute subspace of an outlier and proposes an analysis technique on β-cluster of outliers. An algorithm for clustering of outliers based on adjacency graph is put forward in this paper. Its main idea includes establishment and simplification of outlying adjacency graph in which a maximum complete subgraph is corresponding with a β-cluster of outliers. Examples and experimental results show that the algorithm is intuitionistic and well efficient.

关 键 词：离群数据 关键域子空间 离群邻接图 聚类算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]