检索结果-内蒙古大学图书馆

Brave induction: a logical framework for learning from incomplete information

MACHINE LEARNING 2009年第1期76卷 3-35页

作者： Sakama, Chiaki Inoue, Katsumi Wakayama Univ Dept Comp & Commun Sci Wakayama 6408510 Japan Res Org Informat & Syst Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan

This paper introduces a novel logical framework for concept-learning called brave induction. Brave induction uses brave inference for induction and is useful for learning from incomplete information. Brave induction is weaker than explanatory induction which is normally used in inductive logic programming, and is stronger than learning from satisfiability, a general setting of concept-learning in clausal logic. We first investigate formal properties of brave induction, then develop an algorithm for computing hypotheses in full clausal theories. Next we extend the framework to induction in nonmonotonic logic programs. We analyze computational complexity of decision problems for induction on propositional theories. Further, we provide examples of problem solving by brave induction in systems biology, requirement engineering, and multiagent negotiation.

关键词： Brave induction inductive logic programming Nonmonotonic logic programming

来源：评论

学校读者我要写书评

暂无评论

Using abduction and induction for operational requirements elaboration

引用

JOURNAL OF APPLIED logic 2009年第3期7卷 275-288页

作者： Alrajeh, D. Ray, O. Russo, A. Uchitel, S. Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England Univ Bristol Dept Comp Sci Bristol BS8 1UB Avon England Univ Buenos Aires Dept Computac RA-2160 Buenos Aires DF Argentina

Requirements Engineering involves the elicitation of high-level stakeholder goals and their refinement into operational system requirements. A key difficulty is that stakeholders typically convey their goals indirectly through intuitive narrative-style scenarios of desirable and undesirable system behaviour, whereas goal refinement methods usually require goals to be expressed declaratively using, for instance, a temporal logic. In actual software engineering practice, the extraction of formal requirements from scenario-based descriptions is a tedious and error-prone process that would benefit from automated tool support. This paper presents an inductive logic programming method for inferring operational requirements from a set of example scenarios and an initial but incomplete requirements specification. The approach is based on translating the specification and the scenarios into an event-based logic programming formalism and using a non-monotonic reasoning system, called eXtended Hybrid Abductive inductive Learning, to automatically infer a set of event pre-conditions and trigger-conditions that cover all desirable scenarios and reject all undesirable ones. This learning task is a novel application of logic programming to requirements engineering that also demonstrates the utility of non-monotonic learning capturing pre-conditions and trigger-conditions. (C) 2008 Elsevier B.V. All rights reserved.

关键词： inductive logic programming Abductive reasoning Goal-oriented requirements engineering Scenario-based specification Linear temporal logic Event Calculus

来源：评论

学校读者我要写书评

暂无评论

Robust Process Discovery with Artificial Negative Events

引用

JOURNAL OF MACHINE LEARNING RESEARCH 2009年第6期10卷 1305-1340页

作者： Goedertier, Stijn Martens, David Vanthienen, Jan Baesens, Bart Katholieke Univ Leuven Fac Business & Econ Louvain Belgium Assoc Ghent Univ Univ Coll Ghent Dept Business Adm & Publ Management Ghent Belgium Univ Southampton Sch Management Southampton SO9 5NH Hants England

Process discovery is the automated construction of structured process models from information system event logs. Such event logs often contain positive examples only. Without negative examples, it is a challenge to strike the right balance between recall and specificity, and to deal with problems such as expressiveness, noise, incomplete event logs, or the inclusion of prior knowledge. In this paper, we present a configurable technique that deals with these challenges by representing process discovery as a multi-relational classification problem on event logs supplemented with Artificially Generated Negative Events (AGNEs). This problem formulation allows using learning algorithms and evaluation techniques that are well-know in the machine learning community. Moreover, it allows users to have a declarative control over the inductive bias and language bias.

关键词： graph pattern discovery inductive logic programming Petri net process discovery positive data only

来源：评论

学校读者我要写书评

暂无评论

Predicting functional upstream open reading frames in Saccharomyces cerevisiae

引用

BMC BIOINFORMATICS 2009年第1期10卷 1-10页

作者： Selpi Bryant, Christopher H. Kemp, Graham J. L. Sarv, Janeli Kristiansson, Erik Sunnerhagen, Per Chalmers Dept Appl Mech SE-41296 Gothenburg Sweden Univ Salford Sch Comp Sci & Engn Salford M5 4WT Lancs England Chalmers Dept Comp Sci & Engn SE-41296 Gothenburg Sweden Chalmers Dept Math Sci SE-41296 Gothenburg Sweden Univ Gothenburg SE-41296 Gothenburg Sweden Univ Gothenburg Dept Zool SE-40530 Gothenburg Sweden Univ Gothenburg Dept Cell & Mol Biol Lundberg Lab SE-40530 Gothenburg Sweden

Background: Some upstream open reading frames (uORFs) regulate gene expression (i.e., they are functional) and can play key roles in keeping organisms healthy. However, how uORFs are involved in gene regulation is not yet fully understood. In order to get a complete view of how uORFs are involved in gene regulation, it is expected that a large number of experimentally verified functional uORFs are needed. Unfortunately, wet-experiments to verify that uORFs are functional are expensive. Results: In this paper, a new computational approach to predicting functional uORFs in the yeast Saccharomyces cerevisiae is presented. Our approach is based on inductive logic programming and makes use of a novel combination of knowledge about biological conservation, Gene Ontology annotations and genes' responses to different conditions. Our method results in a set of simple and informative hypotheses with an estimated sensitivity of 76%. The hypotheses predict 301 further genes to have 398 novel functional uORFs. Three (RPC11, TPK1, and FOL1) of these 301 genes have been hypothesised, following wet-experiments, by a related study to have functional uORFs. A comparison with another related study suggests that eleven of the predicted functional uORFs from genes LDB17, HEM3, CIN8, BCK2, PMC1, FAS1, APP1, ACC1, CKA2, SUR1, and ATH1 are strong candidates for wet-lab experimental studies. Conclusions: Learning based prediction of functional uORFs can be done with a high sensitivity. The predictions made in this study can serve as a list of candidates for subsequent wet-lab verification and might help to elucidate the regulatory roles of uORFs.

关键词： inductive logic programming Gene Ontology Annotation Certainty Factor Saccharomyces Genome Database Upstream Open Reading Frame

来源：评论

学校读者我要写书评

暂无评论

Intralesional laser treatment of voluminous vascular lesions in the oral cavity

引用

ORAL SURGERY ORAL MEDICINE ORAL PATHOLOGY ORAL RADIOLOGY AND ENDODONTOLOGY 2009年第2期107卷 164-172页

作者： Miyazaki, Hidetaka Kato, Junji Watanabe, Hisashi Harada, Hiroyuki Kakizaki, Hirohiko Tetsumura, Akemi Sato, Akio Omura, Ken Tokyo Med & Dent Univ Grad Sch Dept Oral Restitut Div Oral Hlth SciBunkyo Ku Tokyo 1138549 Japan Tokyo Dent Coll Dept Operat Dent Tokyo Japan Tokyo Med & Dent Univ Grad Sch Dept Hard Tissue Engn Tokyo 1138549 Japan Aichi Med Univ Dept Ophthalmol Aichi Japan Tokyo Mem Clin Hirayama Tokyo Japan

Objective. In laser treatment of voluminous vascular lesions, there are many cases in which submucosally located angioma remnants cannot be reached by noncontact superficial laser application. To diminish these remnants we used intralesional photocoagulation (ILP) in treatment of oral vascular lesions, because this approach is effective in treatment of voluminous vascular lesions of the skin. Study design. Four cases of voluminous vascular malformation in the oral cavity were treated by ILP using a potassium-titanyl-phosphate (KTP) laser. In 1 case, treatment was carried out under ultrasound and manual control. Results. All lesions showed more than 70% regression after the first ILP session, and the treatment outcome was satisfactory. There were no serious complications, such as bleeding or invasive infection. Ultrasonography was useful for guiding laser treatment in the oral cavity. Conclusion. Intralesional photocoagulation treatment with a KTP laser is effective and safe for treatment of a vascular lesion in the oral cavity. (Oral Surg Oral Med Oral Pathol Oral Radiol Endod 2009;107: 164-172)

关键词： therapeutic aspects Lesion NOS Blood vascular Lasers 激光 Light Coagulation inductive logic programming vascular lesion Treatment Outcome Potassium Titanyl Phosphate Lasers Lesions Mouth Laser Laser Therapy NOT OTHERWISE SPECIFIED

来源：评论

学校读者我要写书评

暂无评论

Fuzzy inductive logic programming: Learning fuzzy rules with their implication

Fuzzy inductive logic programming: Learning fuzzy rules with...

引用

IEEE International Conference on Fuzzy Systems

作者： Serrurier, M Sudkamp, T Dubois, D Prade, H Univ Toulouse 3 IRIT F-31062 Toulouse France

ISBN: (纸本)0780391586

inductive logic programming (ILP) is a generic tool aiming at learning rules from relational databases. Introducing fuzzy sets and fuzzy implication connectives in this framework allows us to increase the expressive power of the induced rules while keeping the readability of the rules. Moreover, fuzzy sets facilitate the handling of numerical attributes by avoiding crisp and arbitrary transitions between classes. In this paper, the meaning of a fuzzy rule is encoded by its implication operator, which is to be determined in the learning process. An algorithm is proposed for inducing first order rules having fuzzy predicates, together with the most appropriate implication operator. The benefits of introducing fuzzy logic in ILP and the validation process of what has been learnt are discussed and illustrated on a benchmark.

关键词： Implication inductive logic programming Fuzzy rules Fuzzy Learning

来源：评论

学校读者我要写书评

暂无评论

Drugs and Drug-Like Compounds: Discriminating Approved Pharmaceuticals from Screening-Library Compounds

Drugs and Drug-Like Compounds: Discriminating Approved Pharm...

引用

4th International Conference Pattern Recognition in Bioinformatics

作者： Schierz, Amanda C. King, Ross D. Bournemouth Univ Software Syst Res Grp Poole HouseTalbot Campus Poole BH12 5BB Dorset England Aberystwyth Univ Computat Biol Res Grp Aberystwyth SY23 3DB Dyfed Wales

ISBN: (纸本)9783642040306

Compounds in drug screening-libraries should resemble pharmaceuticals. To operationally test this, we analysed the compounds in terms of known drug-like filters and developed a novel machine learning method to discriminate approved pharmaceuticals from "drug-like" compounds. This method uses both structural features and molecular properties for discrimination. The method has an estimated accuracy of 91% in discriminating between the Maybridge Hit-Finder library and approved pharmaceuticals, and 99% between the NATDiverse collection (from Analyticon Discovery) and approved pharmaceuticals. These results show that Lipinski's Rule of 5 for oral absorption is not Sufficient to describe "drug-likeness" and be the main basis of screening-library design.

关键词： inductive logic programming drug-likeness machine learning Rule of 5 compound screening library

来源：评论

学校读者我要写书评

暂无评论

Visually Guiding and Controlling the Search While Mining Chemical Structures

引用

10th International Work-Conference on Artificial Neural Networks (IWANN 2009)

作者： Pereira, Max Costa, Vitor Santos Camacho, Rui Fonseca, Nuno A. Univ Porto LIAAD INESC Porto LA & FEUP Rua Dr Roberto Frias S-N P-4200465 Oporto Portugal Univ Porto CRACS INSEC Porto LA Porto Portugal Univ Porto Inst Biol Mol Celuar Porto Portugal

ISBN: (纸本)9783642024801

In this paper we present the work in progress on LogCHEM, an ILP based tool for discriminative interactive mining of chemical fragments. In particular, we describe the integration with a molecule visualisation software that allows the chemist to graphically control the search for interesting patterns in chemical fragments. Furthermore, we show how structured information, such as rings, functional groups like carboxyl, amine, methyl, ester, etc are integrated and exploited in LogCHEM.

关键词： inductive logic programming drug design

来源：评论

学校读者我要写书评

暂无评论

Induction on Failure: Learning Connected Horn Theories

引用

10th International Conference on logic programming and Nonmonotonic Reasoning

作者： Kimber, Tim Broda, Krysia Russo, Alessandra Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England

ISBN: (纸本)9783642042379

Several learning systems based on Inverse Entailment (IE) have been proposed, some that compute single clause hypotheses, exemplified by Progol, and others that, produce multiple clauses in response to a single seed example. A common denominator of these systems, is a restricted hypothesis search space, within which each clause must individually explain some example E, or some member of an abductive explanation for E. This paper proposes a new IE approach, called Induction on Failure (IoF), that generalises existing Horn clause learning systems by allowing the computation of hypotheses within a larger search space, namely that of Connected Theories. A proof procedure for IoF is proposed that generalises existing IE systems and also resolves Yamamoto's example. A prototype implementation is also described. Finally, a semantics is presented called Connected Theory Generalisation, which is proved to extend Kernel Set Subsumption and to include hypotheses constructed within this new IoF approach.

关键词： inductive logic programming Inverse Entailment Abduction

来源：评论

学校读者我要写书评

暂无评论

Learning ontological rules to extract multiple relations of genic interactions from text

引用

INTERNATIONAL JOURNAL OF MEDICAL INFORMATICS 2009年第12期78卷 E31-E38页

作者： Manine, Alain-Pierre Alphonse, Erick Bessieres, Philippe Univ Paris 13 Inst Galilee Lab Informat Paris Nord CNRSLIPNUMR7030 F-93430 Villetaneuse France INRA Unite Math Informat & Genome MIG UR1077 F-78352 Jouy En Josas France

Introduction: Information extraction (IE) systems have been proposed in recent years to extract genic interactions from bibliographical resources. They are limited to single interaction relations, and have to face a trade-off between recall and precision, by focusing either on specific interactions (for precision), or general and unspecified interactions of biological entities (for recall). Yet, biologists need to process more complex data from literature, in order to study biological pathways. An ontology is an adequate formal representation to model this sophisticated knowledge. However, the tight integration of IE systems and ontologies is still a current research issue, a fortiori with complex ones that go beyond hierarchies. Method: We propose a rich modeling of genic interactions with an ontology, and show how it can be used within an IE system. The ontology is seen as a language specifying a normalized representation of text. First, IE is performed by extracting instances from natural language processing (NLP) modules. Then, deductive inferences on the ontology language are completed, and new instances are derived from previously extracted ones. Inference rules are learnt with an inductive logic programming (ILP) algorithm, using the ontology as the hypothesis language, and its instantiation on an annotated corpus as the example language. Learning is set in a multi-class setting to deal with the multiple ontological relations. Results: We validated our approach on an annotated corpus of gene transcription regulations in the Bacillus subtilis bacterium. We reach a global recall of 89.3% and a precision of 89.6%, with high scores for the ten semantic relations defined in the ontology. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Information Extraction Ontology Machine Learning Genic Interactions inductive logic programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：