Study improves RF sensor robustness for target recognition.
problem Variability in RF target responses makes them vulnerable to attacks.
method Evaluates techniques for building robust classification architectures.
result Improves accuracy in identifying true target characteristics.
Five simple soft sensor methodologies with two update conditions were compared on two experimentally-obtained datasets and one simulated dataset. The soft sensors investigated were moving window partial least squares regression (and a recursive variant), moving window random forest regression, the mean moving window of…
Deep learning uses WiFi CSI for reliable human presence detection.
problem Reliable human presence detection using ambient RF signals.
method Pre-processing of estimated CSI followed by deep learning.
result Near perfect presence detection during multiple extended periods.
Maximin UCB algorithm optimizes energy harvesting for sensor networks.
problem Optimizing energy harvesting for sensor nodes in varying environments.
method Modeling as Maximin Multi-Armed Bandits and proposing Maximin UCB algorithm.
result Maximin UCB algorithm achieves performance guarantees similar to UCB1.
Low-cost sensor fusion for organic substance classification.
problem Non-destructive classification and quality control of organic substances.
method Arduino Mega 2560 microcontroller with three sensors, supervised learning models, hyperparameter tuning, PCA/LDA, ensemble voting classifier.
result Test accuracies of 93-94% for identifying organic compounds.
Power spectral density (PSD) maps providing the distribution of RF power across space and frequency are constructed using power measurements collected by a network of low-cost sensors. By introducing linear compression and quantization to a small number of bits, sensor measurements can be communicated to the fusion cen…
Machine learning classifies Parkinson's Disease stages from walker sensors data.
problem Limited cost-effective methods for quantitatively assessing Parkinson's Disease stages.
method Machine learning applied to walker-mounted sensors data, feature selection methods compared.
result Feature selection method using ANOVA provides similar accuracy to full feature set and is clinically interpretable.
Novel spatio-temporal LSTM model forecasts oceanic variables across sensors and scales.
problem Data sparsity and lack of connected spatial and temporal information in environmental datasets.
method SPATIAL LSTM architecture that learns across spatial and temporal scales.
result Framework accurately forecasts oceanic variables with comparable performance to state-of-the-art models.
Random Forest kernels improve performance in various regression and survival tasks.
problem Improving performance of Random Forest in high-dimensional data with noisy features.
method Developed and evaluated data-driven RF kernels for regression, classification, and survival tasks.
result RF kernels are competitive or superior to RF in most scenarios, especially for survival tasks.
This study improves UAV identification using RF signals with one-shot generative methods.
problem Limited RF environments and signal variability make traditional RF identification ineffective.
method Introduces one-shot generative methods to augment RF signals for UAV identification.
result One-shot generative methods outperform traditional methods in low-data regimes.
DeepRF_SLR uses deep reinforcement learning to design shorter RF pulses.
problem Designing efficient RF pulses for MRI sequences.
method Optimizing the root pattern of SLR polynomial using deep reinforcement learning and greedy tree search.
result DeepRF_SLR generates shorter duration RF pulses in less time compared to conventional methods.
Random Forests adapted for dependent data using GLS.
problem Random Forests' local nature fails for dependent data.
method RF-GLS: GLS loss for correlated data.
result Consistency of RF-GLS under beta-mixing processes.
RF models implicitly regularize kernel methods as feature count increases.
problem Understanding implicit regularization in RF models.
method Random matrix theory applied to Gaussian RF models and KRR.
result The average RF predictor is close to a KRR predictor with an effective ridge.
Extends RF proximities to all supervised distance-based machine learning contexts.
problem Limited utility of RF proximities in various machine learning tasks.
method Introduces generalized Proximity Forest (PF) model and variant for regression.
result Demonstrates unique advantages over RF and k-nearest neighbors models.
New research tackles RF deep learning adversarial examples and their physical robustness.
problem Detect and mitigate adversarial examples in RF deep learning.
method Statistical tests on PAPR and softmax outputs.
result Viable mitigation methods for RF adversarial attacks.
Proposes MRF for consistency and privacy in RF.
problem Insufficient theoretical understanding of RF's consistency and privacy.
method Introduces MRF with multinomial distributions for feature and value selection.
result Proves MRF's consistency and analyzes its privacy within differential privacy.
This paper improves kernel quantile regression with random features for handling heavy-tailed noises.
problem Handling heavy-tailed noises in kernel quantile regression.
method Introduces a refined error decomposition and establishes a novel connection between KQR-RF and KRR-RF.
result Establishes capacity-dependent learning rates for KQR-RF under mild conditions on the number of random features, which are minimax optimal up to some logarithmic factors.
Simplifies RF predictions by focusing on a subset of nearest neighbors.
problem Improving interpretability and performance of RF-based forecast distributions.
method Sparsifying RF-based forecast distributions by focusing on a small subset of nearest neighbors.
result Simplified RF predictions can be similar to or exceed original ones in forecasting performance.
DiFF-RF detects point-wise and collective anomalies using random partitioning trees.
problem Detecting anomalies in data, especially collective anomalies.
method Random partitioning binary trees with distance-based leaves and semi-supervised learning.
result DiFF-RF significantly outperforms isolation forest and one-class SVM.
A new method uses RF's out-of-bag errors for multiple imputation.
problem Missing data in biomedical studies and lack of prediction uncertainty.
method Constructs conditional distributions from the empirical distribution of out-of-bag prediction errors.
result Valid multiple imputation results achieved without parametric assumptions.
CNN improves frame selection for ultrasound elastography.
problem Choosing suitable frames for accurate strain estimation in ultrasound elastography.
method Convolutional Neural Network (CNN) for frame selection.
result CNN selects frames in 5.4 ms for high-quality strain images.
Paper develops real-time through-wall human pose imaging using RF signals.
problem Developing real-time vision through opaque objects.
method Many-to-Many Encoder/Decoder Paradigm, student/teacher learning, Residual CNN, RPN, LSTM.
result Accurately predicts human pose through visual occlusion using RF signals.
The paper optimizes RF training by improving tree building algorithms and CPU optimizations.
problem Improving the training performance of Random Forest models on CPU architectures.
method Investigated and improved tree building algorithms (BFS, DFS, hybrid BFS-DFS) and proposed optimizations.
result The hybrid BFS-DFS algorithm outperforms both BFS and DFS, and is more robust.
Optimal weighted random forests improve prediction accuracy.
problem Unequal prediction performance among random forest trees.
method Proposes 1-step and 2-step optimal weighting algorithms.
result Asymptotically optimal in terms of squared loss and risk.
In portable, three dimensional, and ultra-fast ultrasound imaging systems, there is an increasing demand for the reconstruction of high quality images from a limited number of radio-frequency (RF) measurements due to receiver (Rx) or transmit (Xmit) event sub-sampling. However, due to the presence of side lobe artifact…
Random Forests don't overfit, challenging the double-descent theory.
problem The overfitting behavior of Random Forests.
method Challenged the double-descent curve theory by analyzing the performance of Random Forests and proposing a new approach to diversity in ensembles.
result Random Forests do not exhibit a double-descent curve but rather a single descent, indicating they do not overfit in the classic sense.
TinyML models detect RF and cyber threats in spacecraft with low latency.
problem Detecting cyber-RF threats in autonomous spacecraft with low latency.
method Analysis of classical models (RF, LR, SVM, MLP) for latency-accuracy trade-offs.
result Logistic Regression achieves microsecond-level inference with minimal accuracy loss.
A new ML framework for RF fingerprinting across various applications.
problem Extracting unique RF fingerprints for specific emitter identification.
method Generic machine learning framework for automatic RF fingerprinting.
result Framework achieves superior performance compared to traditional methods.
We propose to prune a random forest (RF) for resource-constrained prediction. We first construct a RF and then prune it to optimize expected feature cost & accuracy. We pose pruning RFs as a novel 0-1 integer program with linear constraints that encourages feature re-use. We establish total unimodularity of the constra…
Enhances local explainability and trust scores using RF proximities.
problem Improving local explainability and trust in random forest models.
method Rewriting RF predictions as weighted sums of training targets using proximities.
result Proximities provide a novel method to assess model predictions' correctness.
Study improves CNNs for audio scene classification by restricting receptive fields and adding frequency awareness.
problem Improving CNNs for robust acoustic scene classification.
method Investigated different receptive field configurations for various CNN architectures and introduced Frequency Aware CNNs.
result Several well-performing submissions to DCASE 2019 Challenge were achieved.
Pre-training deep RF classifiers with autoencoders mitigates adversarial attacks.
problem Adversarial examples in RF deep learning cause targeted misclassifications.
method Pre-training the classifier using an autoencoder.
result Pre-training method validates as a viable mitigation against adversarial attacks.
Combines RFs and GLMs for better accuracy and interpretable feature importance.
problem Inability to interpret random forests (RFs) due to black box nature and unstable feature importance methods.
method Reinterprets decision trees and MDI as linear regression and R² values, combining RFs and GLMs in RF+.
result MDI+ outperforms existing feature importance measures in identifying signal features and stability.
AF improves classification models by adaptively weighting trees.
problem Improving classification model performance.
method AF combines OP2T for input-dependent weights and MIO for dynamic refinement.
result AF consistently outperforms RF, XGBoost, and other weighted RF.
Paper analyzes error bounds for learning with vector-valued RF, improving existing analyses.
problem Learning with vector-valued random features in infinite-dimensional settings.
method Direct analysis of risk functional, avoiding random matrix theory.
result Strong consistency and minimax optimal convergence rates established.
A new term weighting scheme TF-IDFC-RF outperforms others in sentiment analysis.
problem Improving text classification in sentiment analysis.
method Proposes a novel supervised term weighting scheme TF-IDFC-RF and compares it with other schemes.
result TF-IDFC-RF outperforms all other schemes on two sentiment analysis datasets.
This paper is devoted to obtain the one-dimensional group invariant solutions of the two-dimensional Ricci flow ((2D) Rf) equation. By classifying the orbits of the adjoint representation of the symmetry group on its Lie algebra, the optimal system of one-dimensional subalgebras of the ((2D) Rf) equation is obtained. F…
Random Forests (RFs) are strong machine learning tools for classification and regression. However, they remain supervised algorithms, and no extension of RFs to the one-class setting has been proposed, except for techniques based on second-class sampling. This work fills this gap by proposing a natural methodology to e…
S-SIRUS explains RF for spatial data, improving accuracy and interpretability.
problem Non-interpretable nature of Random Forest in spatially dependent data.
method Proposes S-SIRUS, a spatial extension of SIRUS for extracting interpretable rules.
result S-SIRUS outperforms SIRUS in spatially dependent data, offering higher predictive accuracy and shorter rule lists.
Tree ensembles like RF and GBT can be seen as kernels, improving regression and classification performance.
problem Improving kernel methods for tree ensemble based models.
method Investigation of RF and GBT kernels in simulation and real data.
result RF and GBT kernels are competitive to their respective ensembles in higher dimensions, particularly with noisy features.
FedForest adapts RF for federated learning, improving performance and efficiency.
problem Adapting RF for federated learning with heterogeneous data.
method FedForest uses a novel splitting procedure to aggregate client statistics, allowing non-parametric personalization.
result FedForest's federated RF achieves performance close to centralized models while being communication-efficient.
Cryptotree enables accurate predictions on encrypted data using Random Forests.
problem Applying machine learning to private data while preserving confidentiality.
method Adapting Neural RF to CKKS scheme for HE operations on encrypted data.
result Cryptotree achieves better prediction results on encrypted data than regular RF.
The random forest algorithm (RF) has several hyperparameters that have to be set by the user, e.g., the number of observations drawn randomly for each tree and whether they are drawn with or without replacement, the number of variables drawn randomly for each split, the splitting rule, the minimum number of samples tha…
Point patterns are sets or multi-sets of unordered elements that can be found in numerous data sources. However, in data analysis tasks such as classification and novelty detection, appropriate statistical models for point pattern data have not received much attention. This paper proposes the modelling of point pattern…
Improved deep CNNs for ASC by optimizing receptive field size.
problem Deep CNNs perform poorly in ASC compared to simpler models.
method Analyzed and adapted the receptive field of ResNet and DenseNet.
result State-of-the-art performance achieved with optimized receptive field.
Enhanced anomaly detection using PRC-RF with autoencoders.
problem Extreme class imbalance and curse of dimensionality in anomaly detection.
method Hybrid framework combining PRC-RF and autoencoders.
result Autoencoder-PRC-RF model outperforms previous methods in accuracy, scalability, and interpretability.
In portable, 3-D, or ultra-fast ultrasound (US) imaging systems, there is an increasing demand to reconstruct high quality images from limited number of data. However, the existing solutions require either hardware changes or computationally expansive algorithms. To overcome these limitations, here we propose a novel d…
Develops RF-GLS for binary geospatial data.
problem Challenges in extending RF to binary geospatial data.
method Proposes RF-GLS for binary data, embedding it in generalized mixed effects models.
result Establishes consistency of RF-GP for mean function and covariate effect estimation.