Classification is an important data mining technique that is used by many applications. Several types of classifiers have been described in the research literature. Example classifiers are decision tree classifiers, rule-based classifiers, and neural networks classifiers. Another popular classification technique is naïve Bayesian classification. Naïve Bayesian classification is a probabilistic ...

This paper concerns the iterative implementation of a knowledge model in a data mining context. Our approach relies on coupling a Bayesian network design with an association rule discovery technique. First, discovered association rule relevancy isenhanced by exploiting the expert knowledge encoded within a Bayesian network, i.e., avoiding to provide trivial rules w.r.t. known dependencies. More...

The field of optimization and machine learning are increasingly interplayed and optimization in different problems leads to the use of machine learning approaches‎. ‎Machine learning algorithms work in reasonable computational time for specific classes of problems and have important role in extracting knowledge from large amount of data‎. ‎In this paper‎, ‎a methodology has been employed to opt...

The paper describes an inductive learning environment called DELVAUX for classiication tasks that learns PROSPECTOR-style, Bayesian classiication rules from sets of examples. A genetic algorithm approach is used for learning Bayesian rule-sets, in which a population consists of sets of rule-sets that generate oospring through the exchange of rules, permitting tter rule-sets to produce oospring ...

Although Bayesian model averaging (BMA) is in principle the optimal method for combining learned models, it has received relatively little attention in the machine learning literature. This article describes an extensive empirical study of the application of BMA to rule induction. BMA is applied to a variety of tasks and compared with more ad hoc alternatives like bagging. In each case, BMA typ...

Recently, new approaches to adaptive control have sought to reformulate the problem as a minimization of a relative entropy criterion to obtain tractable solutions. In particular, it has been shown that minimizing the expected deviation from the causal input-output dependencies of the true plant leads to a new promising stochastic control rule called the Bayesian control rule. This work proves ...

Bayesian shrinkage analysis is arguably the state-of-the-art technique for large-scale multiple quantitative trait locus (QTL) mapping. However, when the shrinkage model does not involve indicator variables for marker inclusion, QTL detection remains heavily dependent on significance thresholds derived from phenotype permutation under the null hypothesis of no phenotype-to-genotype association....

This paper aims to find a suitable decision rule for a binary composite hypothesis-testing problem with a partial or coarse prior distribution. To alleviate the negative impact of the information uncertainty, a constraint is considered that the maximum conditional risk cannot be greater than a predefined value. Therefore, the objective of this paper becomes to find the optimal decision rule to ...

In standard models of iterative thinking, players choose a fixed rule level from a fixed rule hierarchy. Nonequilibrium behavior emerges when players do not perform enough thinking steps. Existing approaches, however, are inherently static. This paper introduces a Bayesian level-k model, in which players perform Bayesian updating of their beliefs on opponents’ rule levels and best-respond with ...