Implicit Regularization for Multi-label Feature Selection
원문 초록
In this paper, we address the problem of feature selection in the context of multi-label learning, by using a new estimator based on implicit regularization and label embedding. Unlike the sparse feature selection methods that use a penalized estimator with explicit regularization terms such as $l_{2,1}$-norm, MCP or SCAD, we propose a simple alternative method via Hadamard product parameterization. In order to guide the feature selection process, a latent semantic of multi-label information method is adopted, as a label embedding. Experimental results on some known benchmark datasets suggest that the proposed estimator suffers much less from extra bias, and may lead to benign overfitting.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Noise-Resistant Label Reconstruction Feature Selection for Partial Multi-Label Learning
GPMFS: Global Foundation and Personalized Optimization for Multi-Label Feature Selection
Multi-label feature selection based on binary hashing learning and dynamic graph constraints
Uncertainty-Aware Global-View Reconstruction for Multi-View Multi-Label Feature Selection
LLSF - Learning Label Specific Features for Multi-Label Classifcation
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.