Go to:
Logótipo
Você está em: Start > Publications > View > Challenges in Computing Semantic Relatedness for Large Semantic Graphs
Map of Premises
Principal
Publication

Challenges in Computing Semantic Relatedness for Large Semantic Graphs

Title
Challenges in Computing Semantic Relatedness for Large Semantic Graphs
Type
Article in International Conference Proceedings Book
Year
2014
Authors
Costa, T
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Leal, JP
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Conference proceedings International
Pages: 376-377
18th International Database Engineering and Applications Symposium, IDEAS 2014
Porto, 7 July 2014 through 9 July 2014
Other information
Authenticus ID: P-009-S2X
Abstract (EN): The research presented in this paper is part of an ongoing work to define semantic relatedness measures to any given semantic graph. These measures are based on a prior definition of a family of proximity algorithms that computes the semantic relatedness between pairs of concepts, and are parametrized by a semantic graph and a set of weighted properties. The distinctive feature of the proximity algorithms is that they consider all paths connecting two concepts in the semantic graph. These parameters must be tuned in order to maximize the quality of the semantic measure against a benchmark data set. From a previous work, the process of tuning the weight assignment is already developed and relies on a genetic algorithm. The weight tuning process, using all the properties in the semantic graph, was validated using WordNet 2.0 and the data set WordSim-353. The quality of the obtained semantic measure is better than those in the literature. However, this approach did not produce equally good results in larger semantic graphs such as WordNet 3.0, DBPedia and Freebase. This was in part due to the size of these graphs. The current approach is to select a sub-graph of the original semantic graph, small enough to enable processing and large enough to include all the relevant paths. This paper provides an overview of the ongoing work and presents a strategy to overcome the challenges raise by large semantic graphs.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 2
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Proceedings of the 3rd IPLeiria's International Health Congress Abstracts (2016)
Article in International Scientific Journal
Tomás, CC; Oliveira, E; Sousa, D; Uba Chupel, M; Furtado, G; Rocha, C; Lopes C; Ferreira, P; Alves, C; Gisin, S; Catarino, E; Carvalho, N; Coucelo, T; Bonfim, L; Silva, C; Franco, D; González, JA; Jardim, HG; Silva, R; Baixinho, CL...(mais 1673 authors)
Publishing Linked Data with DaPress (2013)
Article in International Conference Proceedings Book
Costa, T; Leal, JP
Multiscale Parameter Tuning of a Semantic Relatedness Algorithm (2014)
Article in International Conference Proceedings Book
Leal, JP; Costa, T
Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-15 at 01:23:55 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book