Develops algorithms for constructing statistical industry classifications.
problem Creating accurate industry classifications for quantitative trading.
method Combines clustering algorithms with correlation analysis to improve fundamental industry classifications.
result Shows that clustering methods improve off-the-shelf industry classifications.
The paper examines how algorithmic classification affects behavior and proposes democratizing stakes to mitigate predatory practices.
problem The impact of algorithmic classification on individual behavior and fairness in decision-making processes.
method Characterization of optimal classification by an algorithm designer and analysis of the effect of democratizing stakes.
result Optimal classification can lead to surprising behavior patterns, and democratizing stakes can mitigate predatory practices.
Study proposes an ensemble learning method to improve multi-label classification performance.
problem Improving multi-label classification performance in machine learning.
method Ensemble learning approach using multiple base-level algorithms.
result Proposed method outperforms base-level algorithms in multi-label classification.
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.
Unified fair classification with provable guarantees.
problem Fairness in classification algorithms for sensitive attributes.
method Meta-algorithm for convex and non-convex constraints.
result Provable guarantees for multiple fairness metrics.
Study reduces dataset size by 3 attributes to 73% classification accuracy.
problem Reducing dataset size for gender classification in TSI Life Satisfaction Survey.
method Attribute selection using Chi2 algorithm, followed by classification tests with Naive Bayes and Random Forest.
result Best classification rate achieved with 3 attributes selected by Chi2 algorithm.
The paper evaluates classification and outlier detection algorithms for temporal data.
problem Improving accuracy in classification and outlier detection for temporal data.
method Comparison of six fast algorithms on various time-series datasets.
result Gradient Boosting Machines are best for classification, but no single algorithm is best for outlier detection.
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.
Non-intrusive algorithm corrects corrupted data in classification models.
problem Classification problems with corrupted training data.
method Post-processes a trained classification model with a correction procedure.
result Corrected models deliver correct classification results even with corrupted data.
Paper presents a new framework for sequence classification.
problem Sequence classification in real-world applications.
method Reference-based sequence classification framework.
result New sequence classification algorithms achieve comparable accuracy.
Paper analyzes multiclass classification with high-dimensional data.
problem Understanding statistical properties and behavior of multiclass classification algorithms.
method Asymptotic analysis of linear multiclass classification.
result Test error varies significantly across different training algorithms and data distributions.
Survey of text classification algorithms for complex documents.
problem Understanding and classifying complex texts using machine learning.
method Discusses various text feature extractions, dimensionality reduction methods, and classification algorithms.
result Overview of text classification techniques and their limitations.
Efficient deep learning for hyperspectral image classification using active learning.
problem Lack of good-quality labeled samples for deep learning in hyperspectral images.
method Weighted incremental dictionary learning for active selection of training samples.
result The proposed algorithm improves deep learning efficiency and effectiveness in hyperspectral image classification.
Extends PCVM for multi-class classification with improved accuracy.
problem Lack of probabilistic outputs and contradictory predictions in multi-class classification.
method Proposes mPCVM with two learning algorithms: top-down and bottom-up.
result Superior performance, especially with many classes, validated on synthetic and benchmark data.
Algorithm minimizes risk for multiclass classification of stochastic diffusion paths.
problem Multiclass classification of stochastic diffusion paths with distinct drift functions.
method Empirical risk minimization using L2 risk.
result Achieves fast rates of convergence under margin assumption.
Paper shows adversarial classification algorithms are inherently more sensitive to data manipulation.
problem Inadequate provable guarantees for machine learning performance, especially in unreliable data environments.
method Formal analysis of binary classification algorithms' sensitivity to adversarial manipulation.
result Fundamental tradeoff curve between accuracy and sensitivity is determined by data statistics, not algorithm tuning.
New framework for fair and stable classification.
problem Stability of fair classification algorithms under dataset variations.
method Extended fair classification framework with stability regularization.
result Improved stability with only slight accuracy loss.
Paper introduces ILD algorithm to determine Bayes error for binary classification.
problem Determining the best possible performance in binary classification problems.
method Model-agnostic ILD algorithm to calculate Bayes error.
result Provides intrinsic limits of any binary classification algorithm.
This paper compares machine learning algorithms for ecological data.
problem Classifying ecological datasets into subsets with common patterns.
method Applied eight machine learning classification algorithms to ecological data.
result Linear Discriminant Analysis and k-nearest neighbors are the best methods.
Pattern sampling reduces time series classification complexity.
problem High computational complexity of exhaustive search for shapelets.
method Pattern sampling using a weighted trie to extract discriminative patterns.
result Significant reduction in computational and memory resources.
Study recommends five machine learning algorithms for bioinformatics classification problems.
problem Applying machine learning to bioinformatics classification problems.
method Analysis of 13 machine learning algorithms on 165 bioinformatics classification problems.
result Five algorithms with optimal hyperparameters for bioinformatics classification problems.
Paper proposes online algorithms for multiclass classification with partial labels.
problem Classifying data with partial labels.
method Avg Perceptron, Max Perceptron, Avg Pegasos, Max Pegasos algorithms.
result Mistake bounds for Avg Perceptron and regret bound for Avg Pegasos.
New algorithm boosts classification for imbalanced data.
problem Accurately classifying observations in severely imbalanced datasets.
method SAMME.C2 algorithm blending boosting and cost-sensitive techniques.
result Consistently superior performance in imbalanced classification problems.
New online learning algorithm combines PA and TER for binary classification.
problem Binary classification with non-separable data and data imbalance.
method Online Passive-Aggressive (PA) and Total-Error-Rate (TER) learning combined into PATER algorithm.
result PATER algorithms outperform existing online learning algorithms in efficiency and effectiveness.
Simple algorithm outperforms complex methods in graph classification.
problem Efficient graph classification methods with comparable performance to state-of-the-art algorithms.
method Spectral decomposition of graph Laplacian.
result Simple algorithm achieves competitive results.
Improved decision tree algorithm for more accurate data classification.
problem ID3's tendency to choose attributes with many values.
method Divide attributes into groups, apply selection measure 5, and recursively refine until good classification is achieved.
result Proposed algorithm classifies data sets more accurately and efficiently.
Adaptive algorithms improve cost-sensitive online classification with second-order information.
problem Improving cost-sensitive online classification with second-order information.
method Proposes adaptive regularization algorithms with sketching technique for better trade-off between performance and efficiency.
result Empirically validated algorithms' effectiveness and properties in real-world anomaly detection tasks.
The study examines machine learning classification algorithms and their generalizability using Framingham Heart Study data.
problem Addressing biases and generalizability issues in machine learning classification algorithms.
method Comparison of eight machine learning classification algorithms on Framingham Heart Study data.
result Double discriminant scoring of type I is the most generalizable algorithm.
New NHCAs improve multi-category classification efficiency.
problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.
Differentially private fair binary classification algorithm developed.
problem Balancing privacy and fairness in binary classification.
method Decoupling technique for fairness, refinement for differential privacy.
result Algorithm maintains fairness, privacy, and utility guarantees.
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…
New clustering algorithm outperforms others in specialist-generalist classification.
problem Comparing clustering algorithms for specialist-generalist classification.
method Proposed a novel greedy pairs clustering algorithm and tested on CIFAR-10 and CIFAR-100 datasets.
result Greedy pairs clustering algorithm consistently outperforms other alternatives.
New method improves machine learning in physics.
problem Improving machine learning performance in physics with limited data.
method Weakly supervised classification using class proportions as input.
result Weakly supervised classification matches fully supervised algorithms in quark vs gluon tagging.
New algorithms reduce communication costs in collaborative learning.
problem Reducing communication costs in collaborative learning.
method Distributed boosting and adaptation to classification noise.
result Communication-efficient algorithms for collaborative PAC learning robust to noise.
New algorithms for hierarchical classification using conformal prediction.
problem Valid prediction sets in hierarchical classification tasks.
method Extended split conformal prediction framework with two inference algorithms.
result Empirical evaluations show effectiveness in achieving nominal coverage.
Gaptron algorithm reduces mistakes in online multiclass classification.
problem Online multiclass classification with limited information.
method Randomized first-order algorithm exploiting the gap between zero-one loss and surrogate losses.
result First linear time algorithm with O ( K T ) O(K\sqrt{T}) O ( K T ) expected regret. Study on classification and representation of multidimensional signals using Kronecker-structured models.
problem Performance limits and algorithms for classification and representation of multidimensional signals.
method Analysis of diversity order and classification capacity, development of K-SLD2 algorithm for fast Kronecker-structured learning.
result Agreement between diversity order analysis and empirical classification performance of K-S models.
Stochastic mirror descent improves multi-class classification accuracy.
problem Efficient multi-class classification using stochastic optimization.
method Derive risk bounds for stochastic mirror descent algorithm.
result Algorithm provides efficient error bounds for classification.
ICE algorithm solves exact 0-1 loss linear classification problem efficiently.
problem Exact solution to the 0-1 loss linear classification problem for non-linearly separable data.
method Incremental cell enumeration (ICE) algorithm, leveraging combinatorial and incidence relations.
result First provably optimal algorithm for exact 0-1 loss linear classification problem.
Optimal streaming algorithm for crowdsourced binary classification.
problem Binary classification of data using crowdsourcing.
method Learning labeller competence and minimizing prediction error rate.
result Cumulative regret is finite and independent of the number of tasks.
A Fourier-based learning algorithm for multiclass classification.
problem Highly nonlinear multiclass classification problems.
method Smoothing technique with low-pass filters to calculate probability distributions.
result Probabilistic explanation for classification without kernel functions.
Algorithm classifies five-dimensional spacetimes, generalizing Karlhede's for four dimensions.
problem Classifying five-dimensional spacetimes for general relativity.
method Introduces an algorithm to determine spacetime equivalence using alignment classification of the Weyl tensor.
result Illustrates the algorithm with three examples and discusses its applications.
Proposes an angle-based framework for multicategory cost-sensitive classification.
problem Cost-sensitive multicategory classification challenges.
method Angle-based cost-sensitive classification framework without sum-to-zero constraint.
result Proposed boosting algorithms yield competitive classification performances.
Study analyzes IMDB movie comments and Twitter data using machine learning and vector space techniques.
problem Sentiment analysis of IMDB movie comments and Twitter data.
method Created a vector space in KNIME Analytics platform, used Decision Trees, Naïve Bayes, and SVM algorithms for classification.
result SVM algorithm provided the best classification results for both IMDB movie comments and Twitter data sets.
A new algorithm reduces time complexity for binary time series classification.
problem High time complexity of ensemble shapelet transform limits its application.
method Introduces short isometric shapelet transform with two strategies: fixed shapelet length and single linear classifier.
result Demonstrates superior performance and reduced time complexity.
New optimization methods for neural networks improve classification accuracy.
problem Optimizing shallow networks for binary classification.
method Introducing a new family of optimization problems not covered by existing methods.
result New training algorithms with stable convergence and improved performance.
A new network-based method for high-level data classification without normalization.
problem Evaluation and classification of data with hidden attribute interactions.
method A new network-building methodology based on attribute-attribute interactions, avoiding normalization.
result Improvement in accuracy of high-level classification using betweenness centrality.
Develops robust classification algorithms for positive-unlabeled data with noisy labels.
problem Learning from positive-unlabeled data with noise in positive labels.
method Explicitly models noise in positive labels and uses univariate transforms built on discriminative classifiers.
result Estimates class prior and posterior distributions robustly from noisy positives and unlabeled data.