직교 분해와 저랭크 근사를 이용한 비지도 특징 선별 기법
Unsupervised feature selection using orthogonal decomposition and low-rank approximation
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
본 논문에서는 새로운 비지도 특징 선별 기법을 제안한다. 기존 비지도 방식의 특징 선별 기법들은 특징을 선별하기 위해 가상의 레이블 데이터를 정하고 주어진 데이터를 이 레이블 데이터에사영하는 회귀 분석 방식으로 특징을 선별하였다. 하지만 가상의 레이블은 데이터로부터 생성되기 때문에 사영된 공간이 비슷하게 형성될 수 있다. 따라서 기존의 방법들에서는 제한된 공간에서만 특징이 선택될 수 있었다. 이를 해소하기 위해 본 논문에서는 직교 사영과 저랭크 근사를이용하여 특징을 선별한다. 이 문제를 해소하기 위해 가상의 레이블을 직교 사영하고 이 공간에데이터를 사영할 수 있도록 한다. 이를 통해 더 주요한 특징 선별을 기대할 수 있다. 그리고 사영을 위한 변환 행렬에 저랭크 제한을 두어 더 효과적으로 저차원 공간의 특징을 선별할 수 있도록한다. 이 목표를 달성하기 위해 본 논문에서는 비용 함수를 설계하고 효율적인 최적화 방법을 제안한다. 여섯 개의 데이터에 대한 실험 결과는 제안된 방법이 대부분의 경우 기존의 비지도 특징선별 기법보다 좋은 성능을 보여주었다.
Abstract
In this paper, we propose a novel unsupervised feature selection method. Conventional unsupervised feature selection method defines virtual label and uses a regression analysis that projects the given data to this label. However, since virtual labels are generated from data, they can be formed similarly in the space. Thus, in the conventional method, the features can be selected in only restricted space. To solve this problem, in this paper, features are selected using orthogonal projections and low-rank approximations. To solve this problem, in this paper, a virtual label is projected to orthogonal space and the given data set is also projected to this space. Through this process, effective features can be selected. In addition, projection matrix is restricted low-rank to allow more effective features to be selected in low-dimensional space. To achieve these objectives, a cost function is designed and an efficient optimization method is proposed. Experimental results for six data sets demonstrate that the proposed method outperforms existing conventional unsupervised feature selection methods in most cases.
참고문헌 (22)
- E. Smirni, "Workload-Aware Load Balancing for Cluster Web Servers", IEEE Trans. on Parallel and Distributed Systems, 16(3), pp.219~232 (2005)[DOI]
- E. Elhamifar, "Sparse subspace clustering: Algorithm, theory, and applications", IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(11), pp.2765~2781 (2013)[DOI]
- S. Sharmin, "Simultaneous feature selection and discretization based on mutual information", Pattern Recognition, 91, pp.162~174 (2019)[DOI]
- R. Sheikhpour, "A survey on semi-supervised feature selection methods", Pattern Recognition, 64 (2017)[DOI]
- S. Du, "Robust unsupervised feature selection via matrix factorization", Neurocomputing, 241, pp.115~127 (2017)[DOI]
- F. Nie, "Efficient and robust feature selection via joint l2, 1-norms minimization", Advances in Neural Information Processing Systems, pp.1813~1821 (2010)
- X. He, "Locality preserving projections", Advances in neural information processing systems, 16 (2003)
- D. Cai, Deng, "Unsupervised feature selection for multi-cluster data", Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pp.333~342 (2010)
- Z. Li, "Unsupervised feature selection using nonnegative spectral analysis", Proceedings of the AAAI Conference on Artificial Intelligence, 2, pp.1026~1032 (2012)
- S. Wang, "Embedded unsupervised feature selection", Proceedings of the AAAI Conference on Artificial Intelligence, 29, pp.470~476 (2015)
- P. Zhu, "Unsupervised feature selection by regularized self-representation", Pattern Recognition, 48(2), pp.438~446 (2015)[DOI]
- D. Han, "Unsupervised simultaneous orthogonal basis clustering feature selection", Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.5016~5023 (2015)
- S. Du, "Robust unsupervised feature selection via matrix factorization", Neurocomputing, 241, pp.115~127 (2017)[DOI]
- J. Lee, "Efficient information-theoretic unsupervised feature selection", Electronics Letters, 54(2), pp.76~77 (2017)
- C. Ding, "On the equivalence of nonnegative matrix factorization and spectral clustering", Proceedings of the International Conference on Data Mining, pp.606~610 (2005)
- X. Zhong, "A nonconvex relaxation approach for rank minimization problems", Proceedings of the AAAI Conference on Artificial Intelligence, 29(1) (2015)
- B. Recht, "Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization", SIAM Review, 52(3), pp.471~501 (2010)[DOI]
- H. Zhang, "Low-rank matrix recovery via modified Schatten-norm minimization with convergence guarantees", IEEE Transactions on Image Processing, 29, pp.3132~3142 (2019)[DOI]
- X. Zhen, "Multi-target regression via robust low-rank learning", IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(2), pp.497~504 (2017)[DOI]
- D. Cai, "Graph regularized nonnegative matrix factorization for data representation", IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(8), pp.1548~1560 (2010)[DOI]
- X. Wu, "Online feature selection with streaming features", IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(5), pp.1178~1192 (2012)[DOI]
- J. G. Dy, "Feature selection for unsupervised learning", Journal of Machine Learning Research, 5, pp.845~889 (2004)