The availability of encyclopedic Linked Open Data (LOD) paves the way to a new generation of knowledge-intensive applications able to exploit the information encoded in the semantically-enriched datasets freely available on the Web. In such applications, the notion of relatedness between entities plays an important role whenever, given a query, we are looking not only for exact answers but we are also interested in a ranked list of related ones. In this paper we present an approach to build a relatedness graph among resources in the DBpedia dataset that refer to the IT domain. Our nal aim is to create a useful data structure at the basis of an expert system that, looking for an IT resource, returns a ranked list of related technologies, languages, tools the user might be interested in. The graph we created is a basic building block to allow an expert system to support the user in entity search tasks in the IT domain (e.g. software component search or expert nding) that goes beyond string matching typical of pure keyword-based approaches and is able to exploit the explicit and implicit semantics encoded within LOD datasets. The graph creation relies on dierent relatedness measures that are combined with each other to compute a ranked list of candidate resources associated to a given query. We validated our tool through experimental evaluation on real data to verify the eectiveness of
Building a relatedness graph from Linked Open Data: A case study in the IT domain / DI NOIA, Tommaso; Ostuni, Vito Claudio; Rosati, Jessica; Tomeo, Paolo; DI SCIASCIO, Eugenio; Mirizzi, Roberto; Bartolini, Claudio. - In: EXPERT SYSTEMS WITH APPLICATIONS. - ISSN 0957-4174. - 44:(2016), pp. 354-366. [10.1016/j.eswa.2015.08.038]
Building a relatedness graph from Linked Open Data: A case study in the IT domain
DI NOIA, Tommaso;OSTUNI, Vito Claudio;TOMEO, Paolo;DI SCIASCIO, Eugenio;MIRIZZI, ROBERTO;
2016-01-01
Abstract
The availability of encyclopedic Linked Open Data (LOD) paves the way to a new generation of knowledge-intensive applications able to exploit the information encoded in the semantically-enriched datasets freely available on the Web. In such applications, the notion of relatedness between entities plays an important role whenever, given a query, we are looking not only for exact answers but we are also interested in a ranked list of related ones. In this paper we present an approach to build a relatedness graph among resources in the DBpedia dataset that refer to the IT domain. Our nal aim is to create a useful data structure at the basis of an expert system that, looking for an IT resource, returns a ranked list of related technologies, languages, tools the user might be interested in. The graph we created is a basic building block to allow an expert system to support the user in entity search tasks in the IT domain (e.g. software component search or expert nding) that goes beyond string matching typical of pure keyword-based approaches and is able to exploit the explicit and implicit semantics encoded within LOD datasets. The graph creation relies on dierent relatedness measures that are combined with each other to compute a ranked list of candidate resources associated to a given query. We validated our tool through experimental evaluation on real data to verify the eectiveness ofFile | Dimensione | Formato | |
---|---|---|---|
Building_a_relatedness_graph_from_Linked_Open_Data_a_case_study_in_the_IT_domain.pdf
accesso aperto
Descrizione: Submitted version
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
540.32 kB
Formato
Adobe PDF
|
540.32 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.