TY - GEN
T1 - How Easy Is It to Surf the Semantic Web?
AU - Lee, Jungmin
AU - Kang, Changu
AU - Chae, Jisun
AU - Park, Hyeonmin
AU - Park, Seongbin
N1 - Funding 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).
Publisher Copyright:
© 2019, Springer Nature Singapore Pte Ltd.
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85066052363&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85066052363&partnerID=8YFLogxK
U2 - 10.1007/978-981-13-3648-5_68
DO - 10.1007/978-981-13-3648-5_68
M3 - Conference contribution
AN - SCOPUS:85066052363
SN - 9789811336478
T3 - Lecture Notes in Electrical Engineering
SP - 579
EP - 583
BT - Frontier Computing - Theory, Technologies and Applications FC 2018
A2 - Hung, Jason C.
A2 - Yen, Neil Y.
A2 - Hui, Lin
PB - Springer Verlag
T2 - 6th International Conference on Frontier Computing, FC 2018
Y2 - 3 July 2018 through 6 July 2018
ER -