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.

168,742 papers · 148 categories

Trend · papers per month

3436861,0291,372 · Jun 202019922001200920172026
48 results for Classification Methods

Sequence classification is an important data mining task in many real world applications. Over the past few decades, many sequence classification methods have been proposed from different aspects. In particular, the pattern-based method is one of the most important and widely studied sequence classification methods in …

2019-05-17abs ↗pdf ↗

The number of possible methods of generalizing binary classification to multi-class classification increases exponentially with the number of class labels. Often, the best method of doing so will be highly problem dependent. Here we present classification software in which the partitioning of multi-class classification…

2014-04-15abs ↗pdf ↗

This review explores resampling techniques for imbalanced binary classification.

problem Imbalanced classes lead to poor prediction results in classification.
method Classical, cost-sensitive, and Neyman-Pearson paradigms with resampling techniques and classification methods.
result Complex dynamics among resampling techniques, base methods, metrics, and imbalance ratios.

Paper investigates methods to improve classification by inducing a hierarchy from flat labels.

problem Improving classification performance on datasets lacking a natural hierarchy.
method The approach involves clustering conditional distributions and using a hierarchical classifier with the induced hierarchy.
result The methods can discover latent hierarchies and improve accuracy in various applications.

A new method assesses how well non-parametric classification methods fit their data.

problem Lack of a goodness-of-fit assessment for non-parametric classification methods.
method Data splitting into training and validation sets, then comparing estimated and actual success probabilities.
result The BAGofT method can assess the goodness-of-fit of general classification procedures.

This paper discovers classification models from sequential data without prior knowledge.

problem Lack of prior knowledge in defining kernels for online classification.
method Adapts GP-based time-series structure discovery with SMC to learn new features from sequential data.
result Improves classification accuracy by 10% on real-world data.

Paper proposes fully Bayesian approach for RVM classification, improving accuracy especially in imbalanced data.

problem Difficulty in conducting RVM classification due to lack of closed-form solution for weight parameter posterior.
method Proposes Generic Bayesian and Fully Bayesian approaches with hierarchical hyperprior structure.
result Improves classification performance, especially in imbalanced data.

A method selects key genes from tumor transcriptomics data using kernel methods and improves classification performance.

problem Feature selection for tumor classification using gene expression data.
method Multiple Kernel Learning with latent regularization and non-linear dimensionality reduction.
result Improved tumor classification performance on unseen test samples.

This paper improves land cover classification using global spatial features in CNN.

problem Limited classification accuracy and universality of traditional remote sensing image classification methods.
method Integrates global spatial features into a dual-branch CNN for hyperspectral/SAR imagery classification.
result The proposed method outperforms traditional single-channel CNN methods.

This paper tackles tweet classification by identifying purpose and position.

problem Difficulties in determining user intention and attitude in short, informal tweets.
method Transformed tweet classification into a multi-label problem and applied a multi-label classification method with post-processing.
result The method effectively classifies tweet purpose and position, outperforming individual classification methods.

Linear classification has been widely used in many high-dimensional applications like text classification. To perform linear classification for large-scale tasks, we often need to design distributed learning methods on a cluster of multiple machines. In this paper, we propose a new distributed learning method, called f…

2018-02-10abs ↗pdf ↗

Ordinal data are often seen in real applications. Regular multicategory classification methods are not designed for this data type and a more proper treatment is needed. We consider a framework of ordinal classification which pools the results from binary classifiers together. An inherent difficulty of this framework i…

2015-05-13abs ↗pdf ↗

Paper compares AutoML methods for recommending classification algorithms.

problem Finding the best classification algorithm for a dataset.
method Four AutoML methods using Evolutionary Algorithms and CASH approach.
result EA-based methods, especially decision-tree induction, produce interpretable models.

A hierarchical approach improves classification accuracy in large datasets.

problem Improving classification accuracy in large datasets with high dimensionality.
method Hierarchical subspace learning to scale manifold learning methods.
result Average 5% increase in classification accuracy.

A novel method for classification with rejection using ensemble of cost-sensitive classifiers.

problem Avoid risky misclassification in error-critical applications.
method Learning an ensemble of cost-sensitive classifiers.
result Improved classification accuracy and flexibility in loss selection.

Delta method vs Bootstrap for deep learning classification shows strong linear relationship and faster computation.

problem Validating the Delta method for deep learning classification.
method Comparison of Delta method and Bootstrap on LeNet-based neural networks using MNIST and CIFAR-10 datasets.
result The Delta method provides a five times faster computation with strong linear predictive uncertainty relationship.

Proposes a method to classify binary data from multiple unlabeled datasets.

problem High annotation costs in training classifiers from weakly supervised data.
method Introduces surrogate set classification (SSC) to predict data origin from multiple unlabeled datasets, then uses this to train a binary classifier.
result Demonstrates superior performance compared to existing methods.

Bayesian optimisation method targets graph classification models against adversarial attacks.

problem Adversarial attacks on graph classification models, especially for graph-level tasks.
method Bayesian optimisation-based attack method for graph classification models.
result Effectiveness and flexibility of the proposed method validated on various graph classification tasks.

A framework for causal classification using uplift and causal heterogeneity methods.

problem Predicting the effect of interventions on different individuals from data.
method Causal classification framework using off-the-shelf supervised methods.
result Framework works for causal classification and uplift modelling, competitive with other methods.

Novel method converts time series data into functional data for high dimensional classification.

problem Small sample size problem in high dimensional time series data.
method Classwise Functional Principal Component Analysis (PCA) followed by Bayesian linear classifier.
result Demonstrated efficacy on synthetic and real data sets.

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.

Mitigates overfitting in UU classification from two unlabeled datasets.

problem Overfitting in the UU classification method.
method Wrapping negative empirical risk terms with correction functions and proving consistency.
result Successfully mitigates overfitting and improves classification accuracy.

InSphereNet uses infilling spheres for 3D object classification, improving accuracy with fewer parameters.

problem 3D object classification using points, voxels, or images.
method Constructs infilling spheres from signed distance field (SDF) for classification.
result InSphereNet achieves superior accuracy with fewer inputs and parameters.

We propose a voted dual averaging method for online classification problems with explicit regularization. This method employs the update rule of the regularized dual averaging (RDA) method, but only on the subsequence of training examples where a classification error is made. We derive a bound on the number of mistakes…

2013-10-17abs ↗pdf ↗

Text classification on drug SMILES strings yields competitive drug type classification results.

problem Classifying drug types using conventional text classification methods.
method Treated drug SMILES as sentences and applied basic NLP methods for classification.
result Competitive drug type classification results achieved.

Two new undersampling methods improve classification accuracy for imbalanced datasets.

problem Class imbalance and distributional differences in large datasets lead to biased models and poor predictive performance.
method Mutual information-based stratified simple random sampling and support points optimization.
result Empirical results show higher balanced classification accuracy compared to traditional techniques.

Crowdsourcing utilizes the wisdom of crowds for collective classification via information (e.g., labels of an item) provided by labelers. Current crowdsourcing algorithms are mainly unsupervised methods that are unaware of the quality of crowdsourced data. In this paper, we propose a supervised collective classificatio…

2015-07-23abs ↗pdf ↗

The paper tackles fair set-valued classification under demographic parity constraints.

problem Set-valued classification can amplify discriminatory bias, especially in multiclass settings.
method Proposes two strategies: an oracle-based method and a proxy method, both aiming to satisfy demographic parity and expected size constraints.
result Established distribution-free convergence rates and excess-risk bounds for both methods.

ROCKET speeds up time series classification without sacrificing accuracy.

problem High computational complexity and intractability of existing time series classification methods.
method Simple linear classifiers using random convolutional kernels.
result Achieves state-of-the-art accuracy with significantly reduced computational expense.