In rule learning, rules are typically induced in two phases, rule refinement and rule selection. It was recently argued that the usage of two separate heuristics for each phase—in particular using the so-called inverted heuristic in the refinement phase—produces longer rules with comparable classification accuracy. In this paper we test the utility of inverted heuristics in the context of subgr...

Using the formalism of supersymmetric quantum mechanics, we obtain a large number of new analytically solvable one-dimensional periodic potentials and study their properties. More specifically, the supersymmetric partners of the Lamé potentials ma(a+ 1) sn(x,m) are computed for integer values a = 1, 2, 3, .... For all cases (except a = 1), we show that the partner potential is distinctly differ...

Data quality is a major concern in Machine Learning and other correlated areas such as Knowledge Discovery from Databases (KDD). As most Machine Learning algorithms induce knowledge strictly from data, the quality of the knowledge extracted is largely determined by the quality of the underlying data. One relevant problem in data quality is the presence of missing data. Despite the frequent occu...

The aim of the Stat Log project is to compare the performance of statistical, machine learning, and neural network algorithms, on large real world problems. This paper describes the completed work on classification in the StatLog project. Classification is here defined to be the problem, given a set of multivariate data with assigned classes, of estimating the probability from a set of attribut...

We introduce a new bias for rule learning systems. The bias only allows a rule learner to create a rule that predicts class membership if each test of the rule in isolation is predictive of that class. Although the primary motivation for the bias is to improve the understandability of rules, we show that it also improves the accuracy of learned models on a number of problems. We also introduce ...

We investigate a graph function which is related to the local density, the maximal cut and the least eigenvalue of a graph. In particular it enables us to prove the following assertions: Let p 3 be integer, c 2 (0; 1=2) and G be a Kp-free graph on n vertices with e cn2 edges. There exists a positive constant = (c; p) such that a) some bn=2c subset of V (G) induces at most c 4 n edges (this answ...

Inductive algorithms rely strongly on their representational biases. Representational inadequacy can be mitigated by constructive induction. This paper introduces the notion of a relative gain measure and describes a new constructive induction algorithm (GALA) which is independent of the learning algorithm. GALA generates a small number of new boolean attributes from existing boolean, nominal o...

The title salt, C8H11N2O(+)·NO3(-), was synthesized by a reaction between 4-meth-oxy-benzamidine (4-amidino-anisole) and nitric acid. The asymmetric unit comprises a non-planar 4-meth-oxy-benzamidinium cation and a nitrate anion. In the cation, the amidinium group has two similar C-N bond lengths [1.302 (3) and 1.313 (3) Å] and its plane forms a dihedral angle of 32.66 (5)° with the mean plane ...

a Medway School of Pharmacy, Universities of Kent and Greenwich at Medway, Central Avenue, Chatham Maritime, Kent, ME4 4TB, United Kingdom. Fax: +44 (0)1634 883927; Tel: +44 (0)1634 202947; [email protected] b Clermont Université, Université Blaise Pascal, Laboratoire SEESIB, BP 10448, F-63000 ClermontFerrand c CNRS, UMR 6504, Laboratoire SEESIB, F-63177 AUBIERE cedex, France. Fax: +33 (0)...

This work surveys well-known approaches to building decision lists. Some novel variations to strategies based on default rules for the most common class and insertion of new rules before the default rule are presented. These are expected to offer speed up in the construction of the decision list as well as compression of the length of the list. These strategies and a testing regime have been im...