摘要
为了提高基于支持域的单类分类器识别率,提出将局部密度加入到分类器设计当中。在Campbe ll等的LP算法基础上,通过k近邻方法对每个样本点引入局部密度因子pi,重新刻画了原算法,使处于不同密度区的数据对分类器的作用不再被同等对待,高密度区的数据对分类超平面作用被强化,而低密度区的数据被削弱,结果使分类超平面自动靠近高密度区而提高了识别率。真实数据集上的实验结果表明,引入局部密度的D-LP算法其泛化性能较原算法有较大提高。
To improve the accuracy of domain-based one-class classifiers, a novel method is incorporated local density information of classifier design. Using the k-nearest neighbor algorithm, Campbell' s linear programming (LP) algorithm is reformulated by introducing a local density factor for each data point. This density-based LP (D-LP) algorithm does not treat each point as equivalent ones are in the original LP. It modifies their attributions to the hyperplane according to their place in the density distribution. The points in the dense area are emphasized and the ones in the sparse domain are weakened. So the classification hyperplane is automatically attracted towards the emphasized density region, and the accuracy is improved. Experiments with real data sets show that the local density-based LP algorithm is superior to the original on generalized performances.
出处
《南京航空航天大学学报》
EI
CAS
CSCD
北大核心
2006年第6期727-731,共5页
Journal of Nanjing University of Aeronautics & Astronautics
基金
南京航空航天大学青年科研基金(1004-274015)的资助
关键词
单类分类器
线性规划
支持域
局部密度因子
one/single-class classifier
linear programming (LP)
support domain
local density factor