稀疏条件下的两层分类算法  

Sparsity-inspired two-level classification algorithm

作　　者：仝伯兵 王士同[1] 梅向东 

机构地区：[1]江南大学数字媒体学院,江苏无锡214122 [2]赞奇科技发展有限公司,江苏常州213000

出　　处：《智能系统学报》2015年第1期27-36,共10页CAAI Transactions on Intelligent Systems

基　　金：国家自然科学基金资助项目(61170122;61272210);江苏省自然科学基金资助项目(BK2011417);江苏省"333"工程基金资助项目(BRA2011142)

摘　　要：在有限样本下距离量的选择对最近邻算法(K-nearest neighbor,KNN)算法有重要影响。针对以前距离量学习泛化性不强以及时间效率不高的问题,提出了一种稀疏条件下的两层分类算法(sparsity-inspired two-level classification algorithm,STLCA)。该算法分为高低2层,在低层使用欧氏距离确定一个未标记的样本局部子空间;在高层,用稀疏贝叶斯在子空间进行信息提取。由于其稀疏性,在噪声情况下有很好的稳定性,可泛化性强,且时间效率高。通过在噪声数据以及在视频烟雾检测中的应用表明,STLCA算法能取得更好的效果。The selection of distance greatly affects KNN algorithm as it relates to finite samples due to weak generalization and low time efficiency in the previous learning of distance. In this paper,a new sparsity-inspired two-level classification algorithm（ STLCA） is proposed. This proposed algorithm is divided into two levels： high and low. It uses Euclidean distance at the low-level to determine an unlabeled sample local subspace and at the high level it uses sparse Bayesian to extract information from subspace. Due to the sparsity in noise conditions,STLCA can have good stability,strong generalization and high time efficiency. The results showed that the STLCA algorithm can achieve better results through the application in noise data and video smoke detection.

关 键 词：稀疏贝叶斯 两层分类 距离学习 视频烟雾检测 最近邻算法 有限样本 泛化性 时间效率 

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