一种基于k近邻图的稀有类检测算法  

Rare Category Detection Algorithm Based on k-Nearest Neighbor Graphs

作　　者：王淞[1] 黄浩[1] 余果[2] 梁楠[1] 王黎维[3] 孙月明[1] 

机构地区：[1]武汉大学计算机学院,湖北武汉430072 [2]武汉大学中南医院,湖北武汉430072 [3]武汉大学国际软件学院,湖北武汉430072

出　　处：《软件学报》2016年第9期2320-2331,共12页Journal of Software

基　　金：国家自然科学基金(61502347;61272275;61202033;61070013;U1135005);中央高校基本科研业务费专项资金(2042015kf0038);武汉大学人才计划/引进人才科研启动经费~~

摘　　要：稀有类检测的目标是为无类别标签的数据集中的每个类,特别是仅含少量数据样本的稀有类,寻找到至少一个数据样本以证明数据集中存在这些类.该技术在金融欺诈检测及网络入侵检测等现实问题中具有广泛的应用场景.但是,现有的稀有类检测算法往往存在以下问题:(1)时间复杂度比较高;或(2)对原始数据集需要一定的先验知识,如数据集中各类数据样本所占比例等.提出了一种基于k邻近图的无先验快速稀有类检测算法KRED,通过利用稀有类数据样本在小范围内紧密分布所造成的与周边数据分布的不一致性来定位稀有类.为此,KRED将给定数据集转化为k邻近图,并计算图中各顶点入度和边长的变化.最后,将以上变化最大的顶点对应的数据样本作为稀有类的候选样本.实验结果表明:KRED有效提高了发现数据集中各个类的效率,明显缩短了算法运行所需时间.Rare category detection aims at finding at least one data example for each class in an unlabeled data set to prove the existence of these classes, especially the rare classes （a.k.a. rare categories） that have only a few data examples. It has various applications in the fields like financial fraud detection and network intrusion detection. Nevertheless, the existing approaches to this problem suffer either in terms of time complexity or the requirements for prior information about data sets （e.g., the proportion of data examples in each class）. In this paper, a prior-free and efficient algorithm, called KRED is proposed for rare category detection. The algorithm explores the changes on local data distribution caused by the presence of the compact clusters of rare classes. To this end, it transforms a data set into a k-nearest neighbor graph, and investigates the variations in both edge lengths and in-degrees between the nodes. Finally, nodes with the maximal variations are selected as the candidate data examples of rare classes. Experimental results show that KRED effectively improves the efficiency of discovering new classes in data sets, and notably reduces the execution time.

关 键 词：稀有类检测 k邻近图 数据分布 变化系数 入度 

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