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

81161242322 · Jun 202019922001200920172026
48 results for Dempster combination rule

Paper uses evidence theory to improve stock price forecasting accuracy.

problem Inaccurate stock price predictions due to time series limitations.
method Applies evidence theory's confidence functions and Dempster combination rule to stock price forecasting.
result Improved accuracy in stock price predictions compared to classic methods.

Rule-based classifiers quantify uncertainty using Bernoulli random variables.

problem Quantifying the uncertainty of precision estimates for rule-based text classifiers.
method Treat partitions of sub-strings as Bernoulli random variables, compare means using statistical tests, and combine classifiers using Dempster-Shafer theory.
result The approach can be used to combine binary classifiers into a multi-label classifier.

By elaborating on the notion of linear belief functions (Dempster 1990; Liu 1996), we propose an elementary approach to knowledge representation for expert systems using linear belief functions. We show how to use basic matrices to represent market information and financial knowledge, including complete ignorance, stat…

2012-10-19abs ↗pdf ↗

A fuzzy expert system selects stocks for BSE using AI techniques.

problem Selecting stocks for investment allocation is challenging due to many influencing factors.
method Dempster-Shafer (DS) evidence theory for rule base generation, portfolio optimization model with ACO algorithm.
result The model's performance is satisfactory for short-term investment.

A method for consensus prediction from probabilistic classifier outputs.

problem Combining probabilistic classifier outputs without prior information.
method Iteratively updating predictions based on classifier diversity and convergence.
result Consensus predictions converge to a decision based on classifier outputs' correspondence.

A novel ensemble classifier improves vibration-based quality monitoring accuracy.

problem Developing high accuracy classification methods for general datasets.
method Dempster-Shafer theory of evidence with three remedies for conflicting evidences.
result The proposed ensemble classifier outperforms state-of-the-art fusion techniques.

Estimates classification rules from partially classified data.

problem Estimating Bayes' rule for unclassified observations in partially classified data.
method Fitting a g-component mixture model by maximum likelihood (ML) via the EM algorithm.
result Asymptotic relative efficiency (ARE) of Bayes' rule estimated from partially classified samples.

The paper proposes a method to calibrate evidential clustering using bootstrapped finite mixture models.

problem Representing uncertainty in cluster membership using Dempster-Shafer mass functions.
method Constructing Dempster-Shafer mass functions by bootstrapping finite mixture models, computing confidence intervals, and calibrating the evidential partition.
result The proposed method calibrates the evidential partition such that the belief and plausibility degrees approximate the true probabilities with high confidence.

The asymptotic distribution of the Markowitz portfolio is derived, for the general case (assuming fourth moments of returns exist), and for the case of multivariate normal returns. The derivation allows for inference which is robust to heteroskedasticity and autocorrelation of moments up to order four. As a side effect…

2013-12-02abs ↗pdf ↗

Combines neural networks and expert rules for concept-based learning.

problem Extending concept-based learning with machine learning models.
method Form constraints for joint probability distribution and represent feasible set as a convex polytope.
result Neural networks can be trained to satisfy expert rules without violating them.

Paper explores folding patterns of curved creases preserving their geometric properties.

problem Investigating rigid-ruling folding motions of curved crease-rule patterns.
method Deriving conditions for rigid-ruling foldability and analyzing combinations of creases.
result Constant fold-angle creases are only compatible with other constant fold-angle creases.

LI-ITR combines flexible ML with interpretable approximations for personalized treatment rules.

problem Combining flexibility and interpretability in personalized treatment rules.
method Uses variational autoencoders and a mixture of interpretable experts.
result Accurately recovers true local coefficients and optimal treatment strategies.

In this article, the logic rule ensembles approach to supervised learning is applied to the unsupervised or semi-supervised clustering. Logic rules which were obtained by combining simple conjunctive rules are used to partition the input space and an ensemble of these rules is used to define a similarity matrix. Simila…

2012-07-17abs ↗pdf ↗

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.

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 ↗

Combining deep neural networks with structured logic rules is desirable to harness flexibility and reduce uninterpretability of the neural models. We propose a general framework capable of enhancing various types of neural networks (e.g., CNNs and RNNs) with declarative first-order logic rules. Specifically, we develop…

2016-03-21abs ↗pdf ↗

New framework learns interpretable rule ensembles without sacrificing accuracy.

problem Trade-off between accuracy and interpretability in rule ensembles.
method Introduces local interpretability and a regularizer to promote it, using coordinate descent with local search.
result Learns rule ensembles with fewer rules to explain individual predictions, maintaining comparable accuracy.

New scoring rules for multivariate distributions and level sets.

problem Evaluating forecast accuracy for multivariate distributions and level sets.
method Theoretical framework for scoring rules, decomposition of multivariate scoring functions, numerical algorithm for computation.
result New scoring functions for multivariate distributions and level sets, including density and cumulative distribution level sets.

CRL approach improves understanding of heterogeneous treatment effects in complex diseases.

problem Estimating heterogeneous treatment effects in complex diseases.
method Causal rule learning (CRL) workflow consisting of rule discovery, selection, and analysis.
result CRL outperforms other methods in providing interpretable estimates of HTE.

Method integrates logical rules into neural multi-hop reasoning for drug repurposing.

problem Capturing long-range dependencies in biomedical data.
method Combines logical rules with neural multi-hop reasoning using reinforcement learning.
result Our method outperforms baseline methods in drug repurposing tasks.

We consider the problem of learning a sparse rule model, a prediction model in the form of a sparse linear combination of rules, where a rule is an indicator function defined over a hyper-rectangle in the input space. Since the number of all possible such rules is extremely large, it has been computationally intractabl…

2018-10-03abs ↗pdf ↗

We present a novel method - LIBRE - to learn an interpretable classifier, which materializes as a set of Boolean rules. LIBRE uses an ensemble of bottom-up weak learners operating on a random subset of features, which allows for the learning of rules that generalize well on unseen data even in imbalanced settings. Weak…

2019-11-15abs ↗pdf ↗

This work improves Bayesian Optimization for setting DNN hyper-parameters.

problem Manual setting of DNN hyper-parameters is error-prone and computationally expensive.
method Combines Bayesian Optimization with tuning rules to reduce search space and improve accuracy.
result Improves efficiency and accuracy of hyper-parameter tuning for deep neural networks.

Distribution grids are currently challenged by frequent voltage excursions induced by intermittent solar generation. Smart inverters have been advocated as a fast-responding means to regulate voltage and minimize ohmic losses. Since optimal inverter coordination may be computationally challenging and preset local contr…

2018-07-10abs ↗pdf ↗

Combines control variates and adaptive importance sampling for Monte Carlo integration.

problem Improving Monte Carlo integration accuracy with control variates and adaptive sampling.
method A quadrature rule combining control variates and adaptive importance sampling.
result Non-asymptotic bound on the probabilistic error of the procedure.

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.

Rule-based models are often used for data analysis as they combine interpretability with predictive power. We present RuleKit, a versatile tool for rule learning. Based on a sequential covering induction algorithm, it is suitable for classification, regression, and survival problems. The presence of a user-guided induc…

2019-08-02abs ↗pdf ↗

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 ↗

We propose a method to extract interpretable rules from tree ensembles.

problem Tree ensembles are accurate but hard to interpret.
method Propose an estimator to extract compact sets of decision rules from tree ensembles.
result Our estimator improves accuracy and reveals useful relationships in the data.

Proposes robust ITRs integrating multiple datasets to handle posterior shift.

problem Posterior shift in conditional outcome distributions between source and target populations.
method Distributionally robust approach with closed-form solution and adaptive uncertainty tuning.
result Achieves superior performance compared to existing methods in simulations and real-data applications.

This study combines two different learning paradigms, k-nearest neighbor (k-NN) rule, as memory-based learning paradigm and relevance vector machines (RVM), as statistical learning paradigm. This combination is performed in kernel space and is called k-relevance vector (k-RV). The purpose is to improve the performance …

2019-09-18abs ↗pdf ↗