ABM: an automatic supervised feature engineering method for loss based models based on group and fused lasso
A vital problem in solving classification or regression problem is to apply feature engineering and variable selection on data before fed into models.One of a most popular feature engineering method is to discretisize continous variable with some cutting points,which is refered to as bining processing.Good cutting points are important for improving model's ability, because wonderful bining may ignore some noisy variance in continous variable range and keep useful leveled information with good ordered encodings.However, to our best knowledge a majority of cutting point selection is done via researchers domain knownledge or some naive methods like equal-width cutting or equal-frequency cutting.In this paper we propose an end-to-end supervised cutting point selection method based on group and fused lasso along with the automatically variable selection effect.We name our method \textbf{ABM}(automatic bining machine). We firstly cut each variable range into fine grid bins and train model with our group and group fused lasso regularization on each successive bins.It is a method that integrates feature engineering,variable selection and model training simultanously.And one more inspiring thing is that the method is flexible such that it can be taken into a bunch of loss function based model including deep neural networks.We have also implemented the method in R and open the source code to other researchers.A Python version will also meet the community in days.
Code (0)
등록된 구현이 없습니다.
Tasks
Feature EngineeringVariable SelectionSimilar Papers 제목 키워드 기반
Cognito: Automated Feature Engineering for Supervised Learning
Feature engineering involves constructing novel features from given data with the goal of improving predictive learning performance. Feature engineering is predominantly a human-intensive and time consuming step that is …
Automated Feature EngineeringFeature EngineeringModel SelectionAutomatically Redundant Features Removal for Unsupervised Feature Selection via Sparse Feature Graph
The redundant features existing in high dimensional datasets always affect the performance of learning and mining algorithms. How to detect and remove them is an important research topic in machine learning and data mini…
feature selectionSparse LearningScore-oriented loss (SOL) functions
Loss functions engineering and the assessment of forecasting performances are two crucial and intertwined aspects of supervised machine learning. This paper focuses on binary classification to introduce a class of loss f…
BIG-bench Machine LearningBinary ClassificationFairASR: Fair Audio Contrastive Learning for Automatic Speech Recognition
Large-scale ASR models have achieved remarkable gains in accuracy and robustness. However, fairness issues remain largely unaddressed despite their critical importance in real-world applications. In this work, we introdu…
Automatic Speech RecognitionContrastive LearningFairnessspeech-recognition+1Learning Rotation-Equivariant Features for Visual Correspondence
Extracting discriminative local features that are invariant to imaging variations is an integral part of establishing correspondences between images. In this work, we introduce a self-supervised learning framework to ext…
Camera Pose EstimationPose EstimationSelf-Supervised Learning