How Easy Is It to Surf the Semantic Web?

Jungmin Lee, Changu Kang, Jisun Chae, Hyeonmin Park, Seongbin Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationFrontier Computing - Theory, Technologies and Applications FC 2018
EditorsJason C. Hung, Neil Y. Yen, Lin Hui
PublisherSpringer Verlag
Pages579-583
Number of pages5
ISBN (Print)9789811336478
DOIs
Publication statusPublished - 2019 Jan 1
Event6th International Conference on Frontier Computing, FC 2018 - Kuala Lumpur, Malaysia
Duration: 2018 Jul 32018 Jul 6

Publication series

NameLecture Notes in Electrical Engineering
Volume542
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference6th International Conference on Frontier Computing, FC 2018
CountryMalaysia
CityKuala Lumpur
Period18/7/318/7/6

Fingerprint

Semantic Web
World Wide Web
Ontology

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Lee, J., Kang, C., Chae, J., Park, H., & Park, S. (2019). How Easy Is It to Surf the Semantic Web? In J. C. Hung, N. Y. Yen, & L. Hui (Eds.), Frontier Computing - Theory, Technologies and Applications FC 2018 (pp. 579-583). (Lecture Notes in Electrical Engineering; Vol. 542). Springer Verlag. https://doi.org/10.1007/978-981-13-3648-5_68

How Easy Is It to Surf the Semantic Web? / Lee, Jungmin; Kang, Changu; Chae, Jisun; Park, Hyeonmin; Park, Seongbin.

Frontier Computing - Theory, Technologies and Applications FC 2018. ed. / Jason C. Hung; Neil Y. Yen; Lin Hui. Springer Verlag, 2019. p. 579-583 (Lecture Notes in Electrical Engineering; Vol. 542).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, J, Kang, C, Chae, J, Park, H & Park, S 2019, How Easy Is It to Surf the Semantic Web? in JC Hung, NY Yen & L Hui (eds), Frontier Computing - Theory, Technologies and Applications FC 2018. Lecture Notes in Electrical Engineering, vol. 542, Springer Verlag, pp. 579-583, 6th International Conference on Frontier Computing, FC 2018, Kuala Lumpur, Malaysia, 18/7/3. https://doi.org/10.1007/978-981-13-3648-5_68
Lee J, Kang C, Chae J, Park H, Park S. How Easy Is It to Surf the Semantic Web? In Hung JC, Yen NY, Hui L, editors, Frontier Computing - Theory, Technologies and Applications FC 2018. Springer Verlag. 2019. p. 579-583. (Lecture Notes in Electrical Engineering). https://doi.org/10.1007/978-981-13-3648-5_68
Lee, Jungmin ; Kang, Changu ; Chae, Jisun ; Park, Hyeonmin ; Park, Seongbin. / How Easy Is It to Surf the Semantic Web?. Frontier Computing - Theory, Technologies and Applications FC 2018. editor / Jason C. Hung ; Neil Y. Yen ; Lin Hui. Springer Verlag, 2019. pp. 579-583 (Lecture Notes in Electrical Engineering).
@inproceedings{33ac53552f96479694f8075b2bd3e5b3,
title = "How Easy Is It to Surf the Semantic Web?",
abstract = "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.",
author = "Jungmin Lee and Changu Kang and Jisun Chae and Hyeonmin Park and Seongbin Park",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-981-13-3648-5_68",
language = "English",
isbn = "9789811336478",
series = "Lecture Notes in Electrical Engineering",
publisher = "Springer Verlag",
pages = "579--583",
editor = "Hung, {Jason C.} and Yen, {Neil Y.} and Lin Hui",
booktitle = "Frontier Computing - Theory, Technologies and Applications FC 2018",

}

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

PY - 2019/1/1

Y1 - 2019/1/1

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

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

ER -