Advanced search
1 file | 440.62 KB

Improving semantic relatedness in paths for storytelling with linked data on the web

Author
Organization
Abstract
Algorithmic storytelling over Linked Data on the Web is a challenging task in which many graph-based pathfinding approaches experience issues with consistency regarding the resulting path that leads to a story. In order to mitigate arbitrariness and increase consistency, we propose to improve the semantic relatedness of concepts mentioned in a story by increasing the relevance of links between nodes through additional domain delineation and refinement steps. On top of this, we propose the implementation of an optimized algorithm controlling the pathfinding process to obtain more homogeneous search domain and retrieve more links between adjacent hops in each path. Preliminary results indicate the potential of the proposal.

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 440.62 KB

Citation

Please use this url to cite or link to this publication:

Chicago
De Vocht, Laurens, Christian Beecks, Ruben Verborgh, Thomas Seidl, Erik Mannens, and Rik Van de Walle. 2015. “Improving Semantic Relatedness in Paths for Storytelling with Linked Data on the Web.” In Lecture Notes in Computer Science, 9341:31–35.
APA
De Vocht, L., Beecks, C., Verborgh, R., Seidl, T., Mannens, E., & Van de Walle, R. (2015). Improving semantic relatedness in paths for storytelling with linked data on the web. Lecture Notes in Computer Science (Vol. 9341, pp. 31–35). Presented at the 12th European Semantic Web Conference (ESWC).
Vancouver
1.
De Vocht L, Beecks C, Verborgh R, Seidl T, Mannens E, Van de Walle R. Improving semantic relatedness in paths for storytelling with linked data on the web. Lecture Notes in Computer Science. 2015. p. 31–5.
MLA
De Vocht, Laurens, Christian Beecks, Ruben Verborgh, et al. “Improving Semantic Relatedness in Paths for Storytelling with Linked Data on the Web.” Lecture Notes in Computer Science. Vol. 9341. 2015. 31–35. Print.
@inproceedings{8027685,
  abstract     = {Algorithmic storytelling over Linked Data on the Web is a challenging task in which many graph-based pathfinding approaches experience issues with consistency regarding the resulting path that leads to a story. In order to mitigate arbitrariness and increase consistency, we propose to improve the semantic relatedness of concepts mentioned in a story by increasing the relevance of links between nodes through additional domain delineation and refinement steps. On top of this, we propose the implementation of an optimized algorithm controlling the pathfinding process to obtain more homogeneous search domain and retrieve more links between adjacent hops in each path. Preliminary results indicate the potential of the proposal.},
  author       = {De Vocht, Laurens and Beecks, Christian and Verborgh, Ruben and Seidl, Thomas and Mannens, Erik and Van de Walle, Rik},
  booktitle    = {Lecture Notes in Computer Science},
  isbn         = {978-3-319-25638-2},
  issn         = {0302-9743},
  language     = {eng},
  location     = {Portoroz, SLOVENIA},
  pages        = {31--35},
  title        = {Improving semantic relatedness in paths for storytelling with linked data on the web},
  url          = {http://dx.doi.org/10.1007/978-3-319-25639-9\_6},
  volume       = {9341},
  year         = {2015},
}

Altmetric
View in Altmetric
Web of Science
Times cited: