A new prepruning technique for rule induction is presented which applies instance reduction before rule induction. An empirical evaluation records the predictive accuracy and size of rule-sets generated from 24 datasets from the UCI Machine Learning Repository. Three instance reduction algorithms (Edited Nearest Neighbour, AllKnn and DROP5) are compared. Each one is used to reduce the size of t...

The adequacy of current machine-learning techniques relies on an implicit built-in assumption in which simplicity and similarity play signiicant roles. This paper discusses on the insuuciency of these assumptions for domains where complex attribute interactions characterize the target concept (i.e. on diicult domains), and revives a model of induction where change of representation, through the...

This paper studies learning inference by induction. We first consider the problem of learning logical inference rules. Given a set S of propositional formulas and their logical consequences T , the goal is to find deductive inference rules that produce T from S. We show that an induction algorithm LF1T, which learns logic programs from interpretation transitions, successfully produces deductive...

The stability study of a multi-phase (six-phase) induction machine has been performed by applying the eigenvalues stability criterion to the small displacement equations obtained by linearization about an operating point. The eigenvalues provide a simple means of predicting the behavior of an induction machine at any balanced operating condition. The eigenvalues are dependent upon the parameter...

In this research work, an improved two-dimensional semi-analytical subdomain based method for performance computation in IPM machine considering infinite-/finite-magnetic material permeability in pseudo-Cartesian coordinates by using hyperbolic functions has been presented. In the developed technique, all subdomains are divided into periodic or non-periodic regions with homogeneous or non-homog...

Turkic languages exhibit extensive and diverse etymological relationships among lexical items. These relationships make the Turkic languages promising for exploring automated translation lexicon induction by leveraging cognate and other etymological information. However, due to the extent and diversity of the types of relationships between words, it is not clear how to annotate such information...

Lists of if±then rules (i.e. ordered rule sets) are among the most expressive and intelligible representations for inductive learning algorithms. Two extreme strategies searching for such a list of rules can be distinguished: (i) local strategies primarily based on a step-by-step search for the optimal list of rules, and (ii) global strategies primarily based on a one-strike search for the opti...

We give a new proof of the Krohn-Rhodes theorem using local divisors. The proof provides nearly as good a decomposition in terms of size as the holonomy decomposition of Eilenberg, avoids induction on the size of the state set, and works exclusively with monoids with the base case of the induction being that of a group.

Knowledge bases open new horizons for machine learning research. One challenge is to design learning programs to expand the knowledge base using the knowledge that is currently available. This paper addresses the problem of discovering regularities in large knowledge bases that contain many assertions in diierent domains. The paper begins with a deenition of regularities and gives the motivatio...