基于L1范数稀疏距离测度学习的单类分类算法  

L1 Norm Sparse Distance Metric Learning for One-class Classifier

作　　者：胡正平[1] 路亮[1] 许成谦[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《电子学报》2012年第1期134-140,共7页Acta Electronica Sinica

基　　金：国家自然科学基金(No.61071199);河北省自然科学基金(No.F2008000891;No.F2010001297);中国博士后自然科学基金(No.20080440124);第二批中国博士后特别资助基金(No.200902356)

摘　　要：已有单类分类算法通常采用欧氏测度描述样本间相似关系,然而欧氏测度有时难以较好地反映一些数据集样本的内在分布结构,为此提出一种用于改善单类分类器描述性能的高维空间单类数据距离测度学习算法,与已有距离测度学习算法相比,该算法只需提供目标类数据,通过引入样本先验分布正则化项和L1范数惩罚的距离测度稀疏性约束,能有效解决高维空间小样本情况下的单类数据距离测度学习问题,并通过采用分块协调下降算法高效的解决距离测度学习的优化问题.学习得到的距离测度能容易地嵌入到单类分类器中,仿真实验结果表明采用学习得到的距离测度能有效改善单类分类器的描述性能,特别能够改善覆盖分类的描述能力,从而使得单类分类器具有更强的推广能力.Most one-class classification algorithms measure similarity based on Euclidean distance between samples. Unfortu- nately, the Euclidean distance couldn＇ t reveal the internal distribution of some datasets, and so reduced the descriptive ability of these methods. A distance metric learning algorithm was proposed to improve the performance of one-class classifiers in this paper. Compared with existing distance metric learning algorithm, the algorithm only needed to provide target class data, it could effectively solve distance metric learning problem for one-class samples in high-dimensional space by imposing sample distribution prior and sparsity prior with ll-norm constraint on the distance metric, and the formulation could be efficiently optimized in a block coordina- tion descent algorithm. The learned metric can be easily embedded into one-class classifiers, the simulation experimental results show that the learned metric can effectively improve the description performance of one-class classifiers, in particular the description of covering classification model and obtain better generalization ability of one-class classifiers.

关 键 词：模式识别 稀疏距离测度学习 L1范数 单类分类器 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]