liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Detecting Missing IS-A Relations in Ontologies
Linköping University, Department of Computer and Information Science. (IISLAB)
Linköping University, Department of Computer and Information Science. (IISLAB)
2010 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Biological ontologies can be used to classify basic terms in biological domains and relations between them. They can also be used as the foundation for interoperability between systems, as community reference and as well as for searching, integration and biological data exchange.

Developing ontologies is not easy and most of the time the end result is incomplete or inconsistent. In many cases, such developed ontologies although useful, result into problems when used in semantically-enabled applications. This led to drawing wrong conclusions or failing to see the correct ones. To deal with these problems ontologies need to be repaired. Till today much of the work has been done on searching and repairing the semantic flaws like unsatisfiable concepts and inconsistent ontologies.

In this thesis our goal in particular is to find the missing structural relations (is–a hierarchy) between different concepts in ontologies. These concepts are extracted by matching different patterns like Hearst or Hyponymy patterns. Furthermore, the patterns are either noun phrases or the subclasses within a class of patterns.

Moreover, we also apply external knowledge such as PubMed to validate the missing is-a relations between concepts found by the algorithm using Hearst and Hyponymy patterns through the documents provided by PubMed. The validation provides us the path to conclude the correctness of our developed algorithm.

 

Place, publisher, year, edition, pages
2010. , 84 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-63598ISRN: LIU-IDA/LITH-EX-A--10/051--SEOAI: oai:DiVA.org:liu-63598DiVA: diva2:380979
Presentation
2010-12-21, Charles Babbage, Building B, Ground Floor (Level 2), Linköping, 09:30 (English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2011-01-10 Created: 2010-12-22 Last updated: 2011-01-10Bibliographically approved

Open Access in DiVA

fulltext(1666 kB)757 downloads
File information
File name FULLTEXT01.pdfFile size 1666 kBChecksum SHA-512
aef3d25a327d418794a6d8f55a4e4a945165ac385e55afc61e74de2a30bcdecdfd5cc349883c565e376ea705a3c09a152decfe1ec4b4c08f95498b2dbfbdd31e
Type fulltextMimetype application/pdf

By organisation
Department of Computer and Information Science
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 757 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 187 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf