作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2020, Vol. 46 ›› Issue (5): 47-53. doi: 10.19678/j.issn.1000-3428.0053894

• 人工智能与模式识别 • 上一篇    下一篇

基于三元组排序局部性的SOCFS改进算法

吴昌明, 赵兴涛, 柳可鑫   

  1. 中国人民公安大学 信息技术与网络安全学院, 北京 102623
  • 收稿日期:2019-02-07 修回日期:2019-04-04 发布日期:2019-05-27
  • 作者简介:吴昌明(1982-),男,讲师、硕士,主研方向为人工智能、网络安全;赵兴涛,副教授、硕士;柳可鑫,本科生。
  • 基金资助:
    国家重点研发计划(2017YFC0820606);国家自然科学基金(61771072);公安部科技强警基础工作专项(2014GABJC026)。

Improved SOCFS Algorithm Based on Triplet Ordinal Locality

WU Changming, ZHAO Xingtao, LIU Kexin   

  1. College of Information Technology and Cyber Security, People's Public Security University of China, Beijing 102623, China
  • Received:2019-02-07 Revised:2019-04-04 Published:2019-05-27

摘要: 特征选择是一种常用的机器学习降维方法,然而传统非监督特征选择算法在保持数据样本维度的局部结构时,却忽略了排序局部性对特征选择的影响。利用数据的三元组局部结构,构建数据之间的排序关系并在特征选择过程中进行局部性保持,提出基于三元组排序局部性的同时正交基聚类特征选择(SOCFS)改进算法,选择具有局部结构保持性且判别区分度高的特征。实验结果表明,与传统非监督特征选择算法相比,SOCFS改进算法聚类效果更好、收敛速度更快。

关键词: 非监督特征选择, 三元组, 排序局部性, 聚类, 收敛性

Abstract: Features selection is commonly used in dimensionality reduction of machine learning,but existing unsupervised feature selection algorithms often ignore the influence of ordinal locality on feature selection while preserving the local structure of dimensionality of data samples.To address the problem,this paper proposes an improved Simultaneous Orthogonal Basis Clustering Feature Selection(SOCFS) algorithm based on triplet ordinal locality.The algorithm uses the local structure of triplets in data to construct ordinal relationships between data,and preserves the locality of such relationships in feature selection.On this basis,the features that can preserve local structure and have high discrimination for judgment are selected.Experimental results show that the improved algorithm outperforms traditional unsupervised feature selection algorithms in terms of clustering performance and convergence speed.

Key words: unsupervised feature selection, triplet, ordinal locality, clustering, convergence

中图分类号: