基于正则互表示的无监督特征选择方法

doi:10.11772/j.issn.1001-9081.2019122075

计算机应用 ›› 2020, Vol. 40 ›› Issue (7): 1896-1900.DOI: 10.11772/j.issn.1001-9081.2019122075

基于正则互表示的无监督特征选择方法

汪志远, 降爱莲, 奥斯曼·穆罕默德

太原理工大学信息与计算机学院, 山西晋中 030600

收稿日期:2019-12-09 修回日期:2020-02-24 出版日期:2020-07-10 发布日期:2020-03-26
通讯作者: 降爱莲
作者简介:汪志远(1992-),男,安徽宿州人,硕士研究生,主要研究方向:机器学习、特征选择;降爱莲(1969-),女,山西太原人,副教授,博士,CCF会员,主要研究方向:人工智能、大数据、特征选择、计算机视觉;奥斯曼·穆罕默德(1993-),男,埃塞俄比亚人,硕士研究生,主要研究方向:深度学习、图像处理。
基金资助:
山西省回国留学人员科研资助项目（2017-051）。

Unsupervised feature selection method based on regularized mutual representation

WANG Zhiyuan, JIANG Ailian, MUHAMMAD Osman

College of Information and Computer, Taiyuan University of Technology, Jinzhong Shanxi 030600, China

Received:2019-12-09 Revised:2020-02-24 Online:2020-07-10 Published:2020-03-26
Supported by:
This work is partially supported by the Research Project of Shanxi Scholarship Council of China (2017-051).

摘要/Abstract

摘要： 针对高维数据含有的冗余特征影响机器学习训练效率和泛化能力的问题，为提升模式识别准确率、降低计算复杂度，提出了一种基于正则互表示（RMR）性质的无监督特征选择方法。首先，利用特征之间的相关性，建立由Frobenius范数约束的无监督特征选择数学模型；然后，设计分治-岭回归优化算法对模型进行快速优化；最后，根据模型最优解综合评估每个特征的重要性，选出原始数据中具有代表性的特征子集。在聚类准确率指标上，RMR方法与Laplacian方法相比提升了7个百分点，与非负判别特征选择（NDFS）方法相比提升了7个百分点，与正则自表示（RSR）方法相比提升了6个百分点，与自表示特征选择（SR_FS）方法相比提升了3个百分点；在数据冗余率指标上，RMR方法与Laplacian方法相比降低了10个百分点，与NDFS方法相比降低了7个百分点，与RSR方法相比降低了3个百分点，与SR_FS方法相比降低了2个百分点。实验结果表明，RMR方法能够有效地选出重要特征，降低数据冗余率，提升样本聚类准确率。

关键词: 特征选择, 无监督学习, 分治算法, 岭回归, 正则化

Abstract: The redundant features of high-dimensional data affect the training efficiency and generalization ability of machine learning. In order to improve the accuracy of pattern recognition and reduce the computational complexity, an unsupervised feature selection method based on Regularized Mutual Representation (RMR) property was proposed. Firstly, the correlations between features were utilized to establish a mathematical model for unsupervised feature selection constrained by Frobenius norm. Then, a divide-and-conquer ridge regression optimization algorithm was designed to quickly optimize the model. Finally, the importances of the features were jointly evaluated according to the optimal solution to the model, and a representative feature subset was selected from the original data. On the clustering accuracy, RMR method is improved by 7 percentage points compared with the Laplacian method, improved by 7 percentage points compared with the Nonnegative Discriminative Feature Selection (NDFS) method, improved by 6 percentage points compared with the Regularized Self-Representation (RSR) method, and improved by 3 percentage points compared with the Self-Representation Feature Selection (SR_FS) method. On the redundancy rate, RMR method is reduced by 10 percentage points compared with the Laplacian method, reduced by 7 percentage points compared with the NDFS method, reduced by 3 percentage points compared with the RSR method, and reduced by 2 percentage points compared with the SR_FS method. The experimental results show that RMR method can effectively select important features, reduce redundancy rate of data and improve clustering accuracy of samples.

Key words: feature selection, unsupervised learning, divide-and-conquer algorithm, ridge regression, regularization

中图分类号:

TP181

汪志远, 降爱莲, 奥斯曼·穆罕默德. 基于正则互表示的无监督特征选择方法[J]. 计算机应用, 2020, 40(7): 1896-1900.

WANG Zhiyuan, JIANG Ailian, MUHAMMAD Osman. Unsupervised feature selection method based on regularized mutual representation[J]. Journal of Computer Applications, 2020, 40(7): 1896-1900.

参考文献

[1] CHANDRASHEKAR G,SAHIN F. A survey on feature selection methods[J]. Computers and Electrical Engineering,2014,40(1):16-28.
[2] WANG S,PEDRYCZ W,ZHU Q,et al. Unsupervised feature selection via maximum projection and minimum redundancy[J]. Knowledge-Based Systems,2015,75:19-29.
[3] 黄铉. 特征降维技术的研究与进展[J]. 计算机科学,2018,45(6A):16-21,53.(HUANG X. Research and development of feature dimensionality reduction[J]. Computer Science,2018,45(6A):16-21,53.)
[4] ZHU P,ZHU W,HU Q,et al. Subspace clustering guided unsupervised feature selection[J]. Pattern Recognition,2017,66:364-374.
[5] LI J,CHENG K,WANG S,et al. Feature selection:a data perspective[J]. ACM Computing Surveys,2018,50(6):No. 94.
[6] MORADI P,ROSTAMI M. A graph theoretic approach for unsupervised feature selection[J]. Engineering Applications of Artificial Intelligence,2015,44:33-45.
[7] NIE F,ZHU W,LI X. Unsupervised feature selection with structured graph optimization[C]//Proceedings of the 30th AAAI Conference on Artificial Intelligence. Palo Alto,CA:AAAI Press,2016:1302-1308.
[8] HE X,JI M,ZHANG C,et al. A variance minimization criterion to feature selection using Laplacian regularization[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,2011,33(10):2013-2025.
[9] NIE F,XIANG S,JIA Y,et al. Trace ratio criterion for feature selection[C]//Proceedings of the 23rd AAAI Conference on Artificial Intelligence. Palo Alto,CA:AAAI Press,2008:671-676.
[10] 潘锋, 王建东, 牛奔. 基于谱分析的无监督特征选择算法[J]. 计算机应用,2011,31(8):2108-2110,2114.(PAN F,WANG J D,NIU B. Unsupervised feature selection algorithm based on spectral analysis[J]. Journal of Computer Applications,2011,31(8):2108-2110,2114.)
[11] ZHENG W,ZHU X,WEN G,et al. Unsupervised feature selection by self-paced learning regularization[J]. Pattern Recognition Letters,2020,132:4-11.
[12] 刘艳芳, 叶东毅. 基于邻域保持学习的无监督特征选择算法[J]. 模式识别与人工智能,2018,31(12):1096-1102.(LIU Y F,YE D Y. Unsupervised feature selection algorithm based on neighborhood preserving learning[J]. Pattern Recognition and Artificial Intelligence,2018,31(12):1096-1102.)
[13] ZHU P,ZUO W,ZHANG L,et al. Unsupervised feature selection by regularized self-representation[J]. Pattern Recognition, 2015,48(2):438-446.
[14] KHAN I M,ANDERSON K S. Performance investigation and constraint stabilization approach for the orthogonal complement-based divide-and-conquer algorithm[J]. Mechanism and Machine Theory,2013,67:111-121.
[15] SHEN X,ALAM M,FIKSE F,et al. A novel generalized ridge regression method for quantitative genetics[J]. Genetics,2013,193(4):1255-1268.
[16] COHEN M B,ELDER S,MUSCO C,et al. Dimensionality reduction for k-means clustering and low rank approximation[C]//Proceedings of the 201547th Annual ACM Symposium on Theory of Computing. New York:ACM,2015:163-172.
[17] HE X,CAI D,NIYOGI P. Laplacian score for feature selection[C]//Proceedings of the 18th International Conference on Neural Information Processing Systems. Cambridge:MIT Press,2005:507-514.
[18] LI Z,YANG Y,LIU J,et al. Unsupervised feature selection using nonnegative spectral analysis[C]//Proceedings of the 26th AAAI Conference on Artificial Intelligence. Palo Alto,CA:AAAI Press,2012:1026-1032.
[19] HE W,ZHU X,CHENG D,et al. Unsupervised feature selection for visual classification via feature-representation property[J]. Neurocomputing,2017,236:5-13.

基于正则互表示的无监督特征选择方法

Unsupervised feature selection method based on regularized mutual representation

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	湛航, 何朗, 黄樟灿, 李华峰, 张蔷, 谈庆. 改进的基于层次距离的基因表达式编程特征选择分类算法[J]. 计算机应用, 2021, 41(9): 2658-2667.
[2]	祝承, 赵晓琦, 赵丽萍, 焦玉宏, 朱亚飞, 陈建英, 周伟, 谭颖. 基于谱聚类半监督特征选择的功能磁共振成像数据分类[J]. 计算机应用, 2021, 41(8): 2288-2293.
[3]	李蒙蒙, 秦伟, 刘艺, 刁兴春. 结合头脑风暴优化的混合蚁群优化算法[J]. 计算机应用, 2021, 41(8): 2412-2417.
[4]	贾鹤鸣, 姜子超, 李瑶, 孙康健. 基于改进斑点鬣狗优化算法的同步优化特征选择[J]. 计算机应用, 2021, 41(5): 1290-1298.
[5]	林筠超, 万源. 基于图结构优化的自适应多度量非监督特征选择方法[J]. 计算机应用, 2021, 41(5): 1282-1289.
[6]	刘睿珩, 叶霞, 岳增营. 面向自然语言处理任务的预训练模型综述[J]. 计算机应用, 2021, 41(5): 1236-1246.
[7]	郭一村, 陈华辉. 在线哈希算法研究综述[J]. 计算机应用, 2021, 41(4): 1106-1112.
[8]	贺杰安, 吴晓红, 何小海, 胡建蓉, 卿粼波. 结合图像增强和卷积神经网络的小麦不完善粒识别[J]. 计算机应用, 2021, 41(3): 911-916.
[9]	张志浩, 林耀进, 卢舜, 郭晨, 王晨曦. 缺失标记下基于类属属性的多标记特征选择[J]. 计算机应用, 2021, 41(10): 2849-2857.
[10]	黄学雨, 徐浩特, 陶剑文. 具有特征选择的多源自适应分类框架[J]. 计算机应用, 2020, 40(9): 2499-2506.
[11]	顾桐, 许国良, 李万林, 李家浩, 王志愿, 雒江涛. 基于集成LightGBM和贝叶斯优化策略的房价智能评估模型[J]. 计算机应用, 2020, 40(9): 2762-2767.
[12]	刘丹, 姚立霜, 王云锋, 裴作飞. 面向类不平衡流量数据的分类模型[J]. 计算机应用, 2020, 40(8): 2327-2333.
[13]	肖跃雷, 张云娇. 基于特征选择和超参数优化的恐怖袭击组织预测方法[J]. 计算机应用, 2020, 40(8): 2262-2267.
[14]	谢琪, 徐旭, 程耕国, 陈和平. 基于新的森林优化算法的特征选择算法[J]. 计算机应用, 2020, 40(5): 1266-1271.
[15]	曹堉, 王成, 王鑫, 高悦尔. 基于时空节点选择和深度学习的城市道路短时交通流预测[J]. 计算机应用, 2020, 40(5): 1488-1493.