In this paper, we report our ongoing project about the issue of the navigability of the Semantic Web which refers to whether users can find desired information while they surf the Semantic Web. To this end, we model the Semantic Web as a space that is a sequence of words over which hyperlinks are added so that relevant words can be connected by hyperlinks according to an ontology. Users can follow hyperlinks in order to find a pattern which is a sequence of words. In order to show the navigability of the Semantic Web compared to the World Wide Web (WWW), we define a space for the WWW similarly and calculate the maximum number of steps taken to find a pattern in both spaces. It turns out that it takes fewer number of steps to find a pattern in the space for the Semantic Web than in the space for the WWW.
|Title of host publication
|Frontier Computing - Theory, Technologies and Applications FC 2018
|Jason C. Hung, Neil Y. Yen, Lin Hui
|Number of pages
|Published - 2019
|6th International Conference on Frontier Computing, FC 2018 - Kuala Lumpur, Malaysia
Duration: 2018 Jul 3 → 2018 Jul 6
|Lecture Notes in Electrical Engineering
|6th International Conference on Frontier Computing, FC 2018
|18/7/3 → 18/7/6
Bibliographical noteFunding Information:
Acknowledgements. This research was supported by the Korean MSIT (Ministry of Science and ICT), under the National Program for Excellence in SW (2015-0-00936) supervised by the IITP (Institute for Information and communications Technology Promotion).
© 2019, Springer Nature Singapore Pte Ltd.
Copyright 2019 Elsevier B.V., All rights reserved.
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering