JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2017, Vol. 52 ›› Issue (3): 91-96.doi: 10.6040/j.issn.1671-9352.4.2016.080

Previous Articles     Next Articles

Cost-sensitive feature selection via manifold learning

HUANG Tian-yi, ZHU William*   

  1. Laboratory of Granular Computing, Minnan Normal University, Zhangzhou 363000, Fujian, China
  • Received:2016-06-01 Online:2017-03-20 Published:2017-03-20

Abstract: In order to get a low-cost subset of original features, we define the cost-distance among the samples and joint it to existing feature selection framework. We combine manifold learning into cost-sensitive feature selection model and develop a corresponding method, namely, cost-sensitive feature selection via manifold learning(CFSM). Most previous cost-sensitive feature selection algorithms rank features individually and select features just using correlation the between the cost and the features. Our cost-sensitive feature selection algorithm selects features not only using the correlation the between the cost and the features but also using the discriminative information implied within data to improve the features selection performance. Experimental results on different real world datasets show the promising performance of CFSM outperforms the state-of-the-arts.

Key words: cost-sensitive, manifold learning, feature selection, supervised learning

CLC Number: 

  • O151.26
[1] SAITTA L. Machine learning — a technological roadmap[M]. Amsterdam: University of Amsterdam, 2001.
[2] FRASCA M, BASSIS S. Gene-disease prioritization through cost-Sensitive graph-based methodologies[C] //International Work-Conference on Bioinformatics and Biomedical Engineering. Berlin: Springer International Publishing, 2016:739-751.
[3] WEI Fan, STOLFO S J, ZHANG Jingdan, et al. Adacost: misclassification cost-sensitive boosting[C] //Sixteenth International Conference On Machine Learning. Burlington: Morgan Kaufmann Publishers Inc, 1999:97-105.
[4] TURNEY P D. Types of cost in inductive concept learning[C] //The Workshop on Cost-Sensitive Learning at the Seventeenth International Conference on Machine Learning. S. l: s. n, 2002:15-21.
[5] LU Jiwen, TAN Y P. Cost-Sensitive subspace analysis and extensions for face recognition[J]. IEEE Transactions on Information Forensics and Security, 2013, 8(3):510-519.
[6] LU Jiwen, ZHOU Xiuzhuang, TAN Y P, et al. Cost-sensitive semi-supervised discriminant analysis for face recognition[J]. IEEE Transactions on Information Forensics and Security, 2012, 7(3):944-953.
[7] ZADROZNY B, ELKAN C. Learning and making decisions when costs and probabilities are both unknown[C] //Seventh Acm Sigkdd International Conference on Knowledge Discovery and Data Mining. S. l: s. n, 2001:204-213.
[8] DOMINGOS P. MetaCost: a general method for making classifiers cost-sensitive[C] //Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining. S. l: s. n, 1999:155-164.
[9] MIAO Linsong, LIU Mingxia, ZHANG Daoqiang. Cost-sensitive feature selection with application in software defect prediction[C]. IEEE International Conference on Pattern Recognition, 2012:967-970.
[10] LU Jiwen, TAN Y P. Regularized locality preserving projections and its extensions for face recognition[J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B(Cybernetics), 2009, 40(3): 958-963.
[11] BELKIN M, NIYOGI P. Laplacian eigenmaps and spectral techniques for embedding and clustering[J]. Advances in Neural Information Processing Systems, 2002, 14(6):585-591.
[12] CAI Deng, ZHANG Chiyuan, HE Xiaofei. Unsupervised feature selection for multi-cluster data[C] //ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Washington Dc: s. n, 2010:333-342.
[13] ZHANG Yin, ZHOU Zhihua. Cost-sensitive face recognition[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010, 32(10): 1758-1769.
[14] SHI Jianbo, MALIK J. Normalized cuts and image segmentation[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888-905.
[15] ROWEIS S T, SAUL L K. Nonlinear dimensionality reduction by locally linear embedding[J]. Science, 2000, 290(5500): 2323-2326.
[16] NIE Feiping, HUANG Heng, CAI Xiao, et al. Efficient and robust feature selection via joint l2, 1-norms minimization[C] //Advances in Neural Information Processing Systems 23: Conference on Neural Information Processing Systems 2010. Proceedings of a Meeting Held 6-9 December 2010. Vancouver: s. n, 2010:1813-1821.
[17] EFRON B, HASTIE T, JOHNSTONE I, et al. Least angle regression[J]. The Annals of Statistics, 2004, 32(2):407-499.
[18] ZHAO Hong, MIN Fan, ZHU W. Cost-sensitive feature selection of data with errors[J]. Journal of Applied Mathematics, Article ID, 2013, 754698: 18.
[19] ZHU Pengfei, ZUO Wangmeng, ZHANG Lei, et al. Unsupervised feature selection by regularized self-representation[J]. Pattern Recognition, 2015, 48(2): 438-446.
[1] WU Xiaojun, CHEN Yidan, HAO Yaojun, SONG Changwei, HE Deqing. Multi-label feature selection with label manifold and dynamic graph constraints [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(7): 69-83.
[2] CHEN Junfen, LI Nana, XIE Bojun, ZHANG Jie. Semi-weakly supervised object detection using bi-attention-guided feature fusion [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2025, 60(1): 1-13.
[3] Jiyuan YANG,Muyang MA,Pengjie REN,Zhumin CHEN,Zhaochun REN,Xin XIN,Fei CAI,Jun MA. Research on self-supervised pre-training for recommender systems [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(7): 1-26.
[4] CHENG Yuxuan, MAO Yu, ZHANG Xiaoqing, ZENG Yixiang, LIN Yaojin. Online multi-label feature selection based on sub-correlation features and neighborhood mutual information [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(5): 70-81.
[5] GAO Hefei, LI Yan, WANG Shuo. Feature selection for partial label learning based on neighborhood rough sets [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(5): 100-113.
[6] ZHU Liquan, LIN Yaojin, MAO Yu, CHENG Yuxuan. Multi-label online stream feature selection based on high-dimensional correlation [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(5): 90-99.
[7] Chunyu SHI,Yu MAO,Haoyang LIU,Yaojin LIN. Hierarchical feature selection algorithm based on instance correlations [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(3): 61-70.
[8] WANG Tinghua, HU Zhenwei, ZHAN Hongxiang. A novel unsupervised feature selection method [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(12): 130-140.
[9] ZHANG Zhi-hao, LIN Yao-jin, LU Shun, WU Yi-lin, WANG Chen-xi. Multi-label feature selection with streaming and missing labels [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(8): 39-52.
[10] SUN Lin, CHEN Yu-sheng, XU Jiu-cheng. Multilabel feature selection algorithm based on improved ReliefF [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(4): 1-11.
[11] SUN Lin, LIANG Na, XU Jiu-cheng. Feature selection using adaptive neighborhood mutual information and spectral clustering [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(12): 13-24.
[12] ZHANG Yao, MA Ying-cang, YAND Xiao-fei, ZHU Heng-dong, YANG Ting. Multi-label feature selection based on manifold structure and flexible embedding [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(7): 91-102.
[13] ZHANG Bin-yan, ZHU Xiao-fei, XIAO Zhao-hui, HUANG Xian-ying, WU Jie. Short text classification based on semi-supervised graph neural network [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(5): 57-65.
[14] YANG Ting, ZHU Heng-dong, MA Ying-cang, WANG Yi-rui, YANG Xiao-fei. Semi-supervised spectral clustering algorithm based on L2,1 norm and manifold regularization terms [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2021, 56(3): 67-76.
[15] YANG Ya-ru, WANG Yong-qing, ZHANG Zhi-bin, LIU Yue, CHENG Xue-qi. Social network user identity linkage model based on comprehensive information [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2019, 54(9): 105-113.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!