• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

SVM-based algorithms for aligning ontologies using literature

xu, wei January 2008 (has links)
<p>Ontologies is one of the key techniques used in Semantic Web establishment. Nowadays,many ontologies have been developed and it is critical to understand the relationships between the terms of the ontologies, i.e. we need to align the ontologies.</p><p>This thesis deals with an approach for finding relationships between ontologies using literature by classifying documents related to terms in the ontologies.</p><p> </p><p>In this project the general method from [1] is used, but in the classifier generation part, a brand new classifier based on SVMs algorithm is implemented by LPU and SVM<em><sup>light</sup></em>. We evaluate our approach and compare it to previous approaches.</p>
2

SVM-based algorithms for aligning ontologies using literature

Xu, Wei January 2008 (has links)
Ontologies is one of the key techniques used in Semantic Web establishment. Nowadays,many ontologies have been developed and it is critical to understand the relationships between the terms of the ontologies, i.e. we need to align the ontologies. This thesis deals with an approach for finding relationships between ontologies using literature by classifying documents related to terms in the ontologies.   In this project the general method from [1] is used, but in the classifier generation part, a brand new classifier based on SVMs algorithm is implemented by LPU and SVMlight. We evaluate our approach and compare it to previous approaches.

Page generated in 0.0175 seconds