117 research outputs found

    Learning DFA for Simple Examples

    Get PDF
    We present a framework for learning DFA from simple examples. We show that efficient PAC learning of DFA is possible if the class of distributions is restricted to simple distributions where a teacher might choose examples based on the knowledge of the target concept. This answers an open research question posed in Pitt\u27s seminal paper: Are DFA\u27s PAC-identifiable if examples are drawn from the uniform distribution, or some other known simple distribution? Our approach uses the RPNI algorithm for learning DFA from labeled examples. In particular, we describe an efficient learning algorithm for exact learning of the target DFA with high probability when a bound on the number of states (N) of the target DFA is known in advance. When N is not known, we show how this algorithm can be used for efficient PAC learning of DFAs

    Data-Driven Theory Refinement Algorithms for Bioinformatics

    Get PDF
    Bioinformatics and related applications call for efficient algorithms for knowledge intensive learning and data driven knowledge refinement. Knowledge based artificial neural networks offer an attractive approach to extending or modifying incomplete knowledge bases or domain theories. We present results of experiments with several such algorithms for data driven knowledge discovery and theory refinement in some simple bioinformatics applications. Results of experiments on the ribosome binding site and promoter site identification problems indicate that the performance of KBDistAl and Tiling Pyramid algorithms compares quite favorably with those of substantially more computationally demanding techniques

    Unilateral prurigo nodularis: a rare presentation

    Get PDF
    Prurigo Nodularis (PN) is a rare chronic skin disorder of unknown etiology. Here we are describing a case of 14 year old girl having prurigo nodularis with no other systemic illness

    Global, regional, and national sex-specific burden and control of the HIV epidemic, 1990-2019, for 204 countries and territories: the Global Burden of Diseases Study 2019

    Get PDF
    Background: The sustainable development goals (SDGs) aim to end HIV/AIDS as a public health threat by 2030. Understanding the current state of the HIV epidemic and its change over time is essential to this effort. This study assesses the current sex-specific HIV burden in 204 countries and territories and measures progress in the control of the epidemic. Methods: To estimate age-specific and sex-specific trends in 48 of 204 countries, we extended the Estimation and Projection Package Age-Sex Model to also implement the spectrum paediatric model. We used this model in cases where age and sex specific HIV-seroprevalence surveys and antenatal care-clinic sentinel surveillance data were available. For the remaining 156 of 204 locations, we developed a cohort-incidence bias adjustment to derive incidence as a function of cause-of-death data from vital registration systems. The incidence was input to a custom Spectrum model. To assess progress, we measured the percentage change in incident cases and deaths between 2010 and 2019 (threshold >75% decline), the ratio of incident cases to number of people living with HIV (incidence-to-prevalence ratio threshold <0·03), and the ratio of incident cases to deaths (incidence-to-mortality ratio threshold <1·0). Findings: In 2019, there were 36·8 million (95% uncertainty interval [UI] 35·1–38·9) people living with HIV worldwide. There were 0·84 males (95% UI 0·78–0·91) per female living with HIV in 2019, 0·99 male infections (0·91–1·10) for every female infection, and 1·02 male deaths (0·95–1·10) per female death. Global progress in incident cases and deaths between 2010 and 2019 was driven by sub-Saharan Africa (with a 28·52% decrease in incident cases, 95% UI 19·58–35·43, and a 39·66% decrease in deaths, 36·49–42·36). Elsewhere, the incidence remained stable or increased, whereas deaths generally decreased. In 2019, the global incidence-to-prevalence ratio was 0·05 (95% UI 0·05–0·06) and the global incidence-to-mortality ratio was 1·94 (1·76–2·12). No regions met suggested thresholds for progress. Interpretation: Sub-Saharan Africa had both the highest HIV burden and the greatest progress between 1990 and 2019. The number of incident cases and deaths in males and females approached parity in 2019, although there remained more females with HIV than males with HIV. Globally, the HIV epidemic is far from the UNAIDS benchmarks on progress metrics. Funding: The Bill & Melinda Gates Foundation, the National Institute of Mental Health of the US National Institutes of Health (NIH), and the National Institute on Aging of the NIH

    Causes of blindness and vision impairment in 2020 and trends over 30 years, and prevalence of avoidable blindness in relation to VISION 2020: the Right to Sight: an analysis for the Global Burden of Disease Study

    Get PDF
    Background: Many causes of vision impairment can be prevented or treated. With an ageing global population, the demands for eye health services are increasing. We estimated the prevalence and relative contribution of avoidable causes of blindness and vision impairment globally from 1990 to 2020. We aimed to compare the results with the World Health Assembly Global Action Plan (WHA GAP) target of a 25% global reduction from 2010 to 2019 in avoidable vision impairment, defined as cataract and undercorrected refractive error. Methods: We did a systematic review and meta-analysis of population-based surveys of eye disease from January, 1980, to October, 2018. We fitted hierarchical models to estimate prevalence (with 95% uncertainty intervals [UIs]) of moderate and severe vision impairment (MSVI; presenting visual acuity from <6/18 to 3/60) and blindness (<3/60 or less than 10° visual field around central fixation) by cause, age, region, and year. Because of data sparsity at younger ages, our analysis focused on adults aged 50 years and older. Findings: Global crude prevalence of avoidable vision impairment and blindness in adults aged 50 years and older did not change between 2010 and 2019 (percentage change −0·2% [95% UI −1·5 to 1·0]; 2019 prevalence 9·58 cases per 1000 people [95% IU 8·51 to 10·8], 2010 prevalence 96·0 cases per 1000 people [86·0 to 107·0]). Age-standardised prevalence of avoidable blindness decreased by −15·4% [–16·8 to −14·3], while avoidable MSVI showed no change (0·5% [–0·8 to 1·6]). However, the number of cases increased for both avoidable blindness (10·8% [8·9 to 12·4]) and MSVI (31·5% [30·0 to 33·1]). The leading global causes of blindness in those aged 50 years and older in 2020 were cataract (15·2 million cases [9% IU 12·7–18·0]), followed by glaucoma (3·6 million cases [2·8–4·4]), undercorrected refractive error (2·3 million cases [1·8–2·8]), age-related macular degeneration (1·8 million cases [1·3–2·4]), and diabetic retinopathy (0·86 million cases [0·59–1·23]). Leading causes of MSVI were undercorrected refractive error (86·1 million cases [74·2–101·0]) and cataract (78·8 million cases [67·2–91·4]). Interpretation: Results suggest eye care services contributed to the observed reduction of age-standardised rates of avoidable blindness but not of MSVI, and that the target in an ageing global population was not reached. Funding: Brien Holden Vision Institute, Fondation Théa, The Fred Hollows Foundation, Bill & Melinda Gates Foundation, Lions Clubs International Foundation, Sightsavers International, and University of Heidelberg

    Efficient Learning of Regular Languages Using Teacher-Supplied Positive Samples and Learner-Generated Queries

    Get PDF
    We present a new algorithm for efficient learning of regular languages from examples and queries. A reliable teacher who knows the unknown regular grammar G (or is able to determine if certain strings are accepted by the grammar) will guide the learner in achieving the goal of inferring an equivalent grammar G . The teacher provides the learner with a structurally complete set of positive examples belonging to the unknown grammar G. Using this information the learner constructs a canonical automaton which accepts exactly those examples. The canonical automaton defines a set of grammars which are ordered on a lattice to form the hypothesis space. A bi-directional search algorithm is used to systematically search the lattice for the solution G . While searching for the solution, the learner interacts with the teacher by posing queries. The teacher&apos;s responses enable the learner to eliminate one or more points on the lattice which do not correspond to the correct solution. A..

    Re: Dr. Richard Sackler at Purdue Pharma...update

    No full text

    Constructive learning: inducing grammars and neural networks

    No full text
    This dissertation focuses on two important areas of machine learning research--regular grammar inference and constructive neural network learning algorithms;Regular grammar inference is the process of learning a target regular grammar or equivalently a deterministic finite state automaton (DFA) from labeled examples. We focus on the design of efficient algorithms for learning DFA where the learner is provided with a representative set of examples for the target concept and additionally might be guided by a teacher who answers membership queries. DFA learning algorithms typically map a given structurally complete set of examples to a lattice of finite state automata. Explicit enumeration of this lattice is practically infeasible. We propose a framework for implicitly representing the lattice as a version space and design a provably correct search algorithm for identifying the target DFA. Incremental or online learning algorithms are important in scenarios where all the training examples might not be available to the learner at the start. We develop a provably correct polynomial time incremental algorithm for learning DFA from labeled examples and membership queries. PAC learnability of DFA under restricted classes of distributions is an open research problem. We solve this problem by proving that DFA are efficiently PAC learnable under the class of simple distributions;Constructive neural network learning algorithms offer an interesting approach for incremental construction of near minimal neural network architectures for pattern classification and inductive knowledge acquisition. The existing constructive learning algorithms were designed for two category pattern classification and assumed that the patterns have binary (or bipolar) valued attributes. We propose a framework for extending constructive learning algorithms to handle multiple output classes and real-valued attributes. Further, with carefully designed experimental studies we attempt to characterize the inductive bias of these algorithms. Owing to the limited training time and the inherent representational bias, these algorithms tend to construct networks with redundant elements. We develop pruning strategies for elimination of redundant neurons in MTiling based constructive networks. Experimental results show that pruning brings about a modest to significant reduction in network size. Finally, we demonstrate the applicability of constructive learning algorithms in the area of connectionist theory refinement.</p

    Learning DFA from Simple Examples

    No full text
    We present a framework for learning DFA from simple examples. We show that efficient PAC learning of DFA is possible if the class of distributions is restricted to simple distributions where a teacher might choose examples based on the knowledge of the target concept. This answers an open research question posed in Pitt&apos;s seminal paper: Are DFA&apos;s PAC-identifiable if examples are drawn from the uniform distribution, or some other known simple distribution?. Our approach uses the RPNI algorithm for learning DFA from labeled examples. In particular, we describe an efficient learning algorithm for exact learning of the target DFA with high probability when a bound on the number of states (N) of the target DFA is known in advance. When N is not known, we show how this algorithm can be used for efficient PAC learning of DFAs. 1 Introduction The problem of learning a DFA with the smallest number of states that is consistent with a given sample (i.e., the DFA accepts each positive example an..
    corecore