This paper provides new insight into maximizing F1 scores in the context of binary classification and also in the context of multilabel classification. The harmonic mean of precision and recall, F1 score is widely used to measure the success of a binary classifier when one class is rare. Micro average, macro average, a…
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.
168,742 papers · 148 categories
Trend · papers per month
48 results for “F1 scores”
Superior Scoring Rules for Probabilistic Evaluation of Single-Label Multi-Class Classification Taskscs.LG
New scoring rules improve probabilistic classification model evaluation.
problem Traditional scoring rules misalign with the preference for correct classifications.
method Introduces Penalized Brier Score (PBS) and Penalized Logarithmic Loss (PLL) to modify proper scoring rules.
result PBS and PLL better identify optimal checkpoints and early stopping points, leading to superior F1 scores.
Enhances multi-tag classification using low-dimensional vector representations and virtual data.
problem Improving the performance of multi-tag classifiers.
method Embedding raw data into a low-dimensional feature space, then generating virtual data from linear operations on these vectors, to train multi-tag classifiers.
result Significant improvement in F1 scores (up to 224%) compared to training directly with raw data.
Communities in social networks or graphs are sets of well-connected, overlapping vertices. The effectiveness of a community detection algorithm is determined by accuracy in finding the ground-truth communities and ability to scale with the size of the data. In this work, we provide three contributions. First, we show t…
Proposes MCC-F1 curve for better binary classification evaluation.
problem Misleading performance evaluations with ROC and PR curves for imbalanced data.
method Introduces MCC-F1 curve combining MCC and F1 score.
result MCC-F1 curve provides clearer classifier differentiation.
Proposes BA method for unbiased time series anomaly detection evaluation.
problem Anomalies in time series data are rare, making F1-score unreliable.
method Introduces Balanced Point Adjustment (BA) to address F1-score bias.
result BA provides fairer evaluation of time series anomaly detectors.
OT domain adaptation improves aphasia detection across languages.
problem Detecting aphasia in low-resource languages with limited data.
method Utilized OT domain adaptation to map linguistic features across multiple languages.
result OT domain adaptation significantly improved F1 scores for French and Mandarin aphasia detection.
In predictive maintenance, model performance is usually assessed by means of precision, recall, and F1-score. However, employing the model with best performance, e.g. highest F1-score, does not necessarily result in minimum maintenance cost, but can instead lead to additional expenses. Thus, we propose to perform model…
Transformer models improve malware classification, especially for imbalanced datasets.
problem Imbalanced multiclass malware classification.
method Bagging-based random transformer forest (RTF) ensemble of pre-trained transformer models (BERT or CANINE).
result Ensemble of pre-trained transformer models achieves state-of-the-art F1-score of 0.6149 on a benchmark dataset.
Paper classifies Brazilian music genres using song lyrics with BLSTM network.
problem Classifying Brazilian music genres from lyrics.
method Used BLSTM network combined with SVM, Random Forest, and word embeddings.
result BLSTM outperforms other models with an F1-score of 0.48.
GWN improves multimodal data fusion accuracy for chronic pain patients.
problem Dynamic and unspecified uncertainties in multimodal data fusion.
method Inspired by Global Workspace Theory, GWN is a neural network architecture that dynamically attends to multiple modalities.
result GWN achieved higher F1 scores (0.92 and 0.75) for multimodal discrimination and classification tasks.
Gestalt combines two models to improve SQuAD2.0 performance.
problem Improving the accuracy of answering questions in context paragraphs.
method A stacking ensemble of ALBERT and RoBERTa models, combined with a CNN-based meta-model.
result Best ensemble achieved 87.117 EM and 90.306 F1 scores, improving baseline by 0.55% and 0.61% respectively.
To address Task 5 in the Detection and Classification of Acoustic Scenes and Events (DCASE) 2018 challenge, in this paper, we propose an ensemble learning system. The proposed system consists of three different models, based on convolutional neural network and long short memory recurrent neural network. With extracted …
For technology (like serious games) that aims to deliver interactive learning, it is important to address relevant mental experiences such as reflective thinking during problem solving. To facilitate research in this direction, we present the weDraw-1 Movement Dataset of body movement sensor data and reflective thinkin…
Syndromic surveillance detects and monitors individual and population health indicators through sources such as emergency department records. Automated classification of these records can improve outbreak detection speed and diagnosis accuracy. Current syndromic systems rely on hand-coded keyword-based methods to parse…
Proposes sigmoidF1 loss for multilabel classification, improving performance metrics.
problem Lack of smooth, tractable loss functions for multilabel classification.
method Introduces sigmoidF1, a smooth F1 score surrogate loss function.
result sigmoidF1 outperforms other loss functions on various datasets and metrics.
This study improves early prediction of CPAP therapy compliance.
problem Predicting early compliance with CPAP therapy to improve patient outcomes.
method Built classifiers for compliance at three CPAP therapy follow-up points.
result Month 3 classifier achieved highest f1-score of 87% in cross-validation and test.
A new stable similarity measure for time series using persistent homology.
problem Constructing a robust measure of time series similarity.
method Persistent homology for stability, bi-conditional periodicity score for similarity.
result Stability of the bi-conditional periodicity score under perturbations and dimension reduction.
Pronoun resolution is part of coreference resolution, the task of pairing an expression to its referring entity. This is an important task for natural language understanding and a necessary component of machine translation systems, chat bots and assistants. Neural machine learning systems perform far from ideally in th…
Deep learning detects snow avalanches in SAR images with high accuracy.
problem Accurate detection of snow avalanches in remote areas using satellite imagery.
method Fully Convolutional Neural Network trained on manually labeled Sentinel-1 radar images.
result Deep learning model achieves F1 score above 66% compared to 38% for state-of-the-art methods.
Class imbalance problem is commonly faced while developing machine learning models for real-life issues. Due to this problem, the fitted model tends to be biased towards the majority class data, which leads to lower precision, recall, AUC, F1, G-mean score. Several researches have been done to tackle this problem, most…
The Synthetic Minority Oversampling TEchnique (SMOTE) is widely-used for the analysis of imbalanced datasets. It is known that SMOTE frequently over-generalizes the minority class, leading to misclassifications for the majority class, and effecting the overall balance of the model. In this article, we present an approa…
BERTino is a lightweight Italian DistilBERT model for NLP tasks.
problem High computational and memory demands of large language models.
method Developed a DistilBERT model tailored for Italian language.
result F1 scores comparable to BERTBASE with significant speed improvements.
We study the performance of data-driven, a priori and random approaches to label space partitioning for multi-label classification with a Gaussian Naive Bayes classifier. Experiments were performed on 12 benchmark data sets and evaluated on 5 established measures of classification quality: micro and macro averaged F1 s…
Balancing the Scales: A Comprehensive Study on Tackling Class Imbalance in Binary Classificationcs.LG
Study evaluates three class imbalance techniques across diverse datasets.
problem Class imbalance in binary classification tasks.
method Synthetic Minority Over-sampling Technique (SMOTE), Class Weights tuning, Decision Threshold Calibration.
result Decision Threshold Calibration is the most consistently effective technique.
Improved race prediction model outperforms existing methods.
problem Improving race prediction using voter registration data.
method Trained BiLSTM model on voter registration data and created an ensemble.
result Achieved up to 36.8% higher OOS F1 scores than previous models.
The optimal ranking score between precision and recall is rarely F1 and can be found using specific methods.
problem Finding a meaningful and optimal compromise between precision and recall scores.
method Established a shortest path between precision- and recall-induced rankings, framed the problem as an optimization problem, and provided theoretical tools to find the optimal β.
result F1 and its skew-insensitive version are not optimal tradeoffs between precision and recall scores.
Growing Together: Modeling Human Language Learning With n-Best Multi-Checkpoint Machine Translationcs.CL
Modeling human language learning with multi-checkpoint machine translation.
problem Improving machine translation quality for language education.
method Ensemble of multi-checkpoints from a single model, sampling n-best sequences.
result Achieved 37.57 macro F1 score, outperforming baseline.
The study improves credit evaluation in peer-to-peer lending using machine learning.
problem Traditional credit histories are insufficient for distinguishing good from bad borrowers.
method Used machine learning classification and clustering algorithms to predict creditworthiness.
result Achieved 65% F1 and 73% AUC on LendingClub data, identifying key secondary attributes.
New metrics fail adversarial tests, with some more robust than others.
problem Evaluation metrics for time-series anomaly detection were improved but not fully robust.
method Adversarial stress-testing of 12 adopted metrics on real benchmarks.
result Some metrics are more robust than others, with ROC-based metrics being gamed more often.
Quantum Support Vector Classifier outperforms other QML models in finance fraud detection.
problem Detecting financial fraud using Quantum Machine Learning.
method Comparative study of four QML models: Quantum Support Vector Classifier, Variational Quantum Classifier, Estimator QNN, and Sampler QNN.
result Quantum Support Vector Classifier achieved the highest F1 scores (0.98) for fraud and non-fraud classes.
Improved multiclass classification with class-weighted nearest neighbors.
problem Multiclass classification with large or imbalanced classes.
method Class-weighted k-nearest neighbors algorithm, derived bounds on accuracy and risk.
result Optimized classification metrics like F1 score or Matthew's Correlation Coefficient.
Power Transformer Fault Diagnosis with Intrinsic Time-scale Decomposition and XGBoost Classifiercs.LG
A method uses ITD and XGBoost for precise power transformer fault diagnosis.
problem Fault diagnosis of power transformers using DGA data.
method Ranking DGA parameters by skewness, extracting ITD features, and using an XGBoost classifier.
result The method achieves over 95% accuracy in classification.
Paper fine-tunes a language model to predict long-term stock buy signals.
problem Predicting long-term stock price movements with narrative text.
method Fine-tuning a small language model on 10-K reports for buy/sell decisions.
result Buy signals generated from 10-K text are most precise at 6 and 9 months, providing 4.8-9% improvement over random selection.
Dreem Open Datasets: Multi-Scored Sleep Datasets to compare Human and Automated sleep stagingq-bio.QM
Study benchmarks automated sleep staging against human scorers, achieving human-level performance.
problem Lack of standardized comparison between human and automated sleep staging.
method Developed multi-scored datasets and a framework to compare multiple human scorers' consensus.
result Many automated methods can match human scorers' performance, with SimpleSleepNet achieving high F1 scores.
In this paper we show that reporting a single performance score is insufficient to compare non-deterministic approaches. We demonstrate for common sequence tagging tasks that the seed value for the random number generator can result in statistically significant (p < 10^-4) differences for state-of-the-art systems. For …
Improved performance in shape identification tasks using elastic metrics in t-SNE and UMAP.
problem Improper metrics in dimensionality reduction techniques lead to poor performance in machine learning applications.
method Incorporating elastic metrics into t-SNE and UMAP for functional data.
result Improved F1 scores on shape identification tasks for three benchmark datasets.
Precision at the indistinguishability threshold: a method for evaluating classification algorithmscs.LG
A new metric evaluates classification algorithms at the point of indistinguishability.
problem Evaluating classification algorithms at the point of indistinguishability.
method Set a threshold where algorithm's predictions are indistinguishable from real labels, then measure accuracy of positive labels.
result The new metric avoids pitfalls of existing metrics like AUC and F1-score.
Supervised machine learning (ML) algorithms are aimed at maximizing classification performance under available energy and storage constraints. They try to map the training data to the corresponding labels while ensuring generalizability to unseen data. However, they do not integrate meaning-based relationships among la…
New model detects crying in real-world settings with improved accuracy.
problem Generalization of cry detection models to real-world environments.
method Evaluated machine learning approaches on a novel dataset of real-world infant crying.
result Improved F1 score of 0.613 for crying event recognition in real-world settings.
Proposes a new undersampling method for imbalanced data classification.
problem Challenges of oversampling and undersampling in imbalanced data.
method Bilevel optimization framework for identifying optimal subset of majority training data.
result Improves F1 scores by up to 10% compared to state-of-the-art methods.
DISPR uses diffusion models to predict 3D cell shapes from 2D images.
problem Predicting 3D cell shapes from 2D microscopy images.
method Diffusion model trained to predict 3D shapes from 2D microscopy images as a prior.
result Adding DISPR predictions to minority cell classes improves classification accuracy.
The study uses supervised learning to classify research data by discipline.
problem Automatically categorizing research data by discipline for scientometric analysis.
method Used a large dataset of 609,524 records for training and evaluation, employing tree-based models and neural networks.
result Multi-layer perceptron models outperformed Long Short-Term Memory models in multi-label classification tasks.
A deep neural network detects sleep events in polysomnograms with high accuracy.
problem Manual scoring of sleep events in clinical analysis is inconsistent and time-consuming.
method A single deep neural network architecture trained on 1653 recordings for joint detection of arousals, leg movements, and sleep disordered breathing.
result Joint detection of sleep events yields higher accuracy compared to separate models, and correlates well with manual annotations.
RDLI integrates domain logic and context grounding to detect crypto anomalies under scarce labels.
problem Extreme label scarcity and evasion strategies in crypto networks.
method Relational Domain Logic Integration (RDLI) with Retrieval Grounded Context (RGC).
result RDLI outperforms GNN baselines by 28.9% in F1 score under 0.01% label scarcity.
TadGAN detects anomalies in time series data using GANs and LSTM.
problem Challenges in detecting anomalies in time series data, especially without labeled data.
method TadGAN uses Generative Adversarial Networks (GANs) with LSTM Recurrent Neural Networks to capture temporal correlations and compute anomaly scores.
result TadGAN outperforms 8 baseline methods in most cases, achieving the highest averaged F1 score.
In real-world machine learning applications, data subsets correspond to especially critical outcomes: vulnerable cyclist detections are safety-critical in an autonomous driving task, and "question" sentences might be important to a dialogue agent's language understanding for product purposes. While machine learning mod…
Efficient and precise classification of histological cell nuclei is of utmost importance due to its potential applications in the field of medical image analysis. It would facilitate the medical practitioners to better understand and explore various factors for cancer treatment. The classification of histological cell …