Deep learning models struggle with irrelevant features in survival analysis.
problem Deep learning models suffer from performance deficits when dealing with many irrelevant features in survival analysis.
method Developed novel feature selection methods for deep learning models in survival analysis.
result Substantial performance improvements are achievable with feature selection methods.
This paper reviews methods for feature selection and extraction in pattern analysis.
problem Complex raw data require feature selection or extraction for better discrimination or representation.
method Reviews different methods of feature selection and extraction.
result Compares various methods of feature selection and extraction.
Improves transparency of deep neural networks through feature and consistency analysis.
problem Black-box nature of deep learning inference limits transparency for safety-critical systems.
method Structural and linguistic feature analysis, consistency analysis.
result 75% of human workers found input data and results consistent, 70% found inference and results consistent.
Proposes a flexible feature allocation model for sparse factor analysis.
problem Sparse data and rigid assumptions in traditional exploratory tools.
method Adaptive latent feature sharing with control over feature sparsity.
result Derives a novel adaptive Factor analysis (aFA) and aPPCA for flexible dimensionality reduction.
This paper shows feature importance remains valid even in low-performing models.
problem Feature importance validity in low-performing machine learning models for biomedical data.
method Experiments with synthetic and real biomedical datasets to compare feature rank stability under different data reductions.
result Feature importance can be maintained even at low performance levels if data size is adequate.
Gradient-based method extracts slow features from high-dimensional data.
problem Extracting meaningful low-dimensional features from high-dimensional, temporally varying data.
method Power Slow Feature Analysis (PowerSFA) using gradient-based training of differentiable architectures.
result PowerSFA effectively extracts meaningful low-dimensional features in various data types.
Enhanced geographical features improve predictive models for colorectal cancer survival curves.
problem Predicting colorectal cancer survival curves in Iowa.
method Used neural networks to explore feature representations, comparing ABC performance.
result Spectral analysis-based representations improve predictive performance by approximately 40%.
This paper uses PCA and FA for feature selection in credit rating.
problem Selecting important features for credit rating prediction.
method Principal Component Analysis and Factor Analysis.
result Factor Analysis reduces feature set significantly without losing much accuracy.
New algorithm selects features using Catastrophe model for better regression analysis.
problem Improving feature selection in regression analysis to enhance model performance.
method The algorithm ranks features based on their fit to the Catastrophe model and uses Akaike information criterion for ranking.
result The proposed algorithm outperforms RELIEF in various datasets.
Biarchetype analysis identifies extreme instances of observations and features.
problem Representing complex data structures in a more interpretable form.
method Solves biarchetype analysis through an algorithm that identifies biarchetypes as mixtures of observations and features.
result Biarchetypes enhance interpretability of data structures compared to traditional methods.
Gradient descent learns useful features even in the NTK regime.
problem The ability of neural networks to learn useful features.
method Local convergence analysis of gradient descent with regularization.
result Gradient descent can capture ground-truth directions for feature learning even after the loss threshold is reached.
DyS model improves survival analysis accuracy and interpretability.
problem Accurate and interpretable survival analysis models for healthcare.
method Feature-sparse Generalized Additive Model combining feature selection and interpretable prediction.
result DyS model outperforms other survival analysis models in interpretability and accuracy.
RTFN extracts robust temporal features for time series analysis.
problem Challenges in extracting sufficient shapelets from time series data.
method Combines temporal feature networks and attentional LSTM networks.
result RTFN outperforms in supervised and unsupervised time series analysis.
Unified analysis improves random Fourier features for kernel methods.
problem Pessimistic theoretical bounds on random Fourier features.
method Unified risk analysis for squared error and Lipschitz loss.
result Improved bounds on number of features for convergence.
New method selects features using neural network and sensitivity analysis.
problem Feature selection for high-dimensional datasets.
method Extended Fourier amplitude sensitivity test (SA) and Feedforward Neural Network (FNN).
result Optimal feature subset selected for classification problems.
A new method for high-dimensional data classification with improved feature selection.
problem High-dimensional data classification with limited interpretability and prediction accuracy.
method Integrates multiclass diagonal discriminant analysis with feature selection.
result Significantly improved prediction accuracy and feature interpretability.
Derives a biologically plausible neural network for Slow Feature Analysis.
problem Learning latent features from time series data.
method Starting from an SFA objective, derives Bio-SFA with a biologically plausible neural network implementation.
result Validates Bio-SFA on naturalistic stimuli, reproducing interesting properties of brain cells.
CRDA improves gene selection in microarray studies by reducing feature space.
problem Gene selection in high-dimensional microarray datasets.
method CRDA combines ℓq,1 norm minimization and hard thresholding for feature elimination. result CRDA outperforms competitors in misclassification and feature selection accuracy.
Sparse coding is a common approach to learning local features for object recognition. Recently, there has been an increasing interest in learning features from spatio-temporal, binocular, or other multi-observation data, where the goal is to encode the relationship between images rather than the content of a single ima…
Two approaches use TDA and graph theory for tennis match prediction.
problem Predicting tennis match outcomes using network features.
method Lower-star filtration on player competitive networks, Random Forest model, modified Katz similarity index.
result TDA features alone can achieve above-chance prediction in tennis match outcomes.
Due to advances in sensors, growing large and complex medical image data have the ability to visualize the pathological change in the cellular or even the molecular level or anatomical changes in tissues and organs. As a consequence, the medical images have the potential to enhance diagnosis of disease, prediction of c…
Paper proposes a statistical test for feature selection pipelines using selective inference.
problem Assessing the significance of feature selection pipelines in data analysis.
method Selective inference technique applied to feature selection pipelines composed of various algorithms.
result The proposed statistical test controls false positive feature selection probabilities.
Paper introduces new evaluation criteria for feature-based model explanations.
problem Establishing reliable feature importance explanations for models.
method Robustness analysis using smaller adversarial perturbations.
result New explanations that are necessary and sufficient for predictions.
Spectral simplicial theory improves feature selection for complex data.
problem Complex data sets and high-dimensional feature spaces require efficient feature selection methods.
method Extends spectral techniques to abstract simplicial complexes, incorporating topological data analysis.
result Spectral simplicial methods provide a unified approach for feature selection in multi-modal genomic data.
dnamite simplifies NAMs for feature selection and survival analysis.
problem Handling complex machine learning tasks on large-scale data.
method Python package implementing Neural Additive Models (NAMs) for feature selection and survival analysis.
result dnamite provides a scikit-learn style interface for training NAMs.
Proposes a method to optimize class mean preservation in kernel-based feature spaces.
problem Optimizing the selection of kernel subspace for better performance.
method Component analysis method for kernel-based dimensionality reduction that optimally preserves class mean distances.
result Discriminant analysis version of the proposed method provides insights into feature space properties.
A novel method extracts topological features from word embeddings for text classification.
problem High dimensional and noisy text representations in natural language processing.
method Persistent homology for topological data analysis on word embeddings.
result Topological features outperform conventional text mining features on long textual documents.
Paper proposes ICCN to learn correlations between text, audio, and video for multimodal sentiment analysis.
problem Improving multimodal sentiment analysis by learning hidden correlations between text and audio/video features.
method Interaction Canonical Correlation Network (ICCN) using deep canonical correlation analysis (DCCA).
result Empirical results confirm the effectiveness of ICCN in capturing useful information from all three views.
New feature map for topological data analysis improves classification performance.
problem Lack of effective feature maps for topological data analysis.
method Realize barcodes as paths in a vector space, compute path signature, resulting in a feature map.
result Achieves state-of-the-art results on classification benchmarks.
Feature networks link ML features via graph structure for enhanced learning.
problem Enhancing feature expressiveness and learning efficiency in machine learning.
method Graph representation of feature vectors, leveraging Fourier and functional analysis.
result Feature networks enable novel, complex feature dependencies.
Enhanced PCA method highlights essential features of clusters in high-dimensional data.
problem Interpreting clusters in dimensionality reduction results is challenging.
method Contrastive Principal Component Analysis (cPCA) for identifying essential features.
result ccPCA method effectively highlights essential features of clusters in high-dimensional data.
Improved survival analysis using square root Cox's models and neural networks.
problem Feature selection in survival analysis.
method Square root Cox's survival analysis by the fittest linear and neural networks model, directly tuning penalty parameter λ.
result Substantially improved over traditional methods, achieving phase transition in feature selection.
Proposes a novel MTL approach based on bias-variance analysis.
problem Improving multi-task learning performance through shared knowledge.
method Two-phase iterative aggregation of targets and features using bias-variance analysis.
result Validation on synthetic and real-world datasets demonstrates the effectiveness of the proposed method.
Model detects exercise fatigue with high accuracy.
problem Detecting exercise fatigue in real-time.
method Feature extraction using AHP, machine learning.
result 98.65% accuracy in detecting exercise fatigue.
The paper explores feature selection for improving classification accuracy in event logs.
problem Improving machine learning-based interactive root cause analysis for business process instances.
method Developed structural features from event logs and compared six feature selection algorithms.
result Feature selection can improve classification accuracy without significantly increasing run-time.
Online selection of dynamic features has attracted intensive interest in recent years. However, existing online feature selection methods evaluate features individually and ignore the underlying structure of feature stream. For instance, in image analysis, features are generated in groups which represent color, texture…
We introduce a method called multi-scale local shape analysis, or MLSA, for extracting features that describe the local structure of points within a dataset. The method uses both geometric and topological features at multiple levels of granularity to capture diverse types of local information for subsequent machine lea…
Optimal feature transfer identified through bias-variance analysis.
problem Optimizing feature transfer in transfer learning.
method Simple linear model with fine-grained bias-variance decomposition.
result Optimal pretrained feature transform is naturally sparse.
ORCCA improves CCA performance with randomized features.
problem Improving CCA performance with randomized features.
method Proposes a task-specific scoring rule for selecting random features in CCA.
result ORCCA outperforms Kernel CCA in expectation.
Random forest identifies key features for diagnosing machine faults.
problem Identifying specific factors causing machine faults.
method Gaussian mixture model clustering, spectrum analysis, random forest classification.
result Identified significant features for different machine states.
Study shows topological features improve time series classification.
problem Classifying stochastic processes with varying noise and sampling.
method Topological data analysis features compared to statistical and raw features.
result Topological features lead to better classification performance.
This paper introduces Topological Data Analysis for data scientists.
problem Complex data features are hard to infer.
method Topological and geometric tools to infer features.
result Provides a brief introduction to TDA for non-experts.
Paper proposes a novel unsupervised feature selection method using K-means and ADMM.
problem Finding a subset of features for high-dimensional unsupervised learning problems.
method Developed K-means Derived Unsupervised Feature Selection (K-means UFS) using ADMM to solve NP-hard optimization.
result K-means UFS outperforms baselines in feature selection for clustering.
The paper presents a method for analyzing shape graphs using specific features.
problem Analyzing geometric and topological variations in shape graphs.
method Curated set of topological, geometric, and directional features for shape graph analysis.
result The feature representation is effective for tasks like group comparison and classification.
Classifies Bitcoin addresses based on their balance functions.
problem Understanding and identifying Bitcoin addresses used for illicit activities.
method Functional data analysis to extract features from balance functions.
result Functional principal components improve prediction accuracy.
Nature-inspired algorithms improve data analytics efficiency.
problem Efficient data analytics with reduced dimensionality.
method Nature-inspired algorithms for feature selection optimization.
result Nature-inspired algorithms enhance data analytics efficiency.
CCA features from medical codes predict future surgeries.
problem Predicting future surgeries based on medical codes.
method Canonical correlation analysis applied to sequences of medical codes.
result CCA embeddings capture meaningful relationships among medical codes.
SRMD uses random features for efficient time-frequency analysis.
problem Efficiently analyzing time-series data with low computational cost.
method Sparse Random Mode Decomposition (SRMD) constructs a sparse approximation to the spectrogram.
result SRMD outperforms other methods in signal representation, outlier removal, and mode decomposition.