Expert System for Crop Disease based on Graph Pattern Matching: A proposal

Para la agroindustria, las enfermedades en cultivos constituyen uno de los problemas más frecuentes que generan grandes pérdidas económicas y baja calidad en la producción. Por otro lado, desde las ciencias de la computación, han surgido diferentes herramientas cuya finalidad es mejorar la prevención y el tratamiento de estas enfermedades. En este sentido, investigaciones recientes proponen el desarrollo de sistemas expertos para resolver este problema haciendo uso de técnicas de minería de datos e inteligencia artificial, como inferencia basada en reglas, árboles de decisión, redes bayesianas, entre otras. Además, los grafos pueden ser usados para el almacenamiento de los diferentes tipos de variables que se encuentran presentes en un ambiente de cultivos, permitiendo la aplicación de técnicas de minería de datos en grafos, como el emparejamiento de patrones en los mismos. En este artículo presentamos una visión general de las temáticas mencionadas y una propuesta de un sistema experto para enfermedades en cultivos, basado en emparejamiento de patrones en grafos.For agroindustry, crop diseases constitute one of the most common problems that generate large economic losses and low production quality. On the other hand, from computer science, several tools have emerged in order to improve the prevention and treatment of these diseases. In this sense, recent research proposes the development of expert systems to solve this problem, making use of data mining and artificial intelligence techniques like rule-based inference, decision trees, Bayesian network, among others. Furthermore, graphs can be used for storage of different types of variables that are present in an environment of crops, allowing the application of graph data mining techniques like graph pattern matching. Therefore, in this paper we present an overview of the above issues and a proposal of an expert system for crop disease based on graph pattern matching

A knowledge based system for linking information to support decision making in construction

This work describes the development of a project model centred on the information and knowledge generated and used by managers. It describes a knowledge-based system designed for this purpose. A knowledge acquisition exercise was undertaken to determine the tasks of project managers and the information necessary for and used by these tasks. This information was organised into a knowledge base for use by an expert system. The form of the knowledge lent itself to organisation into a link network. The structure of the knowledge-based system, which was developed, is outlined and its use described. Conclusions are drawn as to the applicability of the model and the final system. The work undertaken shows that it is feasible to benefit from the field of artificial intelligence to develop a project manager assistant computer program that utilises the benefit of information and its link

Interpretable Categorization of Heterogeneous Time Series Data

Understanding heterogeneous multivariate time series data is important in many applications ranging from smart homes to aviation. Learning models of heterogeneous multivariate time series that are also human-interpretable is challenging and not adequately addressed by the existing literature. We propose grammar-based decision trees (GBDTs) and an algorithm for learning them. GBDTs extend decision trees with a grammar framework. Logical expressions derived from a context-free grammar are used for branching in place of simple thresholds on attributes. The added expressivity enables support for a wide range of data types while retaining the interpretability of decision trees. In particular, when a grammar based on temporal logic is used, we show that GBDTs can be used for the interpretable classi cation of high-dimensional and heterogeneous time series data. Furthermore, we show how GBDTs can also be used for categorization, which is a combination of clustering and generating interpretable explanations for each cluster. We apply GBDTs to analyze the classic Australian Sign Language dataset as well as data on near mid-air collisions (NMACs). The NMAC data comes from aircraft simulations used in the development of the next-generation Airborne Collision Avoidance System (ACAS X).Comment: 9 pages, 5 figures, 2 tables, SIAM International Conference on Data Mining (SDM) 201

Classification

In Classification learning, an algorithm is presented with a set of classified examples or ‘‘instances’’ from which it is expected to infer a way of classifying unseen instances into one of several ‘‘classes’’. Instances have a set of features or ‘‘attributes’’ whose values define that particular instance. Numeric prediction, or ‘‘regression,’’ is a variant of classification learning in which the class attribute is numeric rather than categorical. Classification learning is sometimes called supervised because the method operates under supervision by being provided with the actual outcome for each of the training instances. This contrasts with Data clustering (see entry Data Clustering), where the classes are not given, and with Association learning (see entry Association Learning), which seeks any association – not just one that predicts the class

BowSaw: inferring higher-order trait interactions associated with complex biological phenotypes

Machine learning is helping the interpretation of biological complexity by enabling the inference and classification of cellular, organismal and ecological phenotypes based on large datasets, e.g. from genomic, transcriptomic and metagenomic analyses. A number of available algorithms can help search these datasets to uncover patterns associated with specific traits, including disease-related attributes. While, in many instances, treating an algorithm as a black box is sufficient, it is interesting to pursue an enhanced understanding of how system variables end up contributing to a specific output, as an avenue towards new mechanistic insight. Here we address this challenge through a suite of algorithms, named BowSaw, which takes advantage of the structure of a trained random forest algorithm to identify combinations of variables (“rules”) frequently used for classification. We first apply BowSaw to a simulated dataset, and show that the algorithm can accurately recover the sets of variables used to generate the phenotypes through complex Boolean rules, even under challenging noise levels. We next apply our method to data from the integrative Human Microbiome Project and find previously unreported high-order combinations of microbial taxa putatively associated with Crohn’s disease. By leveraging the structure of trees within a random forest, BowSaw provides a new way of using decision trees to generate testable biological hypotheses.Accepted manuscrip

A Comparative Study of the Application of Different Learning Techniques to Natural Language Interfaces

In this paper we present first results from a comparative study. Its aim is to test the feasibility of different inductive learning techniques to perform the automatic acquisition of linguistic knowledge within a natural language database interface. In our interface architecture the machine learning module replaces an elaborate semantic analysis component. The learning module learns the correct mapping of a user's input to the corresponding database command based on a collection of past input data. We use an existing interface to a production planning and control system as evaluation and compare the results achieved by different instance-based and model-based learning algorithms.Comment: 10 pages, to appear CoNLL9

Extracting more meaning from CAA results using machine learning

This work describes a novel approach to the problem of extracting knowledge from the results obtained via a CAA system by adopting a Machine Learning paradigm. The basic idea guiding our research was to investigate the existence of association rules among the topics covered in a course. The data used came from the exams administered to the freshmen in electronic engineering attending the course of Foundation of Computer Science at the University of Ancona. Ten Multiple Choice Questions with four possible answers constituted an exam. Questions have been classified according to the topic covered in a taxonomy derived from the course syllabus. Each question has an absolute weight representing its relative importance inside the curriculum. The data have been filtered by removing low-end and high-end achievers to obtain a subset containing information free from border effects. Each questionnaire has been coded into a vector of features (one for each element of the questions’ taxonomy) representing the student’s answers (right, wrong, not given). The feature vectors are further classified with respect to the final score obtained by the student (poor, average or good) and analysed using C4.5, a classification system based on top-down induction of decision trees that allows generating production rules. We classified the generated rules into three categories: “straightforward”, “reasonable” and “unexplainable”. Rules are considered “straightforward” when they put in relation topics that we believe are related. “Reasonable” rules put in relation topics that although not being predictable by our experience, may be understood after a deeper analysis of the questions. “Un-explainable” rules put in relation topics that do not appear to be related in any way. A first interesting result of the method discussed is represented by the so-called “reasonable rules” that may be used to better tune the teaching of the topics that appear to be related