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

109218327436 · Jun 202019922001200920172026
48 results for classification rules

Advances rule-based multi-label classification using conformal prediction.

problem Improving accuracy and decision making in multi-label classification.
method Combines conformal prediction with rule-based learning to provide natural conformity scores and calibrate rule assessments.
result Calibrated conformity scores enhance prediction accuracy and decision making.

Optimal classification rules control error rates in multiclass mixture models.

problem Classifying observations in multiclass mixture models while controlling error rates.
method Finding optimal classification rules by searching an optimal region in the observation space, using Maximum A Posteriori (MAP) rule and heuristic computation.
result The FDR-like optimal rule can be significantly less conservative than thresholded MAP rules.

SigD2 reduces noisy rules in rule-based classifiers for better accuracy and readability.

problem Redundant and noisy rules in rule-based classifiers reduce model accuracy and readability.
method Two-stage pruning strategy and ensemble methods (bagging and boosting) to reduce noise and improve model performance.
result SigD2 and ACboost ensemble models outperform state-of-the-art classifiers in terms of accuracy and rule count.

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.

Paper classifies ruled surfaces in Lorentz-Minkowski space for a specific flow.

problem Classifying ruled surfaces in Lorentz-Minkowski space.
method Examining homothetic self-similar solutions of the inverse mean curvature flow.
result Existence of two classes of non-cylindrical homothetic solitons.

Multi-label classification (MLC) is a supervised learning problem in which, contrary to standard multiclass classification, an instance can be associated with several class labels simultaneously. In this chapter, we advocate a rule-based approach to multi-label classification. Rule learning algorithms are often employe…

2018-11-30abs ↗pdf ↗

New rule-based method for classification with scalability, interpretability, and fairness.

problem Developing a scalable and fair classification method.
method Column generation for linear programming, decision tree-based heuristic, and rule-based optimization.
result The method returns interpretable rules with optimal weights and addresses fairness constraints.

SOAR generates rules for both positive and negative classes in binary classification.

problem Lack of interpretability in machine learning models for binary classification.
method Extends or-of-and classification technique to both positive and negative classes.
result Competitive classification performance with simulated-annealing optimization.

A new classification rule for FDA improves classification performance by accounting for unequal covariance matrices.

problem Unequal covariance matrices in practical situations affect the performance of FDA and its variants.
method Proposes a novel classification rule for FDA that accounts for unequal covariance matrices, applicable to many FDA variants.
result The new classification rule improves classification performance compared to original FDA and variants.

Conventional techniques for supervised classification constrain the classification rules considered and use surrogate losses for classification 0-1 loss. Favored families of classification rules are those that enjoy parametric representations suitable for surrogate loss minimization, and low complexity properties suita…

2019-02-02abs ↗pdf ↗

We discuss theoretical aspects of the product rule for classification problems in supervised machine learning for the case of combining classifiers. We show that (1) the product rule arises from the MAP classifier supposing equivalent priors and conditional independence given a class; (2) under some conditions, the pro…

2013-01-17abs ↗pdf ↗

Paper extends transfer learning for decision rules, improving treatment rule estimation.

problem Estimating optimal individualized treatment rules under changing conditions.
method Bayes decision rules and low-dimensional empirical risk minimization.
result Consistent estimators and risk bounds established under mild conditions.

Interpretable classifiers have recently witnessed an increase in attention from the data mining community because they are inherently easier to understand and explain than their more complex counterparts. Examples of interpretable classification models include decision trees, rule sets, and rule lists. Learning such mo…

2019-05-01abs ↗pdf ↗

The paper classifies ruled surfaces in Lorentz-Minkowski space that are stationary for the moment of inertia.

problem Classifying ruled surfaces in Lorentz-Minkowski space that are stationary for the moment of inertia.
method Maximum principle applications, classification based on causal character of rulings.
result Planes are the only cylindrical stationary surfaces. For non-cylindrical surfaces, classification depends on the causal character of the rulings.

Novel approach for creating interpretable classifiers using bilevel optimization of split-rules in NLDTs.

problem Creating highly accurate and easily interpretable classifiers for practical applications.
method Representing classifiers as assemblies of simple mathematical rules using NLDTs with evolutionary bilevel optimization.
result The approach ensures interpretability while achieving high accuracy on various classification problems.

Simplifies random forests by breaking down trees into rules for better interpretability.

problem Balancing model complexity and accuracy in random forests.
method Breaking down random forest trees into individual classification rules and selecting a subset.
result A few selected rules can achieve acceptable accuracy similar to the original model, leading to simpler models.

Paper proves fair classification can be done via simple thresholding.

problem Achieving fair binary classification subject to group fairness constraints.
method Proves Bayes optimal fair learning rule is a group-wise thresholding rule over the Bayes regressor with randomization.
result Proposes an efficient unconstrained optimization algorithm for post-processing fair classification.

pRSL combines probabilistic rules to improve multi-label classification.

problem Modeling the structure between multi-label classes for better performance.
method Uses probabilistic propositional logic rules and belief propagation to combine predictions from multiple classifiers.
result pRSL achieves state-of-the-art performance on various benchmark datasets.

Many leading classification algorithms output a classifier that is a weighted average of kernel evaluations. Optimizing these weights is a nontrivial problem that still attracts much research effort. Furthermore, explaining these methods to the uninitiated is a difficult task. Letting all the weights be equal leads to …

2015-06-04abs ↗pdf ↗

A new ensemble method using random projections for kNN classification.

problem Improving kNN classification accuracy through ensemble methods.
method Random projection of bootstrap samples into lower dimensions, using extended neighbourhood rule for base learners.
result Enhanced classification accuracy compared to traditional kNN and other ensembles.

Critiques binary classification evaluation methods, advocating for proper scoring rules.

problem The dominance of top-K metrics and fixed-threshold evaluations in machine learning.
method Introduces a decision-theoretic framework mapping evaluation metrics to their use cases, and implements a clipped Brier score variant.
result Demonstrates the clinical utility of proper scoring rules through a Python package, exttt{briertools}.

Unique inhomogeneous ruled hypersurface found in complex hyperbolic space.

problem Classifying ruled real hypersurfaces with constant norm.
method Analyzing nonflat complex space forms, proving existence and uniqueness.
result Existence of a unique inhomogeneous example in complex hyperbolic space.

Prototype rules simplify multiclass classification in metric spaces, achieving consistency and reduced complexity.

problem Multiclass classification in metric spaces, focusing on universal consistency and convergence rates.
method Novel Proto-NN and hybrid rules for multiclass classification in metric spaces, analyzing convergence rates.
result Proto-NN is universally consistent and simpler to implement, with similar computational advantages.

In this paper, using the classifications of timelike and spacelike ruled surfaces, we study the Mannheim offsets of timelike ruled surfaces in Minkowski 3-space. Firstly, we define the Mannheim offsets of a timelike ruled surface by considering the Lorentzian casual character of the offset surface. We obtain that the M…

2009-06-11abs ↗pdf ↗

New split rules improve subpopulation targeting in policy-making.

problem Improving binary classification for subpopulation targeting in policy-making.
method MDFS, PFS, wEFS for maximizing distance and penalizing final splits.
result Proposed methods target more vulnerable subpopulations than classic CART/KD-CART.

TransINT embeds KGs by preserving implication rules, outperforming existing methods.

problem Embedding KGs while preserving relation implications for better access and analysis.
method Isomorphic intersections of linear subspaces with shared parameters for missing facts.
result Significant performance improvement in link prediction and triple classification.

This work bounds classification error in machine learning for low Bayes error conditions.

problem Understanding the error mismatch between Bayes error and model-based classification error.
method Applying classification error bounds to study the relationship with Kullback-Leibler divergence and proposing a linear approximation for low Bayes error conditions.
result A linear approximation of the classification error bound for low Bayes error conditions is proposed.

Study ruled real hypersurfaces in nonflat complex space forms with constant norm shape operators.

problem Proving nonexistence and characterizing ruled hypersurfaces in nonflat complex space forms.
method Analyzing shape operators with constant squared norm and using biharmonic properties.
result Biharmonic ruled real hypersurfaces are minimal, leading to their classification.

New method improves model explainability and accuracy with low computational cost.

problem Improving model explainability and accuracy in classification models.
method Distributionally robust optimization to learn sparse ensembles of rule sets.
result Improves model performance on various metrics compared to competing methods.

As a contribution to interpretable machine learning research, we develop a novel optimization framework for learning accurate and sparse two-level Boolean rules. We consider rules in both conjunctive normal form (AND-of-ORs) and disjunctive normal form (OR-of-ANDs). A principled objective function is proposed to trade …

2016-06-18abs ↗pdf ↗

This paper considers generalized linear models using rule-based features, also referred to as rule ensembles, for regression and probabilistic classification. Rules facilitate model interpretation while also capturing nonlinear dependences and interactions. Our problem formulation accordingly trades off rule set comple…

2019-06-05abs ↗pdf ↗