Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

1.3%2.7%4.0%5.4% · Jul 201919922001200920182026
48 results for unsupervised preprocessing

Unsupervised preprocessing can bias cross-validation estimates in regression models.

problem Bias in cross-validation estimates due to unsupervised preprocessing.
method Analysis of three preprocessing procedures: feature selection, grouping, and rescaling.
result Unsupervised preprocessing can introduce substantial bias into cross-validation estimates.

Unsupervised anomaly detection aids doctors in evaluating X-ray images of hands.

problem Lack of labeled medical data and ambiguous symptoms in X-ray images.
method Adopting state-of-the-art unsupervised learning methods for anomaly detection and preprocessing.
result Without preprocessing, unsupervised methods perform randomly on X-ray images of hands.

Tactile information is important for gripping, stable grasp, and in-hand manipulation, yet the complexity of tactile data prevents widespread use of such sensors. We make use of an unsupervised learning algorithm that transforms the complex tactile data into a compact, latent representation without the need to record g…

2016-06-23abs ↗pdf ↗

This study evaluates clustering algorithms on high-dimensional data.

problem Comparing clustering algorithms on high-dimensional datasets.
method Evaluation of K-means, DBSCAN, and Spectral Clustering using PCA, t-SNE, UMAP, and multiple metrics.
result UMAP preprocessing improves clustering quality across all algorithms, with Spectral Clustering excelling.

A multi-step framework tackles online unsupervised domain adaptation with novel mean-target subspace computation.

problem Online unsupervised domain adaptation with unlabelled target data arriving sequentially.
method Multi-step framework with a novel mean-target subspace computation and temporal coherency consideration.
result Improved performance over previous approaches on four datasets.

This study automates blood cell classification using computer vision.

problem Automated detection and classification of white blood cells.
method Color-based segmentation, morphological processing, feature extraction, PCA, Unsupervised and Supervised learning algorithms, Deep Convolutional Neural Networks.
result Identification of robust algorithms for automated blood cell classification.

DMGI embeds multiplex networks with node attributes without supervision.

problem Existing methods fail to handle node attributes and multiple relation types in multiplex networks.
method Inspired by DGI, DMGI maximizes mutual information between local and global graph representations, integrating node embeddings from multiple graphs.
result DMGI outperforms state-of-the-art methods on various downstream tasks.

TzK model learns tight conditional priors using side information.

problem Learning tight conditional priors using side information.
method TzK is a conditional probability flow-based model that exploits attributes to learn tight conditional priors around target observations. It trains via approximated ML and supports supervised, unsupervised, and semi-supervised learning.
result TzK produces efficient and stable approximations of arbitrary data distributions, comparable to state-of-the-art models.

A framework uses preprocessing to improve psychiatric questionnaire predictions while maintaining interpretability.

problem Weak predictive accuracy and limited interpretability of psychiatric questionnaires.
method Two-stage method: stable preprocessing followed by a linear mapping.
result REFINE outperforms other interpretable approaches in psychiatric and non-psychiatric prediction tasks.

Paper introduces probabilistic methods to approximate archetypal analysis, reducing complexity.

problem Inherent computational complexity of archetypal analysis limits its practical applicability.
method Two preprocessing techniques: dimensionality reduction and representation cardinality reduction, using probabilistic geometry.
result The method effectively reduces scaling and provides near-optimal solutions for prediction errors.

Enhances solar flare prediction with advanced preprocessing and contrastive learning.

problem Accurate prediction of solar flares to mitigate risks to astronauts and equipment.
method Advanced data preprocessing pipeline and contrastive learning with GRU regression model.
result Exceptional True Skill Statistic (TSS) scores, surpassing previous methods.

This paper analyzes dynamic ensemble selection and preprocessing for multi-class imbalanced datasets.

problem Class imbalance in multi-class datasets where majority classes have more instances.
method Examined dynamic selection techniques and data preprocessing methods for multi-class imbalanced problems.
result Dynamic ensemble improves AUC and G-mean compared to static ensemble.

Enhances diffusion models by preprocessing data to improve reconstruction quality.

problem Slow sampling and poor reconstruction quality in diffusion models, especially for small-scale networks.
method Applying Gaussianization preprocessing to the training data to make the target distribution more Gaussian-like.
result Improves generation quality, especially in the early stages of reconstruction with small networks.

This paper uses feature preprocessing and RRL to automate profitable financial trading.

problem Automating profitable financial trading strategies.
method Feature preprocessing (PCA, DWT) followed by Recurrent Reinforcement Learning (RRL).
result The proposed strategy is effective, robust, and mitigates RRL's drawbacks.

This study compares different data preprocessing methods for gait analysis.

problem Improving the generalizability of machine learning models in gait analysis.
method Compared various data preprocessing steps including filtering, time derivative, normalization, and scaling.
result Different preprocessing combinations affect gait classification performance.

Proposes a new feature preprocessing method using kernel density integral transformation.

problem Feature preprocessing for tabular data in machine learning and statistics.
method Kernel density integral transformation as a drop-in replacement or improved alternative to min-max scaling and quantile transformation.
result Frequently outperforms min-max scaling and quantile transformation with hyperparameter tuning.

This paper investigates the impact of unconventional preprocessors on deep convolutional neural networks for face identification.

problem The impact of unconventional preprocessors on deep convolutional neural networks for face identification.
method Varying the preprocessing module across different approaches while keeping other network architecture facets constant, using transfer learning from Inception-V3 network features.
result Improvement in discriminative capability of deep networks through preprocessing with HE, quantization, and other methods.

New method speeds up neural network training by preprocessing weight-data correlation.

problem Slow neural network training due to high time complexity.
method Stores weight-data correlation in a tree structure for quick detection of firing neurons.
result Achieves o(nmd)o(nmd) time per iteration with only O(nmd)O(nmd) preprocessing time.

RODMAN improves ML-based disk failure prediction accuracy in cloud environments.

problem Imperfect data quality in real-world cloud environments degrades ML-based disk failure prediction accuracy.
method RODMAN uses three data preprocessing techniques: failure-type filtering, spline-based data filling, and automated pre-failure backtracking.
result RODMAN significantly improves prediction accuracy compared to no preprocessing.

This paper highlights the overlooked role of preprocessing hyperparameters in machine learning model performance.

problem The neglect of preprocessing hyperparameters in machine learning model evaluation.
method Empirical review and illustration of different procedures for generating and evaluating prediction models.
result Users may fail to report or account for preprocessing hyperparameter optimization, leading to exaggerated performance claims.

New algorithm samples determinantal point processes with sublinear preprocessing time.

problem Sampling from determinantal point processes efficiently with small expected subset size.
method Proposes an algorithm with sublinear preprocessing and independent sampling cost.
result Achieves sublinear preprocessing time and independent sampling cost.

End-to-end solution for recognizing handwritten numerals, avoiding traditional preprocessing steps.

problem Handwritten numeral string recognition with traditional preprocessing steps.
method YoLo-based model for automatic detection and recognition, avoiding heuristic-based preprocessing and segmentation.
result Proposed method reduces complexity and is a feasible end-to-end solution for numeral string recognition.

CDL index improves clustering validation for non-convex data.

problem Selecting clustering algorithms and hyperparameters without labeled data.
method CDL uses compactness, centers, and covariances to compute a probabilistic description length bound.
result CDL outperforms conventional CVIs on synthetic and image benchmarks.

This study improves quantum classifiers by optimizing data preprocessing.

problem Quantum Machine Learning advantages are not yet clearly demonstrated.
method Used Linear Discriminant Analysis (LDA) for data preprocessing.
result Variational Quantum Algorithm (VQA) outperforms classical classifiers.

Commercial activity trackers are set to become an essential tool in health research, due to increasing availability in the general population. The corresponding vast amounts of mostly unlabeled data pose a challenge to statistical modeling approaches. To investigate the feasibility of deep learning approaches for unsup…

2018-02-28abs ↗pdf ↗

fastml guards against data leakage in automated machine learning.

problem Data leakage during preprocessing before resampling inflates apparent performance.
method fastml uses guarded resampling to re-estimate preprocessing inside each resample.
result Guarded resampling reduces apparent performance compared to global preprocessing.

A new method learns to segment and represent objects jointly without supervision.

problem Learning to segment and represent objects jointly without supervision.
method Iterative variational inference for disentangled object representations.
result System learns to inpaint occluded parts and extrapolates to unseen objects.

DDVFA learns and retrieves clusters without order dependence, outperforming other methods.

problem Order dependence in clustering methods.
method DDVFA combines distributed higher-order activation and match functions with dual vigilance parameters.
result DDVFA outperforms other clustering methods in online learning mode.

This paper compares preprocessing techniques for XGBoost models on various data sets.

problem Improving predictive performance of XGBoost models through optimal data preprocessing.
method Comparison of feature selection, categorical handling, and null imputation methods.
result XGBoost importance by gain is the most consistent and highest-performing method for feature selection.