1,465 research outputs found
A method of rule induction for predicting and describing future alarms in a telecommunication network
In order to gain insights into events and issues that may cause alarms in parts of IP networks, intelligent methods that capture and express causal relationships are needed. Methods that are predictive and descriptive are rare and those that do predict are often limited to using a single feature from a vast data set. This paper follows the progression of a Rule Induction Algorithm that produces rules with strong causal links that are both descriptive and predict events ahead of time. The algorithm is based on an information theoretic approach to extract rules comprising of a conjunction of network events that are significant prior to network alarms. An empirical evaluation of the algorithm is provided
Apprentissage Multi Agent aĢ MeĢmoire BorneĢe
National audienceNous abordons ici l'apprentissage superviseĢ en ligne collaboratif dans une socieĢteĢ d'agents. La deĢmarche adopteĢe est celle du maintien collectif d'une notion de consistance, ici correspondant au maintien, par reĢvision de l'hypotheĢse courante, d'une hypotheĢse d'erreur empirique nulle. L'hypotheĢse prend la forme d'une formule de taille reĢduite et la reĢvision repose sur les exemples meĢmoriseĢs. Lors de preĢceĢdents travaux, dans le cadre du projet SMILE, tous les exemples rencontreĢs par un agent, plus ceux transmis par d'autres agents, eĢtaient meĢmoriseĢs. Dans le travail preĢsenteĢ ici, chaque agent a une meĢmoire borneĢe, limitant ainsi le nombre d'exemples maintenus dans la meĢmoire de chaque agent. Nous proposons une adaptation du meĢcanisme de reĢvision collective de SMILE prenant en compte cette restriction. Plusieurs variantes de ce meĢcanisme, se diffeĢrenciant en particulier selon la meĢthode utiliseĢe par les agents pour geĢrer leur meĢmoire, sont exploreĢes expeĢrimentalement. Nous observons alors dans quelle mesure ces restrictions en meĢmoire peuvent eĢtre deĢpasseĢes reĢsultant parfois de manieĢre surprenante en une erreur en test plus faible que sans ces restrictions
A survey of cost-sensitive decision tree induction algorithms
The past decade has seen a significant interest on the problem of inducing decision trees that take account of costs of misclassification and costs of acquiring the features used for decision making. This survey identifies over 50 algorithms including approaches that are direct adaptations of accuracy based methods, use genetic algorithms, use anytime methods and utilize boosting and bagging. The survey brings together these different studies and novel approaches to cost-sensitive decision tree learning, provides a useful taxonomy, a historical timeline of how the field has developed and should provide a useful reference point for future research in this field
Automatically evolving rule induction algorithms with grammar-based genetic programming
In the last 30 years, research in the field of rule induction algorithms produced a large number of algorithms. However, these algorithms are usually obtained from the combination of a basic rule induction algorithm (typically following the sequential covering approach) with new evaluation functions, pruning methods and stopping criteria for refining or producing rules, generating many "new" and more sophisticated sequential covering algorithms. We cannot deny that these attempts to improve the basic sequential covering approach have succeeded. Hence, if manually changing these major components of rule induction algorithms can result in new, significantly better ones, why not to automate this process to make it more cost-effective? This is the core idea of this work: to automate the process of designing rule induction algorithms by means of grammar-based genetic programming. Grammar-based Genetic Programming (GGP) is a special type of evolutionary algorithm used to automatically evolve computer programs. The most interesting feature of this type of algorithm is that it incorporates a grammar into its search mechanism, which expresses prior knowledge about the problem being solved. Since we have a lot of previous knowledge about how humans design rule induction algorithms, this type of algorithm is intuitively a suitable tool to automatically evolve rule induction algorithms. The grammar given to the proposed GGP system includes knowledge about how humans- design rule induction algorithms, and also presents some new elements which could work in rule induction algorithms, but to the best of our knowledge were not previously tested. The GG P system aims to evolve rule induction algorithms under two different frameworks, as follows. In the first framework, the GGP is used to evolve robust rule induction algorithms, i.e., algorithms which were designed to be applied to virtually any classification data set, like a manually-designed rule induction algorithm. In the second framework, the GGP is applied to evolve rule induction algorithms tailored to a specific application XVI domain, i.e., rule induction algorithms tailored to a single data set. Note that the latter framework is hardly feasible on a hard scale in the case of conventional, manually-designed algorithms, since the number of classification data sets greatly outnumbers the number of rule induction algorithms designers. However, it is clearly feasible on a large scale when using the proposed system, which automates the process of rule induction algorithm design and implementation. Overall, extensive computational experiments with 20 VCI data sets and 5 bioinformatics data sets showed that effective rule induction algorithms can be automatically generated using the GGP in both frameworks. Moreover, the automatically evolved rule induction algorithms were shown to be competitive with (and overall slightly better than) four well-known manually designed rule induction algorithms when comparing their predictive accuracies. The proposed GGP system was also compared to a grammar-based hillclimbing system, and experimental results showed that the GGP system is a more effective method to evolve rule induction algorithms than the grammar-based hillclimbing method. At last, a multi-objective version of the GGP (based on the concept of Pareto dominance) was also proposed, and experiments were performed to evolve robust rule induction algorithms which generate both accurate and simple models. The results showed that in most of the cases the GGP system can produce rule induction algorithms which are competitive in predictive accuracy to wellknown human-designed rule induction algorithms, but generate simpler classification modes - i.e., smaller rule sets, intuitively easier to be interpreted by the user
Computer Aided Verification
This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency
Computer Aided Verification
This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency
(Re)presentations of Disability: Images of Persons with Down Syndrome
Disabled people have been misrepresented by mass media for decades. The result of disability misrepresentation is the perpetuation of negative disability stereotypes and models of disability. Disability representation has rarely been informed by authentic first-hand knowledge about what disability is and who disabled people are. As such, representations of disability have been formed from an outsider perspective most commonly based on ableism. This study seeks to explore the ways in which disabled people choose to represent themselves and if this representation is consistent with or resistant to dominant disability narratives. Borrowing from Critical Disability Studies and the concept of disability life writing, this study utilized qualitative content analysis to analyze the visual images, comments, and hashtags of randomly selected data posted to four publicly accessible Instagram accounts. Findings show disabled people choose to represent themselves in ways that resist dominant disability narratives, allowing for expanded ideas of what disability is and who disabled people are
- ā¦