Stage-oe-small.jpg

Techreport252: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
 
K (Added from ontology)
Zeile 19: Zeile 19:
 
|Abstract=Non-taxonomic relations between concepts appear as a major building block in common ontology definitions. In fact, their definition consumes much of the time needed for engineering an ontology. We here describe a new approach to discover non-taxonomic conceptual relations from text building on shallow text processing techniques. We use a generalized association rule algorithm that does not only detect relations between concepts, but also determines the \emph{appropriate level of abstraction} at which to define relations. This is crucial for an appropriate ontology definition in order that it be succinct and conceptually adequate and, hence, easy to understand, maintain, and extend. We also perform an empirical evaluation of our approach with regard to a manually engineered ontology. For this purpose, we present a new paradigm suited to evaluate the degree to which relations that are learned match relations in a manually engineered ontology.  
 
|Abstract=Non-taxonomic relations between concepts appear as a major building block in common ontology definitions. In fact, their definition consumes much of the time needed for engineering an ontology. We here describe a new approach to discover non-taxonomic conceptual relations from text building on shallow text processing techniques. We use a generalized association rule algorithm that does not only detect relations between concepts, but also determines the \emph{appropriate level of abstraction} at which to define relations. This is crucial for an appropriate ontology definition in order that it be succinct and conceptually adequate and, hence, easy to understand, maintain, and extend. We also perform an empirical evaluation of our approach with regard to a manually engineered ontology. For this purpose, we present a new paradigm suited to evaluate the degree to which relations that are learned match relations in a manually engineered ontology.  
 
|VG Wort-Seiten=
 
|VG Wort-Seiten=
|Download=2000_252_Maedche_Discovering Con_1.pdf
+
|Download=2000_252_Maedche_Discovering_Con_1.pdf
|Forschungsgebiet=
 
 
|Projekt=
 
|Projekt=
 
|Forschungsgruppe=
 
|Forschungsgruppe=
 
}}
 
}}

Version vom 15. August 2009, 16:31 Uhr


Discovering Conceptual Relations from Text




Published: 2000 Februar
Nummer: 400
Institution: University of Karlsruhe, Institute AIFB
Erscheinungsort / Ort: 76128 Karlsruhe, Germany
Archivierungsnummer:252

BibTeX



Kurzfassung
Non-taxonomic relations between concepts appear as a major building block in common ontology definitions. In fact, their definition consumes much of the time needed for engineering an ontology. We here describe a new approach to discover non-taxonomic conceptual relations from text building on shallow text processing techniques. We use a generalized association rule algorithm that does not only detect relations between concepts, but also determines the \emph{appropriate level of abstraction} at which to define relations. This is crucial for an appropriate ontology definition in order that it be succinct and conceptually adequate and, hence, easy to understand, maintain, and extend. We also perform an empirical evaluation of our approach with regard to a manually engineered ontology. For this purpose, we present a new paradigm suited to evaluate the degree to which relations that are learned match relations in a manually engineered ontology.

Download: Media:2000_252_Maedche_Discovering_Con_1.pdf



Forschungsgebiet