How does predicate invention affect human comprehensibility?

During the 1980s Michie defined Machine Learning in terms of two orthogonal axes of performance: predictive accuracy and comprehensibility of generated hypotheses. Since predictive accuracy was readily measurable and comprehensibility not so, later definitions in the 1990s, such as that of Mitchell, tended to use a one-dimensional approach to Machine Learning based solely on predictive accuracy, ultimately favouring statistical over symbolic Machine Learning approaches. In this paper we provide a definition of comprehensibility of hypotheses which can be estimated using human participant trials. We present the results of experiments testing human comprehensibility of logic programs learned with and without predicate invention. Results indicate that comprehensibility is affected not only by the complexity of the presented program but also by the existence of anonymous predicate symbols

Learning Theory Analysis for Association Rules and Sequential Event Prediction

We present a theoretical analysis for prediction algorithms based on association rules. As part of this analysis, we introduce a problem for which rules are particularly natural, called “sequential event prediction." In sequential event prediction, events in a sequence are revealed one by one, and the goal is to determine which event will next be revealed. The training set is a collection of past sequences of events. An example application is to predict which item will next be placed into a customer's online shopping cart, given his/her past purchases. In the context of this problem, algorithms based on association rules have distinct advantages over classical statistical and machine learning methods: they look at correlations based on subsets of co-occurring past events (items a and b imply item c), they can be applied to the sequential event prediction problem in a natural way, they can potentially handle the “cold start" problem where the training set is small, and they yield interpretable predictions. In this work, we present two algorithms that incorporate association rules. These algorithms can be used both for sequential event prediction and for supervised classification, and they are simple enough that they can possibly be understood by users, customers, patients, managers, etc. We provide generalization guarantees on these algorithms based on algorithmic stability analysis from statistical learning theory. We include a discussion of the strict minimum support threshold often used in association rule mining, and introduce an “adjusted confidence" measure that provides a weaker minimum support condition that has advantages over the strict minimum support. The paper brings together ideas from statistical learning theory, association rule mining and Bayesian analysis

Learning Theory Analysis for Association Rules and Sequential Event Prediction

We present a theoretical analysis for prediction algorithms based on association rules. As part of this analysis, we introduce a problem for which rules are particularly natural, called “sequential event prediction." In sequential event prediction, events in a sequence are revealed one by one, and the goal is to determine which event will next be revealed. The training set is a collection of past sequences of events. An example application is to predict which item will next be placed into a customer's online shopping cart, given his/her past purchases. In the context of this problem, algorithms based on association rules have distinct advantages over classical statistical and machine learning methods: they look at correlations based on subsets of co-occurring past events (items a and b imply item c), they can be applied to the sequential event prediction problem in a natural way, they can potentially handle the “cold start" problem where the training set is small, and they yield interpretable predictions. In this work, we present two algorithms that incorporate association rules. These algorithms can be used both for sequential event prediction and for supervised classification, and they are simple enough that they can possibly be understood by users, customers, patients, managers, etc. We provide generalization guarantees on these algorithms based on algorithmic stability analysis from statistical learning theory. We include a discussion of the strict minimum support threshold often used in association rule mining, and introduce an “adjusted confidence" measure that provides a weaker minimum support condition that has advantages over the strict minimum support. The paper brings together ideas from statistical learning theory, association rule mining and Bayesian analysis

Prediction uncertainty and optimal experimental design for learning dynamical systems

Dynamical systems are frequently used to model biological systems. When these models are fit to data, it is necessary to ascertain the uncertainty in the model fit. Here, we present prediction deviation, a metric of uncertainty that determines the extent to which observed data have constrained the model's predictions. This is accomplished by solving an optimization problem that searches for a pair of models that each provides a good fit for the observed data, yet has maximally different predictions. We develop a method for estimating a priori the impact that additional experiments would have on the prediction deviation, allowing the experimenter to design a set of experiments that would most reduce uncertainty. We use prediction deviation to assess uncertainty in a model of interferon-alpha inhibition of viral infection, and to select a sequence of experiments that reduces this uncertainty. Finally, we prove a theoretical result which shows that prediction deviation provides bounds on the trajectories of the underlying true model. These results show that prediction deviation is a meaningful metric of uncertainty that can be used for optimal experimental design

Ultra-Strong Machine Learning: comprehensibility of programs learned with ILP

During the 1980s Michie defined Machine Learning in terms of two orthogonal axes of performance: predictive accuracy and comprehensibility of generated hypotheses. Since predictive accuracy was readily measurable and comprehensibility not so, later definitions in the 1990s, such as Mitchell’s, tended to use a one-dimensional approach to Machine Learning based solely on predictive accuracy, ultimately favouring statistical over symbolic Machine Learning approaches. In this paper we provide a definition of comprehensibility of hypotheses which can be estimated using human participant trials. We present two sets of experiments testing human comprehensibility of logic programs. In the first experiment we test human comprehensibility with and without predicate invention. Results indicate comprehensibility is affected not only by the complexity of the presented program but also by the existence of anonymous predicate symbols. In the second experiment we directly test whether any state-of-the-art ILP systems are ultra-strong learners in Michie’s sense, and select the Metagol system for use in humans trials. Results show participants were not able to learn the relational concept on their own from a set of examples but they were able to apply the relational definition provided by the ILP system correctly. This implies the existence of a class of relational concepts which are hard to acquire for humans, though easy to understand given an abstract explanation. We believe improved understanding of this class could have potential relevance to contexts involving human learning, teaching and verbal interaction

Prediction of stroke using deep learning model

© Springer International Publishing AG 2017. Many predictive techniques have been widely applied in clinical decision making such as predicting occurrence of a disease or diagnosis, evaluating prognosis or outcome of diseases and assisting clinicians to recommend treatment of diseases. However, the conventional predictive models or techniques are still not effective enough in capturing the underlying knowledge because it is incapable of simulating the complexity on feature representation of the medical problem domains. This research reports predictive analytical techniques for stroke using deep learning model applied on heart disease dataset. The atrial fibrillation symptoms in heart patients are a major risk factor of stroke and share common variables to predict stroke. The outcomes of this research are more accurate than medical scoring systems currently in use for warning heart patients if they are likely to develop stroke

Translocation of zeatin riboside and zeatin in soybean explants

Soybean explants consisting of a leaf, one or more young pods, and a subtending piece of stem were given a 1-h pulse of 3 H (ring-labeled)-zeatin riboside (ZR) or -zeatin (Z), via the base of the stem, followed by a 24-h incubation. At the end of the pulse, about 55% of the soluble 3 H was in the leaf blades, 11% in the petiole, 30% in the stem, 2% in the carpels, 0.1% in the seed coats, and 0.08% in the embryos. After 24 h, the percentages were 58, 7, 26, 6, 2, and 0.3, respectively. During this period, the total soluble 3 H decreased by 84%, the remainder being bound to “insoluble” material. The 3 H-cytokinin was rapidly converted to diverse metabolites including adenosine and adenine. At the end of the 1-h pulse, appreciable percentages (1–16%) of the total soluble 3 H in the seed coats chromatographed with ZR (or dihydro ZR) and with the 5′-phosphate of ZR, but these percentages declined markedly at 24 h. No distinct peaks of 3 H corresponded to known metabolites in the soluble extracts of embryos, and at 24 h, the 3 H equivalent to ZR must have been less than 0.0006% of the 3 H-ZR supplied. The bound 3 H corresponded to adenine and guanine in DNA and RNA. In contrast to cytokinin, 3 H-adenosine given as a pulse was readily translocated into the seed coats and embryos. Thus, cytokinin (ZR and Z) flowing up through the xylem from the root system does not readily enter the embryo (though metabolites such as adenosine could), and the seeds clearly do not compete with the leaves for this supply of cytokinin.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45929/1/344_2005_Article_BF02042255.pd

Novel Cytokinin Derivatives Do Not Show Negative Effects on Root Growth and Proliferation in Submicromolar Range

BACKGROUND: When applied to a nutrition solution or agar media, the non-substituted aromatic cytokinins caused thickening and shortening of the primary root, had an inhibitory effect on lateral root branching, and even showed some negative effects on development of the aerial part at as low as a 10 nanomolar concentration. Novel analogues of aromatic cytokinins ranking among topolins substituted on N9-atom of adenine by tetrahydropyranyl or 4-chlorobutyl group have been prepared and tested in standardized cytokinin bioassays [1]. Those showing comparable activities with N(6)-benzylaminopurine were further tested in planta. METHODOLOGY/PRINCIPAL FINDINGS: The main aim of the study was to explain molecular mechanism of function of novel cytokinin derivatives on plant development. Precise quantification of cytokinin content and profiling of genes involved in cytokinin metabolism and perception in treated plants revealed several aspects of different action of m-methoxytopolin base and its substituted derivative on plant development. In contrast to standard cytokinins, N9- tetrahydropyranyl derivative of m-topolin and its methoxy-counterpart showed the negative effects on root development only at three orders of magnitude higher concentrations. Moreover, the methoxy-derivative demonstrates a positive effect on lateral root branching and leaf emerging in a nanomolar range of concentrations, in comparison with untreated plants. CONCLUSIONS/SIGNIFICANCE: Tetrahydropyranyl substitution at N9-position of cytokinin purine ring significantly enhances acropetal transport of a given cytokinins. Together with the methoxy-substitution, impedes accumulation of non-active cytokinin glucoside forms in roots, allows gradual release of the active base, and has a significant effect on the distribution and amount of endogenous isoprenoid cytokinins in different plant tissues. The utilization of novel aromatic cytokinin derivatives can distinctively improve expected hormonal effects in plant propagation techniques in the future