Formal Ontology Construction from Texts

Size: px
Start display at page:

Download "Formal Ontology Construction from Texts"

Transcription

1 Formal Ontology Construction from Texts Yue MA Theoretical Computer Science Faculty Informatics TU Dresden June 16, 2014

2 Outline 1 Introduction Ontology: definition and examples 2 Ontology Construction Learning Formal Definitions

3 Web Development Tendency [Nova Spivack 2008]

4 Semantically Annotated Documents

5 Query on Annotated Documents w.r.t. Ontology

6 Questions How to answer queries given semantic labels? How to obtain semantic labels? How to have the underlying semantic model (ontology)?

7 Questions How to answer queries given semantic labels? How to obtain semantic labels? How to have the underlying semantic model (ontology)?

8 Questions How to answer queries given semantic labels? How to obtain semantic labels? How to have the underlying semantic model (ontology)?

9 Questions How to answer queries given semantic labels? natural language level: semantic search formal level: ontology-based data access How to obtain semantic labels? How to have the underlying semantic model (ontology)?

10 Questions How to answer queries given semantic labels? natural language level: semantic search formal level: ontology-based data access How to obtain semantic labels? ontology-based semantic annotation of texts How to have the underlying semantic model (ontology)?

11 Questions How to answer queries given semantic labels? natural language level: semantic search formal level: ontology-based data access How to obtain semantic labels? ontology-based semantic annotation of texts How to have the underlying semantic model (ontology)? Ontology construction (from texts and/or semi-structured data)

12 Outline 1 Introduction Ontology: definition and examples 2 Ontology Construction Learning Formal Definitions

13

14

15

16

17

18

19

20

21

22

23

24

25

26 Biomedical Ontologies: SNOMED, Gene Ontology, MeSH

27 Biomedical Ontologies: SNOMED, Gene Ontology, MeSH Not only a hierarchy!

28 SNOMED A medical ontology Computer processable medical terms (diseases, findings, microorganisms, etc.) Consistent way to index and aggregate clinical data Electronic health records to improve patient care A formal ontology In DL (Description Logic): EL Improve modeling by reasoning (e.g. finding errors) Semantic query answering (by exploiting deeper logical consequences)

29 How SNOMED Looks Like for Medical People Current Concept: Fully Specified Name: Baritosis (disorder) ConceptId: Defining Relationships: Is a Causative agent Associated morphology Finding site Associated with Metal pneumoconiosis Occupational lung disease Barium dust Barium Deposition of foreign material Deposition Lung structure (body structure) Barium dust This concept is fully defined. Descriptions (Synonyms): Synonym: Barium lung [ ]

30 Formal Definition and Its Generation from Text Baritosis Finding_site. Lung_structure

31 Formal Definition and Its Generation from Text Baritosis Finding_site. Lung_structure A r.b x A(x) y r(x, y) B(y)

32 Formal Definition and Its Generation from Text Baritosis Causative_agent. Barium_dust Finding_site. Lung_structure

33 Formal Definition and Its Generation from Text Baritosis Associated_morphology. Deposition_of _foreign_material Causative_agent. Barium_dust Finding_site. Lung_structure

34 Formal Definition and Its Generation from Text Baritosis Occupational_lung_disease Associated_morphology. Deposition_of _foreign_material Causative_agent. Barium_dust Finding_site. Lung_structure

35 Formal Definition and Its Generation from Text Baritosis Metal_pneumoconiosis Occupational_lung_disease Associated_morphology. Deposition_of _foreign_material Causative_agent. Barium_dust Finding_site. Lung_structure

36 Formal Definition and Its Generation from Text Baritosis Metal_pneumoconiosis Occupational_lung_disease Associated_morphology. Deposition_of _foreign_material Causative_agent. Barium_dust Finding_site. Lung_structure

37 Formal Definition and Its Generation from Text Baritosis Causative_agent. Barium_dust A r.b

38 Formal Definition and Its Generation from Text Baritosis Causative_agent. Barium_dust A r.b A B Baritosis is... caused by long-term exposure to barium dust.

39 Formal Definition and Its Generation from Text [Ma and Distel 13a, 13b, 13c; Tsatsaronis et al. 13; Petrova et al. 14] Baritosis Causative_agent. Barium_dust A r.b A? r (r {r 1, r 2,...r n }) B Baritosis is... caused by long-term exposure to barium dust.

40 Formal Definition and Its Generation from Text [Ma and Distel 13a, 13b, 13c; Tsatsaronis et al. 13; Petrova et al. 14] Baritosis Causative_agent. Barium_dust A r.b A? r (r {r 1, r 2,...r n }) B Baritosis is... caused by long-term exposure to barium dust. Baritosis Causative_agent.Barium_dust

41 More Sentences for Extracting Formal Definitions Baritosis is a benign type of pneumoconiosis, which is caused by long-term exposure to barium dust. Baritosis are nonfibrotic forms of pneumoconiosis that result from inhalation of iron oxide. Baritosis is one of the benign pneumoconiosis in which inhaled particulate matter lies in the lungs for years. Baritosis is due to inorganic dust lies in the lungs.

42 More Sentences for Extracting Formal Definitions Baritosis is a benign type of pneumoconiosis, which is caused by long-term exposure to barium dust. Baritosis are nonfibrotic forms of pneumoconiosis that result from inhalation of iron oxide. Baritosis is one of the benign pneumoconiosis in which inhaled particulate matter lies in the lungs for years. Baritosis is due to inorganic dust lies in the lungs. Exercises: try to write down the formal definitions extractable from these sentences

43 More Sentences for Extracting Formal Definitions Baritosis is a benign type of pneumoconiosis, which is caused by long-term exposure to barium dust. Baritosis are nonfibrotic forms of pneumoconiosis that result from inhalation of iron oxide. Baritosis is one of the benign pneumoconiosis in which inhaled particulate matter lies in the lungs for years. Baritosis is due to inorganic dust lies in the lungs. Exercises: try to write down the formal definitions extractable from these sentences Baritosis is... caused by long-term exposure to barium dust. Baritosis Causative_agent.Barium_dust

44 Table : Statistics of relationships about diseases in SNOMED #IsA #(NonIsA) #(NonIsA and Only3Relations) Total 17, , , , 395

45 Outline 1 Introduction Ontology: definition and examples 2 Ontology Construction Learning Formal Definitions

46 Outline 1 Introduction Ontology: definition and examples 2 Ontology Construction Learning Formal Definitions

47 Ontology Construction Manual, hence costly 830 terms (avg.) = 5.3 person months [Bontas, ISWC06] SNOMED 311, 000 concepts = 165 person years Automatic, from textual data Existing (un)structured data + New publications Formal definitions of new concepts

48 Existing Approaches Proposed: linguistic pattern based [Völker, 2009] Reviewer: a person who reviews a paper submitted to a conference Person reviews_a_paper_submitted_to_a_conference Person Reviews. a_paper_submitted_to_a_conference Person Reviews. (Paper Submitted_to. Conference)

49 Existing Approaches Proposed: linguistic pattern based [Völker, 2009] Reviewer: a person who reviews a paper submitted to a conference Person reviews_a_paper_submitted_to_a_conference Person Reviews. a_paper_submitted_to_a_conference Person Reviews. (Paper Submitted_to. Conference)

50 Existing Approaches Proposed: linguistic pattern based [Völker, 2009] Reviewer: a person who reviews a paper submitted to a conference Person reviews_a_paper_submitted_to_a_conference Person Reviews. a_paper_submitted_to_a_conference Person Reviews. (Paper Submitted_to. Conference)

51 Existing Approaches Proposed: linguistic pattern based [Völker, 2009] Reviewer: a person who reviews a paper submitted to a conference Person reviews_a_paper_submitted_to_a_conference Person Reviews. a_paper_submitted_to_a_conference Person Reviews. (Paper Submitted_to. Conference)

52 Existing Approaches Problems: Linguistic pattern: word variant problem? e.g. caused by, due to, result from,... Caused_by, Due_to, Result_from,... Causative_agent (NO!) (YES!) Dictionary: exhaustive, context-based disambiguation?

53 Our Approach Observations of SNOMED: Role set is relatively stable New concepts are increasing 61 roles, > 311, 000 concepts, > 1, 360, 000 relationships

54 Our Approach AM: Associated_morphology; CA: Causative_agent; FS: Finding_site Role Relationship example DL format AM (Parulis, Abscess) Parulis AM.Abscess CA (Rabies, Rabies_virus) Rabies CA.Rabies_virus FS (Headache, Head_structure) Headache FS.Head_structure

55 Our Approach AM: Associated_morphology; CA: Causative_agent; FS: Finding_site Role Relationship example DL format AM (Parulis, Abscess) Parulis AM.Abscess CA (Rabies, Rabies_virus) Rabies CA.Rabies_virus FS (Headache, Head_structure) Headache FS.Head_structure Intuition of our approach: 1 Learn a probabilistic model for SNOMED roles 2 Predict relationships for new concepts as definition candidates 3 Build EL definitions by selecting reliable candidates

56 Our Approach Relation extraction based approach: A machine learning approach Supervision by a knowledge base Input 1: large textual data (e.g. wikipedia articles, textbooks, PubMed abstracts) Input 2: large number of SNOMED relationships (e.g. (Rabies, Rabies_virus): Causative_agent ) Output: relationship suggestions for concepts to be defined (C tbd, A): r of weight w C tbd r.a of weight w SNOMED Supervision for EL Definition Extraction

57 SNOMED Supervision for EL Definition Extraction Producing definition candidates in the Snomed style : Neither predefined dictionary nor linguistic patterns required Large amount of existing SNOMED definitions and medical texts as training data Robust for contextual disambiguation Notations: R: SNOMED relationships D train : textual documents for training D test : textual documents for test

58 Architecture 1: Data Preparation Training data extraction: Alignment of D train with R : Annotating D train with SNOMED concepts (by Metamap, U.S. National Library of Medicine) Dengue virus is the causative agent of both classical dengue fever and the more severe dengue hemorrhage fever and dengue shock syndrome. (Dengue_virus_(organism), Dengue_(disorder)): Causative_agent Features extraction from training data: between-words, left-words, right-words, POS, syntactic dependency of words,... left-words between-words right-words is the causative agent of both and the more

59 Architecture 1: Data Preparation Training data extraction: Alignment of D train with R : Annotating D train with SNOMED concepts (by Metamap, U.S. National Library of Medicine) Dengue virus is the causative agent of both classical dengue fever and the more severe dengue hemorrhage fever and dengue shock syndrome. (Dengue_virus_(organism), Dengue_(disorder)): Causative_agent Features extraction from training data: between-words, left-words, right-words, POS, syntactic dependency of words,... left-words between-words right-words is the causative agent of both and the more

60 Architecture 2: Training Phase Classification with a multiclass classifier Given features extracted for the given N SNOMED roles (from data preparation phase) To learn highly weighted features for each role Causitive_agent (CA) Associated_morphology (AM) Finding_site (FS) caused, cause, from the, by a, agent of, an infection of displacement of, medical condition characterized of, in, affects only, infection of Table : Examples of highly weighted features for 3 roles

61 Architecture 3: Test Phase Annotating D test : Baritosis is a benign type of pneumoconiosis, which is caused by long-term exposure to barium dust. Baritosis_(disorder), Barium_dust_(substance) Feature extraction: left-words between-words right-words is a benign type of pneumoconiosis, which is caused by long-term exposure to Table : Test data for Baritosis left-words between-words right-words is the causative agent of both and the more is caused by two cestodes tapeworm species is the bacterium that causes whooping Table : Training data for Causative_agent

62 Architecture 3: Test Phase Annotating D test : Baritosis is a benign type of pneumoconiosis, which is caused by long-term exposure to barium dust. Baritosis_(disorder), Barium_dust_(substance) Feature extraction: left-words between-words right-words is a benign type of pneumoconiosis, which is caused by long-term exposure to Table : Test data for Baritosis left-words between-words right-words is the causative agent of both and the more is caused by two cestodes tapeworm species is the bacterium that causes whooping Table : Training data for Causative_agent

63 Architecture 3: Test Phase Annotating D test : Baritosis is a benign type of pneumoconiosis, which is caused by long-term exposure to barium dust. Baritosis_(disorder), Barium_dust_(substance) Feature extraction: left-words between-words right-words is a benign type of pneumoconiosis, which is caused by long-term exposure to Table : Test data for Baritosis left-words between-words right-words is the causative agent of both and the more is caused by two cestodes tapeworm species is the bacterium that causes whooping Table : Training data for Causative_agent

64 Preliminary Experiment: Settings Train textual sentences D train : from Web by Dog4dag (Biotec, Dresden) Classifier: Stanford maximum entropy classifier Feature: between words Concept to be defined: C tbd (e.g. Baritosis) R: relationships from SNOMED definitions excluding C tbd #D train #Sentences(AM) #Sentences(CA) #Sentences(FS) Table : Statics of training data (AM: Associated_morphology; CA: Causative_agent; FS: Finding_site)

65 Preliminary Experiment: Results Sent Concept Pairs Should-be Predicted Score S1 Baritosis, Deposition AM AM S2 Baritosis, Foreign_body AM AM S3 Baritosis, Barium_dust CA CA S4 Baritosis, Barium_dust CA CA S5 Baritosis, Barium_dust CA CA S6 Baritosis, Lung_structure FS FS S7 Baritosis, Lung_structure FS AM A r B = A r. B Baritosis Associated_morphology.Deposition Baritosis Associated_morphology.Foreign_body Baritosis Causative_agent.Barium_dust Baritosis Finding_site.Lung_structure Baritosis Associated_morphology.Lung_structure

66 Comparison of Learned and Given Definitions Baritosis Metal_pneumoconiosis Occupational_lung_disease Associated_morphology.Deposition Associated_morphology.Deposition_of _foreign_material Causative_agent.Barium Causative_agent.Barium_dust Finding_site.Lung_structure Associated_with.Barium Associated_with.Barium_dust Associated_morphology.Foreign_body (discovered from text) Causative_agent Associated_with

67 Comparison of Learned and Given Definitions Baritosis Metal_pneumoconiosis Occupational_lung_disease Associated_morphology.Deposition Associated_morphology.Deposition_of _foreign_material Causative_agent.Barium Causative_agent.Barium_dust Finding_site.Lung_structure Associated_with.Barium Associated_with.Barium_dust Associated_morphology.Foreign_body (discovered from text) Causative_agent Associated_with Barium_dust Barium

68 Formal Reasoning Brings More Training Data... Table : Sizes of the Explicit and Inferred Relationships for the relations: Associated_morphology, Causative_agent, and Finding_site Associated_ morphology Causative_ agent Finding_ site InfRB (after reasoning) 503, , 794 1, 306, 354 ExpRB (before reasoning) 32, , , 079

69 Formal Reasoning Brings More Training Data... [ Ma and Mendez 2013]

70 Formal Reasoning Brings More Training Data... [ Ma and Mendez 2013]

71 Detailed Experiments Modeling Corpora Relation Set Relationship Exp1 MeSH SNOMED InfRB Exp2 SemRep SemRep SemRep Exp3 WIKI+D4D SNOMED InfRB Feature Engineering Data Lexical Semantic Size Exp1 3-grams 424 Exp2 3-grams UMLS 1357 Exp3 3-grams SNOMED 9292 In all experiments Support Vector Machines are used for multi-class classification.

72 Detailed Experiments Modeling Corpora Relation Set Relationship Exp1 MeSH SNOMED InfRB Exp2 SemRep SemRep SemRep Exp3 WIKI+D4D SNOMED InfRB Feature Engineering Data Lexical Semantic Size Exp1 3-grams 424 Exp2 3-grams UMLS 1357 Exp3 3-grams SNOMED 9292 F-score without Types with Types Exp1 74% 99.1% Exp2 51% 54% 94% Exp3 58% 70% 100% In all experiments Support Vector Machines are used for multi-class classification.

73 Why Semantic Type Important? Causitive_agent caused, cause, from the, by a, agent of, an infection of Associated_morphology displacement of, medical condition characterized Finding_site of, in, affects only, infection of Example. an infection of virus : the existence of a causative agent relation infection of stomach : the location of a disease (i.e. its finding site)

74 Summary of the Approach 1 Learn highly weighted features for each role 2 Predict relationships for new concepts as def. candidates 3 Build EL definitions by selecting reliable candidates

75 Summary of the Approach 1 Learn highly weighted features for each role 2 Predict relationships for new concepts as def. candidates 3 Build EL definitions by selecting reliable candidates

76 Reliable Candidates: What and Why? Example Results by automatic learning [MaDistel13] Baritosis Causative_agent Barium_compound, Baritosis Causative_agent Dust, Baritosis Finding_site Lung_structure, Baritosis Causative_agent Barium_dust, Translated into DL: conjunction of candidates Baritosis Causative_agent.Barium_compound Causative_agent.Dust Finding_site.Lung_structure Causative_agent.Barium_dust Incorrect candidate according to SNOMED! (using SNOMED type as features doest not help)

77 Reliable Candidates: What and Why? Example Results by automatic learning [MaDistel13] Baritosis Causative_agent Barium_compound, Baritosis Causative_agent Dust, Baritosis Finding_site Lung_structure, Baritosis Causative_agent Barium_dust, Translated into DL: conjunction of candidates Baritosis Causative_agent.Barium_compound Causative_agent.Dust Finding_site.Lung_structure Causative_agent.Barium_dust Incorrect candidate according to SNOMED! (using SNOMED type as features doest not help)

78 Reliable Candidates: What and Why? Example Results by automatic learning [MaDistel13] Baritosis Causative_agent Barium_compound, Baritosis Causative_agent Dust, Baritosis Finding_site Lung_structure, Baritosis Causative_agent Barium_dust, Translated into DL: conjunction of candidates Baritosis Causative_agent.Barium_compound Causative_agent.Dust Finding_site.Lung_structure Causative_agent.Barium_dust Incorrect candidate according to SNOMED! (using SNOMED type as features doest not help)

79 Reliable Candidates: How? Logical Constraints: Intuition Baritosis Causative_agent. Barium_compound Permissible values for attributes [SNOMED User Guide]: Causative_agent: {Organism, Substance, Physical object, Physical force, Pharmaceutical/biologic product} Substance SNOMED CT Concept Chemical direct hierarchy indirect hierarchy Dust Barium_AND/OR_barium_compound Barium Barium_compound Barium_dust

80 Concept Adjustment for Candidate Selection Formal constrain formalization: D: a complex concept description; X: a concept variable Positive constrains: D X (1) X D (2) Negative constrains: D X (3) X D (4) Constrain Satisfiability For a concept description C not using any concept variable X, we say C satisfies Constraint 1 (resp. 2) w.r.t. a TBox T if T = D C (resp. T = C D). C satisfies Constraint 3 (resp. 4) w.r.t. a TBox T if T = D C (resp. T = C D).

81 Concept Adjustment for Candidate Selection Problem Formalization Input: a set of atomic candidate concept descriptions S, an ontology T and a set of constraints C of the forms 1 4. Problem (Concept Adjustment (CA)) Question: Is there a subset S of S such that S satisfies all the constraints in C? Problem (Maximal Confidence Concept Adjustment (MCA)) Additional input: a confidence function of candidates wt: C [0, 1]. Question: Is there a subset S of S such that S satisfies all the constraints in C and min{wt(s) S S } k?

82 Complexity Positive constrains: D X (1) X D (2) Negative constrains: D X (3) X D (4) Tractable variants (any combination without Type 4): For S S, if S satisfies a constraint X D or D X, so does S. Subsumption reasoning in EL is tractable Intractable variants (any combination containing Type 2+4): obviously, in NP NP-hard: reduction from SAT

83 SAT Encoding Type 1: dealt with by a P-time preprocessing step S 0 = {S S (D X) C: T = D S} C 0 = {c C c of type (2) or (3)}. (5) Type 2 4: f X D = T =S i D s i. f D X = s i, T =D S i f X D = s i. T =S i D D atom of D Theorem. S is a solution to the CA problem (T, S, C) iff φ S makes the formula f = c C f c true.

84 Construction of Formal Constraints Automatic: Original SNOMED, i.e. without the target concept removed, to simulate an expert If SNOMED = TargetConcept C then AutoConstraints.add(TargetConcept C) If SNOMED = C TargetConcept then AutoConstraints.add(C TargetConcept) Explicitly defined domain and range information for roles by SNOMED User Guide Forall R SNOMED If B Range(R) then AutoConstraints.add(TargetConcept R.B) If TargetConcept Domain(R) then AutoConstraints.add(TargetConcept R. )

85 Construction of Formal Constraints Automatic: Original SNOMED, i.e. without the target concept removed, to simulate an expert If SNOMED = TargetConcept C then AutoConstraints.add(TargetConcept C) If SNOMED = C TargetConcept then AutoConstraints.add(C TargetConcept) Explicitly defined domain and range information for roles by SNOMED User Guide Forall R SNOMED If B Range(R) then AutoConstraints.add(TargetConcept R.B) If TargetConcept Domain(R) then AutoConstraints.add(TargetConcept R. )

86 Construction of Formal Constraints Interactive: While MoreConstraints NewImplication new subsumptions entailed after adding candidates ForAll p in NewImplication question Is p is desired If yes then InteConstraints.add(p) Else InteConstraints.add( p) Constraints AutoConstraints InteConstraints Candidates CandidateSelection(Candidates, Constraints, portend)

87 Evaluation Experiment Set Up Target concepts: 853 SNOMED concepts (descendants of Disease, mentioned in our textual data) Texts: from WIKI and D4D (61,035 sentences, 1,084,924 words) Learning Definition Candidates from Texts [MaDistel13] One-concept-leave-out evaluation

88 Evaluation Metric Given a set of candidates Cands = {A R B : A, B are concept names and R is a role name}, the reasoning based precision can be defined as follows: Precision = {A R B Cands : SNOMED = A R B}. Cands

89 Results 276 concepts whose candidates generated by NLP having Precision < 1 are evaluated: 1.2 Unadjusted Candidates Adjusted Candidates 1 Precision Concept Figure : Precision with/without Concept Adjustment

90 Summary Baritosis Metal_pneumoconiosis Causative_agent.Barium_dust EL Finding_site.Lung_structure... Associated_morphology.Deposition_of _foreign_material

91 Summary Baritosis Metal_pneumoconiosis Causative_agent.Barium_dust EL Finding_site.Lung_structure... Associated_morphology.Deposition_of _foreign_material

92 Summary Baritosis Metal_pneumoconiosis Causative_agent.Barium_dust EL Finding_site.Lung_structure... Associated_morphology.Deposition_of _foreign_material Baritosis is a benign type of pneumoconiosis, which is caused by long-term exposure to barium dust. It is typically characterized by a mixture of very fine punctate and... in the lung.

93 Summary Baritosis Metal_pneumoconiosis EL Causative_agent.Barium_dust Finding_site.Lung_structure... Associated_morphology.Deposition_of _foreign_material Semantic Annotation Baritosis is a benign type of pneumoconiosis, which is caused by long-term exposure to barium dust. It is typically characterized by a mixture of very fine punctate and... in the lung.

94 Summary Baritosis Metal_pneumoconiosis EL Causative_agent.Barium_dust Finding_site.Lung_structure... Associated_morphology.Deposition_of _foreign_material Semantic Annotation Ontology Construction Baritosis is a benign type of pneumoconiosis, which is caused by long-term exposure to barium dust. It is typically characterized by a mixture of very fine punctate and... in the lung.

Collaborative NLP-aided ontology modelling

Collaborative NLP-aided ontology modelling Collaborative NLP-aided ontology modelling Chiara Ghidini ghidini@fbk.eu Marco Rospocher rospocher@fbk.eu International Winter School on Language and Data/Knowledge Technologies TrentoRISE Trento, 24 th

More information

Topic Models and Applications to Short Documents

Topic Models and Applications to Short Documents Topic Models and Applications to Short Documents Dieu-Thu Le Email: dieuthu.le@unitn.it Trento University April 6, 2011 1 / 43 Outline Introduction Latent Dirichlet Allocation Gibbs Sampling Short Text

More information

Information Extraction from Text

Information Extraction from Text Information Extraction from Text Jing Jiang Chapter 2 from Mining Text Data (2012) Presented by Andrew Landgraf, September 13, 2013 1 What is Information Extraction? Goal is to discover structured information

More information

Using C-OWL for the Alignment and Merging of Medical Ontologies

Using C-OWL for the Alignment and Merging of Medical Ontologies Using C-OWL for the Alignment and Merging of Medical Ontologies Heiner Stuckenschmidt 1, Frank van Harmelen 1 Paolo Bouquet 2,3, Fausto Giunchiglia 2,3, Luciano Serafini 3 1 Vrije Universiteit Amsterdam

More information

Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes

Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes Rafael Peñaloza and Anni-Yasmin Turhan TU Dresden, Institute for Theoretical Computer Science Abstract. The least common

More information

Knowledge Representation. Propositional logic

Knowledge Representation. Propositional logic CS 2710 Foundations of AI Lecture 10 Knowledge Representation. Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Knowledge-based agent Knowledge base Inference engine Knowledge

More information

A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes

A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes Franz Baader, Stefan Borgwardt, and Barbara Morawska {baader,stefborg,morawska}@tcs.inf.tu-dresden.de Theoretical Computer

More information

CEX and MEX: Logical Diff and Semantic Module Extraction in a Fragment of OWL

CEX and MEX: Logical Diff and Semantic Module Extraction in a Fragment of OWL CEX and MEX: Logical Diff and Semantic Module Extraction in a Fragment of OWL Boris Konev 1, Carsten Lutz 2, Dirk Walther 1, and Frank Wolter 1 1 University of Liverpool, UK, {konev, dwalther, wolter}@liverpool.ac.uk

More information

Knowledge Representation. Propositional logic.

Knowledge Representation. Propositional logic. CS 1571 Introduction to AI Lecture 10 Knowledge Representation. Propositional logic. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 3 due today Homework assignment

More information

Driving Semantic Parsing from the World s Response

Driving Semantic Parsing from the World s Response Driving Semantic Parsing from the World s Response James Clarke, Dan Goldwasser, Ming-Wei Chang, Dan Roth Cognitive Computation Group University of Illinois at Urbana-Champaign CoNLL 2010 Clarke, Goldwasser,

More information

ToxiCat: Hybrid Named Entity Recognition services to support curation of the Comparative Toxicogenomic Database

ToxiCat: Hybrid Named Entity Recognition services to support curation of the Comparative Toxicogenomic Database ToxiCat: Hybrid Named Entity Recognition services to support curation of the Comparative Toxicogenomic Database Dina Vishnyakova 1,2, 4, *, Julien Gobeill 1,3,4, Emilie Pasche 1,2,3,4 and Patrick Ruch

More information

Completing the is-a structure in light-weight ontologies

Completing the is-a structure in light-weight ontologies Lambrix et al. Journal of Biomedical Semantics (2015) 6:12 DOI 10.1186/s13326-015-0002-8 JOURNAL OF BIOMEDICAL SEMANTICS RESEARCH ARTICLE Open Access Completing the is-a structure in light-weight ontologies

More information

Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes

Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes Christoph Haase 1 and Carsten Lutz 2 Abstract. We perform an exhaustive study of the complexity of subsumption

More information

LTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07

LTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07 Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity

More information

Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles*

Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles* Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles* Franz Baader Theoretical Computer Science TU Dresden D-01062 Dresden, Germany

More information

The Bayesian Ontology Language BEL

The Bayesian Ontology Language BEL Journal of Automated Reasoning manuscript No. (will be inserted by the editor) The Bayesian Ontology Language BEL İsmail İlkan Ceylan Rafael Peñaloza Received: date / Accepted: date Abstract We introduce

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

Tractable Extensions of the Description Logic EL with Numerical Datatypes

Tractable Extensions of the Description Logic EL with Numerical Datatypes Tractable Extensions of the Description Logic EL with Numerical Datatypes Despoina Magka, Yevgeny Kazakov, and Ian Horrocks Oxford University Computing Laboratory Wolfson Building, Parks Road, OXFORD,

More information

Medical Question Answering for Clinical Decision Support

Medical Question Answering for Clinical Decision Support Medical Question Answering for Clinical Decision Support Travis R. Goodwin and Sanda M. Harabagiu The University of Texas at Dallas Human Language Technology Research Institute http://www.hlt.utdallas.edu

More information

Intelligent Systems (AI-2)

Intelligent Systems (AI-2) Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 19 Oct, 24, 2016 Slide Sources Raymond J. Mooney University of Texas at Austin D. Koller, Stanford CS - Probabilistic Graphical Models D. Page,

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

Phase 1. Phase 2. Phase 3. History. implementation of systems based on incomplete structural subsumption algorithms

Phase 1. Phase 2. Phase 3. History. implementation of systems based on incomplete structural subsumption algorithms History Phase 1 implementation of systems based on incomplete structural subsumption algorithms Phase 2 tableau-based algorithms and complexity results first tableau-based systems (Kris, Crack) first formal

More information

Special Topics in Computer Science

Special Topics in Computer Science Special Topics in Computer Science NLP in a Nutshell CS492B Spring Semester 2009 Speaker : Hee Jin Lee p Professor : Jong C. Park Computer Science Department Korea Advanced Institute of Science and Technology

More information

Knowledge Representation and Description Logic Part 2

Knowledge Representation and Description Logic Part 2 Knowledge Representation and Description Logic Part 2 Renata Wassermann renata@ime.usp.br Computer Science Department University of São Paulo September 2014 IAOA School Vitória Renata Wassermann Knowledge

More information

Structured Descriptions & Tradeoff Between Expressiveness and Tractability

Structured Descriptions & Tradeoff Between Expressiveness and Tractability 5. Structured Descriptions & Tradeoff Between Expressiveness and Tractability Outline Review Expressiveness & Tractability Tradeoff Modern Description Logics Object Oriented Representations Key Representation

More information

Just: a Tool for Computing Justifications w.r.t. ELH Ontologies

Just: a Tool for Computing Justifications w.r.t. ELH Ontologies Just: a Tool for Computing Justifications w.r.t. ELH Ontologies Michel Ludwig Theoretical Computer Science, TU Dresden, Germany michel@tcs.inf.tu-dresden.de Abstract. We introduce the tool Just for computing

More information

Intelligent Systems (AI-2)

Intelligent Systems (AI-2) Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 19 Oct, 23, 2015 Slide Sources Raymond J. Mooney University of Texas at Austin D. Koller, Stanford CS - Probabilistic Graphical Models D. Page,

More information

Fuzzy Description Logics

Fuzzy Description Logics Fuzzy Description Logics 1. Introduction to Description Logics Rafael Peñaloza Rende, January 2016 Literature Description Logics Baader, Calvanese, McGuinness, Nardi, Patel-Schneider (eds.) The Description

More information

Data Mining and Machine Learning

Data Mining and Machine Learning Data Mining and Machine Learning Concept Learning and Version Spaces Introduction Concept Learning Generality Relations Refinement Operators Structured Hypothesis Spaces Simple algorithms Find-S Find-G

More information

Seq2Seq Losses (CTC)

Seq2Seq Losses (CTC) Seq2Seq Losses (CTC) Jerry Ding & Ryan Brigden 11-785 Recitation 6 February 23, 2018 Outline Tasks suited for recurrent networks Losses when the output is a sequence Kinds of errors Losses to use CTC Loss

More information

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural

More information

Bringing machine learning & compositional semantics together: central concepts

Bringing machine learning & compositional semantics together: central concepts Bringing machine learning & compositional semantics together: central concepts https://githubcom/cgpotts/annualreview-complearning Chris Potts Stanford Linguistics CS 244U: Natural language understanding

More information

Designing and Evaluating Generic Ontologies

Designing and Evaluating Generic Ontologies Designing and Evaluating Generic Ontologies Michael Grüninger Department of Industrial Engineering University of Toronto gruninger@ie.utoronto.ca August 28, 2007 1 Introduction One of the many uses of

More information

Generative Models for Sentences

Generative Models for Sentences Generative Models for Sentences Amjad Almahairi PhD student August 16 th 2014 Outline 1. Motivation Language modelling Full Sentence Embeddings 2. Approach Bayesian Networks Variational Autoencoders (VAE)

More information

Naïve Bayes Classifiers

Naïve Bayes Classifiers Naïve Bayes Classifiers Example: PlayTennis (6.9.1) Given a new instance, e.g. (Outlook = sunny, Temperature = cool, Humidity = high, Wind = strong ), we want to compute the most likely hypothesis: v NB

More information

Extending Unification in EL towards General TBoxes

Extending Unification in EL towards General TBoxes Extending Unification in EL towards General TBoxes Franz Baader and Stefan Borgwardt and Barbara Morawska Theoretical Computer Science, TU Dresden, Germany {baader,stefborg,morawska}@tcs.inf.tu-dresden.de

More information

A Comparative Study of Current Clinical NLP Systems on Handling Abbreviations

A Comparative Study of Current Clinical NLP Systems on Handling Abbreviations A Comparative Study of Current Clinical NLP Systems on Handling Abbreviations Yonghui Wu 1 PhD, Joshua C. Denny 2 MD MS, S. Trent Rosenbloom 2 MD MPH, Randolph A. Miller 2 MD, Dario A. Giuse 2 Dr.Ing,

More information

Learning Features from Co-occurrences: A Theoretical Analysis

Learning Features from Co-occurrences: A Theoretical Analysis Learning Features from Co-occurrences: A Theoretical Analysis Yanpeng Li IBM T. J. Watson Research Center Yorktown Heights, New York 10598 liyanpeng.lyp@gmail.com Abstract Representing a word by its co-occurrences

More information

odeling atient ortality from linical ote

odeling atient ortality from linical ote odeling atient ortality from linical ote M P M C N ombining opic odeling and ntological eature earning with roup egularization for ext lassification C T M G O F T C eong in ee, harmgil ong, and ilos auskrecht

More information

Explainable AI that Can be Used for Judgment with Responsibility

Explainable AI that Can be Used for Judgment with Responsibility Explain AI@Imperial Workshop Explainable AI that Can be Used for Judgment with Responsibility FUJITSU LABORATORIES LTD. 5th April 08 About me Name: Hajime Morita Research interests: Natural Language Processing

More information

CLASSIFYING LABORATORY TEST RESULTS USING MACHINE LEARNING

CLASSIFYING LABORATORY TEST RESULTS USING MACHINE LEARNING CLASSIFYING LABORATORY TEST RESULTS USING MACHINE LEARNING Joy (Sizhe) Chen, Kenny Chiu, William Lu, Nilgoon Zarei AUGUST 31, 2018 TEAM Joy (Sizhe) Chen Kenny Chiu William Lu Nelly (Nilgoon) Zarei 2 AGENDA

More information

Modern Information Retrieval

Modern Information Retrieval Modern Information Retrieval Chapter 8 Text Classification Introduction A Characterization of Text Classification Unsupervised Algorithms Supervised Algorithms Feature Selection or Dimensionality Reduction

More information

CLRG Biocreative V

CLRG Biocreative V CLRG ChemTMiner @ Biocreative V Sobha Lalitha Devi., Sindhuja Gopalan., Vijay Sundar Ram R., Malarkodi C.S., Lakshmi S., Pattabhi RK Rao Computational Linguistics Research Group, AU-KBC Research Centre

More information

Reasoning About Typicality in ALC and EL

Reasoning About Typicality in ALC and EL Reasoning About Typicality in ALC and EL Laura Giordano 1, Valentina Gliozzi 2, Nicola Olivetti 3, and Gian Luca Pozzato 2 1 Dipartimento di Informatica - Università del Piemonte Orientale A. Avogadro

More information

Extracting Modules from Ontologies: A Logic-based Approach

Extracting Modules from Ontologies: A Logic-based Approach Extracting Modules from Ontologies: A Logic-based Approach Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov and Ulrike Sattler The University of Manchester School of Computer Science Manchester, M13

More information

Outline. Structure-Based Partitioning of Large Concept Hierarchies. Ontologies and the Semantic Web. The Case for Partitioning

Outline. Structure-Based Partitioning of Large Concept Hierarchies. Ontologies and the Semantic Web. The Case for Partitioning Outline Structure-Based Partitioning of Large Concept Hierarchies Heiner Stuckenschmidt, Michel Klein Vrije Universiteit Amsterdam Motivation: The Case for Ontology Partitioning Lots of Pictures A Partitioning

More information

Restricted role-value-maps in a description logic with existential restrictions and terminological cycles

Restricted role-value-maps in a description logic with existential restrictions and terminological cycles Restricted role-value-maps in a description logic with existential restrictions and terminological cycles Franz Baader Theoretical Computer Science, Dresden University of Technology D-01062 Dresden, Germany

More information

Machine Learning for Structured Prediction

Machine Learning for Structured Prediction Machine Learning for Structured Prediction Grzegorz Chrupa la National Centre for Language Technology School of Computing Dublin City University NCLT Seminar Grzegorz Chrupa la (DCU) Machine Learning for

More information

Dismatching and Local Disunification in EL

Dismatching and Local Disunification in EL Dismatching and Local Disunification in EL (Extended Abstract) Franz Baader, Stefan Borgwardt, and Barbara Morawska Theoretical Computer Science, TU Dresden, Germany {baader,stefborg,morawska}@tcs.inf.tu-dresden.de

More information

[read Chapter 2] [suggested exercises 2.2, 2.3, 2.4, 2.6] General-to-specific ordering over hypotheses

[read Chapter 2] [suggested exercises 2.2, 2.3, 2.4, 2.6] General-to-specific ordering over hypotheses 1 CONCEPT LEARNING AND THE GENERAL-TO-SPECIFIC ORDERING [read Chapter 2] [suggested exercises 2.2, 2.3, 2.4, 2.6] Learning from examples General-to-specific ordering over hypotheses Version spaces and

More information

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system): Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building

More information

AI Programming CS S-09 Knowledge Representation

AI Programming CS S-09 Knowledge Representation AI Programming CS662-2013S-09 Knowledge Representation David Galles Department of Computer Science University of San Francisco 09-0: Overview So far, we ve talked about search, which is a means of considering

More information

Machine Learning 2010

Machine Learning 2010 Machine Learning 2010 Concept Learning: The Logical Approach Michael M Richter Email: mrichter@ucalgary.ca 1 - Part 1 Basic Concepts and Representation Languages 2 - Why Concept Learning? Concepts describe

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Kernel Methods and Support Vector Machines Oliver Schulte - CMPT 726 Bishop PRML Ch. 6 Support Vector Machines Defining Characteristics Like logistic regression, good for continuous input features, discrete

More information

University of Oxford. Consequence-based Datatype Reasoning in EL: Identifying the Tractable Fragments

University of Oxford. Consequence-based Datatype Reasoning in EL: Identifying the Tractable Fragments University of Oxford Consequence-based Datatype Reasoning in EL: Identifying the Tractable Fragments by Despoina Magka St. Peter s College under joint supervision by Prof. Ian Horrocks and Dr. Yevgeny

More information

Probabilistic and Logistic Circuits: A New Synthesis of Logic and Machine Learning

Probabilistic and Logistic Circuits: A New Synthesis of Logic and Machine Learning Probabilistic and Logistic Circuits: A New Synthesis of Logic and Machine Learning Guy Van den Broeck KULeuven Symposium Dec 12, 2018 Outline Learning Adding knowledge to deep learning Logistic circuits

More information

LTCS Report. A finite basis for the set of EL-implications holding in a finite model

LTCS Report. A finite basis for the set of EL-implications holding in a finite model Dresden University of Technology Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report A finite basis for the set of EL-implications holding in a finite model Franz Baader, Felix

More information

Probabilistic classification CE-717: Machine Learning Sharif University of Technology. M. Soleymani Fall 2016

Probabilistic classification CE-717: Machine Learning Sharif University of Technology. M. Soleymani Fall 2016 Probabilistic classification CE-717: Machine Learning Sharif University of Technology M. Soleymani Fall 2016 Topics Probabilistic approach Bayes decision theory Generative models Gaussian Bayes classifier

More information

Text Mining. Dr. Yanjun Li. Associate Professor. Department of Computer and Information Sciences Fordham University

Text Mining. Dr. Yanjun Li. Associate Professor. Department of Computer and Information Sciences Fordham University Text Mining Dr. Yanjun Li Associate Professor Department of Computer and Information Sciences Fordham University Outline Introduction: Data Mining Part One: Text Mining Part Two: Preprocessing Text Data

More information

Data-Driven Logical Reasoning

Data-Driven Logical Reasoning Data-Driven Logical Reasoning Claudia d Amato Volha Bryl, Luciano Serafini November 11, 2012 8 th International Workshop on Uncertainty Reasoning for the Semantic Web 11 th ISWC, Boston (MA), USA. Heterogeneous

More information

An Introduction to Description Logics

An Introduction to Description Logics An Introduction to Description Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, 21.11.2013 Marco Cerami (UPOL) Description Logics 21.11.2013

More information

Reasoning with Inconsistent and Uncertain Ontologies

Reasoning with Inconsistent and Uncertain Ontologies Reasoning with Inconsistent and Uncertain Ontologies Guilin Qi Southeast University China gqi@seu.edu.cn Reasoning Web 2012 September 05, 2012 Outline Probabilistic logic vs possibilistic logic Probabilistic

More information

COMPUTING LOCAL UNIFIERS IN THE DESCRIPTION LOGIC EL WITHOUT THE TOP CONCEPT

COMPUTING LOCAL UNIFIERS IN THE DESCRIPTION LOGIC EL WITHOUT THE TOP CONCEPT Institute of Theoretical Computer Science Chair of Automata Theory COMPUTING LOCAL UNIFIERS IN THE DESCRIPTION LOGIC EL WITHOUT THE TOP CONCEPT Franz Baader Nguyen Thanh Binh Stefan Borgwardt Barbara Morawska

More information

TALP at GeoQuery 2007: Linguistic and Geographical Analysis for Query Parsing

TALP at GeoQuery 2007: Linguistic and Geographical Analysis for Query Parsing TALP at GeoQuery 2007: Linguistic and Geographical Analysis for Query Parsing Daniel Ferrés and Horacio Rodríguez TALP Research Center Software Department Universitat Politècnica de Catalunya {dferres,horacio}@lsi.upc.edu

More information

Lightweight Description Logics: DL-Lite A and EL ++

Lightweight Description Logics: DL-Lite A and EL ++ Lightweight Description Logics: DL-Lite A and EL ++ Elena Botoeva 1 KRDB Research Centre Free University of Bozen-Bolzano January 13, 2011 Departamento de Ciencias de la Computación Universidad de Chile,

More information

Learning Classification with Auxiliary Probabilistic Information Quang Nguyen Hamed Valizadegan Milos Hauskrecht

Learning Classification with Auxiliary Probabilistic Information Quang Nguyen Hamed Valizadegan Milos Hauskrecht Learning Classification with Auxiliary Probabilistic Information Quang Nguyen Hamed Valizadegan Milos Hauskrecht Computer Science Department University of Pittsburgh Outline Introduction Learning with

More information

Bio-Medical Text Mining with Machine Learning

Bio-Medical Text Mining with Machine Learning Sumit Madan Department of Bioinformatics - Fraunhofer SCAI Textual Knowledge PubMed Journals, Books Patents EHRs What is Bio-Medical Text Mining? Phosphorylation of glycogen synthase kinase 3 beta at Threonine,

More information

Motivation. Bayesian Networks in Epistemology and Philosophy of Science Lecture. Overview. Organizational Issues

Motivation. Bayesian Networks in Epistemology and Philosophy of Science Lecture. Overview. Organizational Issues Bayesian Networks in Epistemology and Philosophy of Science Lecture 1: Bayesian Networks Center for Logic and Philosophy of Science Tilburg University, The Netherlands Formal Epistemology Course Northern

More information

Bayesian Description Logics

Bayesian Description Logics Bayesian Description Logics İsmail İlkan Ceylan1 and Rafael Peñaloza 1,2 1 Theoretical Computer Science, TU Dresden, Germany 2 Center for Advancing Electronics Dresden {ceylan,penaloza}@tcs.inf.tu-dresden.de

More information

Technische Universität Dresden. Fakultät Informatik EMCL Master s Thesis on. Hybrid Unification in the Description Logic EL

Technische Universität Dresden. Fakultät Informatik EMCL Master s Thesis on. Hybrid Unification in the Description Logic EL Technische Universität Dresden Fakultät Informatik EMCL Master s Thesis on Hybrid Unification in the Description Logic EL by Oliver Fernández Gil born on June 11 th 1982, in Pinar del Río, Cuba Supervisor

More information

Probabilistic Ontologies: Logical Approach

Probabilistic Ontologies: Logical Approach Probabilistic Ontologies: Logical Approach Pavel Klinov Applied Artificial Intelligence Lab ECE Department University of Cincinnati Agenda Why do we study ontologies? Uncertainty Probabilistic ontologies

More information

Declarative Merging of and Reasoning about Decision Diagrams

Declarative Merging of and Reasoning about Decision Diagrams Declarative Merging of and Reasoning about Decision Diagrams Thomas Eiter Thomas Krennwallner Christoph Redl {eiter,tkren,redl}@kr.tuwien.ac.at September 12, 2011 Eiter T., Krennwallner T., Redl C. (TU

More information

Probabilistic Graphical Models: MRFs and CRFs. CSE628: Natural Language Processing Guest Lecturer: Veselin Stoyanov

Probabilistic Graphical Models: MRFs and CRFs. CSE628: Natural Language Processing Guest Lecturer: Veselin Stoyanov Probabilistic Graphical Models: MRFs and CRFs CSE628: Natural Language Processing Guest Lecturer: Veselin Stoyanov Why PGMs? PGMs can model joint probabilities of many events. many techniques commonly

More information

Week 4. COMP62342 Sean Bechhofer, Uli Sattler

Week 4. COMP62342 Sean Bechhofer, Uli Sattler Week 4 COMP62342 Sean Bechhofer, Uli Sattler sean.bechhofer@manchester.ac.uk, uli.sattler@manchester.ac.uk Today Some clarifications from last week s coursework More on reasoning: extension of the tableau

More information

A set theoretic view of the ISA hierarchy

A set theoretic view of the ISA hierarchy Loughborough University Institutional Repository A set theoretic view of the ISA hierarchy This item was submitted to Loughborough University's Institutional Repository by the/an author. Citation: CHEUNG,

More information

Hybrid Unification in the Description Logic EL

Hybrid Unification in the Description Logic EL Hybrid Unification in the Description Logic EL Franz Baader, Oliver Fernández Gil, and Barbara Morawska {baader,morawska}@tcs.inf.tu-dresden.de, fernandez@informatik.uni-leipzig.de Theoretical Computer

More information

Project Halo: Towards a Knowledgeable Biology Textbook. Peter Clark Vulcan Inc.

Project Halo: Towards a Knowledgeable Biology Textbook. Peter Clark Vulcan Inc. Project Halo: Towards a Knowledgeable Biology Textbook Peter Clark Vulcan Inc. Vulcan Inc. Paul Allen s company, in Seattle, USA Includes AI research group Vulcan s Project Halo AI research towards knowledgeable

More information

Lecture 5 Neural models for NLP

Lecture 5 Neural models for NLP CS546: Machine Learning in NLP (Spring 2018) http://courses.engr.illinois.edu/cs546/ Lecture 5 Neural models for NLP Julia Hockenmaier juliahmr@illinois.edu 3324 Siebel Center Office hours: Tue/Thu 2pm-3pm

More information

Modular Reuse of Ontologies: Theory and Practice

Modular Reuse of Ontologies: Theory and Practice Journal of Artificial Intelligence Research 31 (2008) 273-318 Submitted 07/07; published 02/08 Modular Reuse of Ontologies: Theory and Practice Bernardo Cuenca Grau Ian Horrocks Yevgeny Kazakov Oxford

More information

The Perceptron. Volker Tresp Summer 2014

The Perceptron. Volker Tresp Summer 2014 The Perceptron Volker Tresp Summer 2014 1 Introduction One of the first serious learning machines Most important elements in learning tasks Collection and preprocessing of training data Definition of a

More information

A Study of Biomedical Concept Identification: MetaMap vs. People

A Study of Biomedical Concept Identification: MetaMap vs. People A Study of Biomedical Concept Identification: MetaMap vs. People Wanda Pratt, Ph.D.,,2 Meliha Yetisgen-Yildiz, M.S. 2 Biomedical and Health Informatics, School of Medicine, University of Washington, Seattle,

More information

10/17/04. Today s Main Points

10/17/04. Today s Main Points Part-of-speech Tagging & Hidden Markov Model Intro Lecture #10 Introduction to Natural Language Processing CMPSCI 585, Fall 2004 University of Massachusetts Amherst Andrew McCallum Today s Main Points

More information

Automated Summarisation for Evidence Based Medicine

Automated Summarisation for Evidence Based Medicine Automated Summarisation for Evidence Based Medicine Diego Mollá Centre for Language Technology, Macquarie University HAIL, 22 March 2012 Contents Evidence Based Medicine Our Corpus for Summarisation Structure

More information

Belief Contraction for the Description Logic EL

Belief Contraction for the Description Logic EL Belief Contraction for the Description Logic EL Zhi Qiang Zhuang and Maurice Pagnucco ARC Centre of Excellence for Autonomous Systems and National ICT Australia, School of Computer Science and Engineering,

More information

A Survey of Temporal Knowledge Representations

A Survey of Temporal Knowledge Representations A Survey of Temporal Knowledge Representations Advisor: Professor Abdullah Tansel Second Exam Presentation Knowledge Representations logic-based logic-base formalisms formalisms more complex and difficult

More information

An Introduction to Description Logics: Techniques, Properties, and Applications. NASSLLI, Day 2, Part 2. Reasoning via Tableau Algorithms.

An Introduction to Description Logics: Techniques, Properties, and Applications. NASSLLI, Day 2, Part 2. Reasoning via Tableau Algorithms. An Introduction to Description Logics: Techniques, Properties, and Applications NASSLLI, Day 2, Part 2 Reasoning via Tableau Algorithms Uli Sattler 1 Today relationship between standard DL reasoning problems

More information

Inverting Proof Systems for Secrecy under OWA

Inverting Proof Systems for Secrecy under OWA Inverting Proof Systems for Secrecy under OWA Giora Slutzki Department of Computer Science Iowa State University Ames, Iowa 50010 slutzki@cs.iastate.edu May 9th, 2010 Jointly with Jia Tao and Vasant Honavar

More information

Completing Description Logic Knowledge Bases using Formal Concept Analysis

Completing Description Logic Knowledge Bases using Formal Concept Analysis Completing Description Logic Knowledge Bases using Formal Concept Analysis Franz Baader 1, Bernhard Ganter 1, Ulrike Sattler 2 and Barış Sertkaya 1 1 TU Dresden, Germany 2 The University of Manchester,

More information

Global Machine Learning for Spatial Ontology Population

Global Machine Learning for Spatial Ontology Population Global Machine Learning for Spatial Ontology Population Parisa Kordjamshidi, Marie-Francine Moens KU Leuven, Belgium Abstract Understanding spatial language is important in many applications such as geographical

More information

INFO 4300 / CS4300 Information Retrieval. slides adapted from Hinrich Schütze s, linked from

INFO 4300 / CS4300 Information Retrieval. slides adapted from Hinrich Schütze s, linked from INFO 4300 / CS4300 Information Retrieval slides adapted from Hinrich Schütze s, linked from http://informationretrieval.org/ IR 26/26: Feature Selection and Exam Overview Paul Ginsparg Cornell University,

More information

1. Courses are either tough or boring. 2. Not all courses are boring. 3. Therefore there are tough courses. (Cx, Tx, Bx, )

1. Courses are either tough or boring. 2. Not all courses are boring. 3. Therefore there are tough courses. (Cx, Tx, Bx, ) Logic FOL Syntax FOL Rules (Copi) 1. Courses are either tough or boring. 2. Not all courses are boring. 3. Therefore there are tough courses. (Cx, Tx, Bx, ) Dealing with Time Translate into first-order

More information

Description Logics. Deduction in Propositional Logic. franconi. Enrico Franconi

Description Logics. Deduction in Propositional Logic.   franconi. Enrico Franconi (1/20) Description Logics Deduction in Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/20) Decision

More information

Propositional Logic: Logical Agents (Part I)

Propositional Logic: Logical Agents (Part I) Propositional Logic: Logical Agents (Part I) First Lecture Today (Tue 21 Jun) Read Chapters 1 and 2 Second Lecture Today (Tue 21 Jun) Read Chapter 7.1-7.4 Next Lecture (Thu 23 Jun) Read Chapters 7.5 (optional:

More information

Propositional Logic: Logical Agents (Part I)

Propositional Logic: Logical Agents (Part I) Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order

More information

Interactive ontology debugging: two query strategies for efficient fault localization

Interactive ontology debugging: two query strategies for efficient fault localization Interactive ontology debugging: two query strategies for efficient fault localization Kostyantyn Shchekotykhin a,, Gerhard Friedrich a, Philipp Fleiss a,1, Patrick Rodler a,1 a Alpen-Adria Universität,

More information

Natural Language Processing. Topics in Information Retrieval. Updated 5/10

Natural Language Processing. Topics in Information Retrieval. Updated 5/10 Natural Language Processing Topics in Information Retrieval Updated 5/10 Outline Introduction to IR Design features of IR systems Evaluation measures The vector space model Latent semantic indexing Background

More information

Evaluation Strategies

Evaluation Strategies Evaluation Intrinsic Evaluation Comparison with an ideal output: Challenges: Requires a large testing set Intrinsic subjectivity of some discourse related judgments Hard to find corpora for training/testing

More information

PROBABILISTIC KNOWLEDGE GRAPH CONSTRUCTION: COMPOSITIONAL AND INCREMENTAL APPROACHES. Dongwoo Kim with Lexing Xie and Cheng Soon Ong CIKM 2016

PROBABILISTIC KNOWLEDGE GRAPH CONSTRUCTION: COMPOSITIONAL AND INCREMENTAL APPROACHES. Dongwoo Kim with Lexing Xie and Cheng Soon Ong CIKM 2016 PROBABILISTIC KNOWLEDGE GRAPH CONSTRUCTION: COMPOSITIONAL AND INCREMENTAL APPROACHES Dongwoo Kim with Lexing Xie and Cheng Soon Ong CIKM 2016 1 WHAT IS KNOWLEDGE GRAPH (KG)? KG widely used in various tasks

More information

Scrutinizing the relationships between SNOMED CT concepts and semantic tags

Scrutinizing the relationships between SNOMED CT concepts and semantic tags Bona and Ceusters Scrutinizing the relationships between SNOMED CT concepts and semantic tags Jonathan Bona 1, * and Werner Ceusters 2 1 Department of Biomedical Informatics, University of Arkansas for

More information

Lecture 2: Probability, Naive Bayes

Lecture 2: Probability, Naive Bayes Lecture 2: Probability, Naive Bayes CS 585, Fall 205 Introduction to Natural Language Processing http://people.cs.umass.edu/~brenocon/inlp205/ Brendan O Connor Today Probability Review Naive Bayes classification

More information