Proposes finding missing features in Lasso solutions.
problem Lasso overlooks features not selected in its optimal solution.
method Computes alternate features efficiently without redundant computations.
result Reasonable alternate features found in 20 newsgroup data.
The paper defines and analyzes feature complexity in DNNs, proposing metrics for feature disentanglement and evaluation.
problem Understanding and quantifying the complexity of features learned by deep neural networks.
method Proposes a definition and disentanglement of feature complexity orders, introduces metrics for reliability and over-fitting evaluation.
result Establishes a relationship between feature complexity and DNN performance, and proposes a generic mathematical tool for network compression and knowledge distillation.
Paper proposes a new method to learn features from error representations.
problem Learning from error representations in machine learning.
method Inverse feature learning (IFL) based on deep clustering.
result IFL leads to improved performance in classification and clustering.
New method selects features using graph-based interactions and elastic net.
problem Loss of feature relationships in vector-based feature selection.
method Graph-based structurally interacting elastic net method.
result Preserves feature relationships and selects informative features.
New feature selection method for multi-labeled data.
problem Feature redundancy in multi-labeled data.
method Conditional information measure based on dependency maximization.
result Efficient and fast non-parametric feature selection.
Fast feature selection for SHM using canonical correlation.
problem Feature selection for structural health monitoring.
method Greedy search of sum of squared canonical correlation coefficients.
result Extremely fast feature selection with good performance.
A new method selects features for better model performance.
problem Improving model performance by selecting effective features.
method Supervised orthogonal least square regression with feature weighting.
result The method reduces feature dimensionality and improves classification results.
RoSHAP stabilizes feature attribution in machine learning models.
problem Stochastic variation in feature attribution measures.
method Modeling feature attribution score distribution and estimating it through bootstrap resampling and kernel density estimation.
result RoSHAP provides stable feature rankings and improves model performance.
Approach for selecting features by discarding nuisance and correlated ones.
problem Large datasets with correlated and nuisance features.
method Laplacian score criterion, autoencoder architecture, concrete layer.
result Outperforms similar approaches in clustering performance.
Unified framework selects relevant features for predictive modeling.
problem Feature selection in supervised learning problems.
method Graphical models and information theoretic tools for structure learning.
result Optimal subset of features selected using a likelihood-based criterion.
Proposes on-the-fly joint feature selection and classification for time-sensitive decisions.
problem Online feature selection and classification for time-sensitive decision making.
method Proposes a framework for joint feature selection and classification on-the-fly, optimizing feature usage and classification accuracy.
result Demonstrates superior performance over state-of-the-art methods on various datasets.
Improved stock prediction using news features and RNN.
problem Predicting stock prices with high accuracy.
method Extracted news features, optimized seed words, calculated positive polar, constructed news features, proposed RNN model.
result Our method improves stock prediction accuracy by over 5%.
Compact bilinear pooling approximates covariance features for faster training.
problem Efficiently approximating covariance features for faster training.
method Compact bilinear pooling extended to polynomial approximations of covariance features.
result The proposed method achieves comparable accuracy with fewer dimensions.
Graph cross network improves graph classification accuracy.
problem Improving graph classification accuracy.
method Graph cross network (GXN) with vertex infomax pooling (VIPool) and feature-crossing layer.
result Improves graph classification accuracy by 2.12% and 1.15%.
Proposes a few-shot learning method for feature selection without labeled data.
problem Feature selection in unlabeled data with limited instances.
method Uses Concrete random variables and permutation-invariant neural networks to select features from multiple source tasks.
result Outperforms existing methods in feature selection performance.
New regularization scheme for FMs improves feature interaction selection.
problem Feature selection in FMs leads to loss of feature interactions.
method Proposes a new regularization scheme for FMs with upper bound of ℓ1 regularizer. result Improves feature interaction selection without restricting sparsity patterns.
Proposes interpretable set functions for sparse categorical features.
problem Automating the creation of interpretable features from sparse categorical data.
method Deep lattice network model with monotonicity constraints for permutation-invariant feature vectors.
result Achieved similar accuracy to deep sets or neural networks, but with enhanced interpretability.
Study proposes Local Linear Encoding for better feature discretization.
problem Improving feature discretization for numeric data.
method Theoretical analysis and Local Linear Encoding (LLE) method.
result LLE outperforms conventional methods with fewer parameters.
Proposes a new method for feature selection using Bayesian ID with intervention.
problem Feature selection in data with varying importance.
method Probabilistic model for interpolative decomposition with Bayesian inference and Gibbs sampling.
result The proposed Bayesian ID algorithm with intervention selects features with higher priority and comparable reconstructive errors.
Proposes a novel feature selection method for hypergraphs.
problem The 'curse of dimensionality' problem in feature selection.
method Unsupervised hypergraph feature selection via point-weighting and low-rank representation.
result Significant improvement over state-of-the-art feature selection methods.
Proposes using Banzhaf power indices for feature importance and pruning in machine learning.
problem Understanding and selecting important features in machine learning models.
method Uses principles from coalitional game theory, specifically Banzhaf power index, to measure feature importance and prune features without loss of accuracy.
result Features with zero Banzhaf power index can be losslessly pruned without affecting classifier accuracy.
In this paper, a novel learning paradigm is presented to automatically identify groups of informative and correlated features from very high dimensions. Specifically, we explicitly incorporate correlation measures as constraints and then propose an efficient embedded feature selection method using recently developed cu…
Two new methods assess feature importance for fairness in machine learning models.
problem Understanding how features influence fairness in machine learning models.
method Two model-agnostic approaches: permutation and occlusion.
result Simple, scalable, and interpretable methods to quantify feature importance for fairness.
A genetic algorithm-based method extracts features for epilepsy EEG classification.
problem Classifying epileptic EEG signals for accurate diagnosis.
method GAFDS method using genetic algorithm for frequency-domain feature search and optimization.
result GAFDS features improve classification accuracy compared to nonlinear features.
New method speeds up Bayesian non-parametric model inference.
problem Difficult inference in high-dimensional Bayesian non-parametric models.
method Accelerated feature proposal mechanism and parallel approximate inference.
result Can quickly reach local convergence to posterior distribution.
A new feature selection method using random forest and Kolmogorov filter.
problem Ultra-high dimensional data feature selection.
method Fused Kolmogorov filter with random forest based recursive feature elimination.
result Selection and L2 consistency under weak conditions. A new feature screening method using projection correlation and knockoffs controls FDR in high-dimensional data.
problem Feature selection in ultra-high dimensional datasets with heavy-tailed errors and multivariate responses.
method Projection correlation for dependence measurement, knockoffs for FDR control, two-step approach.
result The method controls FDR and ensures sure screening under weak assumptions.
Proposes new feature transformation methods for brain interface models.
problem Sub-optimality of feature ranking and selection in brain interface models.
method Introduces maximum mutual information linear and nonlinear transformations.
result Significantly better performance in binary and multi-class decoding analyses.
Proposes LM3FE for multi-modal feature extraction in image classification.
problem High-dimensional features and multi-modal data challenges.
method Large margin multi-modal multi-task feature extraction (LM3FE) framework.
result LM3FE outperforms single-task feature extraction and multi-modal feature extraction.
Paper proposes BTuD for unsupervised feature selection.
problem Feature selection in unsupervised learning.
method Bayesian Tucker decomposition (BTuD) with Gaussian residual.
result Successfully applied to various datasets.
New framework exploits edge features in graph neural networks for improved performance.
problem Insufficient utilization of edge features in current graph neural networks.
method Proposes a new framework with doubly stochastic normalization and multi-dimensional edge feature handling.
result Improves performance on graph node classification and regression tasks.
Paper proposes CNN with SIFT for rotation invariant feature extraction.
problem Max-pooling layer discards rotational information, leading to rotation invariance issues.
method Uses SIFT descriptor to capture orientation and spatial relationships.
result Improves feature extraction on MNIST and fashionMNIST datasets.
This paper proposes a cost-sensitive feature acquisition method.
problem Choosing features for prediction with low cost and high accuracy.
method Adaptive feature selection using feature relevance and costs.
result Our approach achieves high accuracy with lower cost than state-of-the-art.
Paper proposes a new method for feature importance in model selection.
problem Feature importance in model selection.
method New tree-model explanation approach using Coefficient of Variation of feature weight.
result Novel feature explanation performs better than cross-validation in model selection.
Proposes an ensemble framework for outlier detection with embedded feature selection.
problem Improving performance of outlier detection in noisy data.
method Unified feature selection and outlier detection, thresholded self-paced learning, alternate algorithm.
result The proposed framework ODEFS outperforms existing methods on real-world datasets.
A novel weighted feature selection method using fuzzy sets improves classification accuracy and stability.
problem Improving feature selection accuracy and stability in machine learning models.
method Combination of four feature selection methods using fuzzy sets and bootstrap.
result Our method achieved significantly higher stability than individual methods.
Feature selection has attracted significant attention in data mining and machine learning in the past decades. Many existing feature selection methods eliminate redundancy by measuring pairwise inter-correlation of features, whereas the complementariness of features and higher inter-correlation among more than two feat…
Proposes a new method to approximate kernel functions for large datasets.
problem Limited applicability of kernel methods for large scale datasets.
method Pseudo Random Fourier Features (PRFF) for reducing feature dimensions and improving performance.
result Improves prediction performance and reduces feature dimensions compared to RFF.
Paper proposes an unsupervised feature selection algorithm with stability guarantees.
problem Feature selection for dimension reduction and interpretability.
method Proposes a novel unsupervised feature selection algorithm with stability guarantees.
result The algorithm has superior generalization performance and stable selected features.
Proposes a framework to assess feature importance without algorithm constraints.
problem Lack of a general framework for assessing feature importance across different algorithms.
method Develops a nonparametric framework for algorithm-agnostic variable importance assessment.
result Valid confidence intervals and testing strategies for variable importance.
New method classifies patients with kidney transplant based on many features.
problem Classifying patients with many features (ultrahigh-dimensional data).
method Multivariate screening and classification method leveraging feature correlations.
result Achieves optimal misclassification rates and more powerful discovery.
Proposes PFCVMLP for feature selection and classification.
problem Performance degradation and low efficiency of traditional sparse Bayesian classifiers in high-dimensional data.
method Sparse Bayesian embedded feature selection method using truncated Gaussian distributions.
result PFCVMLP improves classification performance and feature selection effectiveness.
Paper proposes FKR-F2E to make kernel regression fair.
problem Mitigating demographic biases in kernel methods.
method Fair feature embedding in kernel space.
result FKR-F2E achieves lower prediction disparity. The paper proposes a method to test features selected by SeqFS-DA with controlled FPR.
problem Ensuring reliability of feature selection after domain adaptation in high-dimensional regression.
method Proposes a novel method to test features selected by SeqFS-DA with controlled FPR.
result The proposed method controls FPR below a significance level α (e.g., 0.05) and enhances statistical power. A new method selects features for clustering without labels.
problem Identifying meaningful features in large datasets.
method Differentiable unsupervised feature selection using a gated Laplacian.
result The method improves clustering performance in noisy data.
Two methods improve electricity price forecasting in Europe.
problem Improving accuracy in day-ahead electricity price forecasting.
method Deep neural network and feature selection algorithm considering market integration.
result Predictive accuracy improved from 15.7% to 12.5% sMAPE.
AdaEnsemble learns adaptive feature interactions for CTR prediction.
problem Learning feature interactions for CTR prediction in recommender systems and Ads ranking.
method AdaEnsemble is a Sparsely-Gated Mixture-of-Experts (SparseMoE) architecture that dynamically selects feature interaction depth.
result AdaEnsemble achieves better prediction accuracy and inference efficiency compared to state-of-the-art models.
A conjecturing machine uncovers feature relationships in data.
problem Discovering nonlinear and boolean relationships among features.
method Proposes a conjecturing machine that suggests feature relationships using bounds and expressions.
result Reveals true underlying relationships in datasets.