On the topological landscape of Web services matchmaking

Hyunyoung Kil, Seog Chan Oh, Dongwon Lee

Research output: Contribution to journalConference article

10 Citations (Scopus)

Abstract

Despite the rapid development in web services technologies, there has been little study on the public web services from network analysis perspective. To address this, in this paper, we have performed a topological study on various web service networks using real-world data sets. We first propose a flexible framework by which we can study semantic web services network "matchmaking" in a unified manner. Under the matching framework, then, we have conducted extensive experiments to study the characteristics of various web services networks. By and large, publicly available web services networks exhibit the typical characteristics of small world networks well and power law like distributions to some extent.

Original languageEnglish (US)
Pages (from-to)19-34
Number of pages16
JournalCEUR Workshop Proceedings
Volume178
StatePublished - Dec 1 2006
Event1st International Workshop on Semantic Matchmaking and Resource Retrieval, SMR 2006 - Co-located with 32nd International Conference on Very Large Data Bases, VLDB 2006 - Seoul, Korea, Republic of
Duration: Sep 11 2006Sep 11 2006

Fingerprint

Web services
Small-world networks
Semantic Web
Electric network analysis
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Kil, Hyunyoung ; Oh, Seog Chan ; Lee, Dongwon. / On the topological landscape of Web services matchmaking. In: CEUR Workshop Proceedings. 2006 ; Vol. 178. pp. 19-34.
@article{2d76d60c7d824e2082f0cc922703c353,
title = "On the topological landscape of Web services matchmaking",
abstract = "Despite the rapid development in web services technologies, there has been little study on the public web services from network analysis perspective. To address this, in this paper, we have performed a topological study on various web service networks using real-world data sets. We first propose a flexible framework by which we can study semantic web services network {"}matchmaking{"} in a unified manner. Under the matching framework, then, we have conducted extensive experiments to study the characteristics of various web services networks. By and large, publicly available web services networks exhibit the typical characteristics of small world networks well and power law like distributions to some extent.",
author = "Hyunyoung Kil and Oh, {Seog Chan} and Dongwon Lee",
year = "2006",
month = "12",
day = "1",
language = "English (US)",
volume = "178",
pages = "19--34",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

On the topological landscape of Web services matchmaking. / Kil, Hyunyoung; Oh, Seog Chan; Lee, Dongwon.

In: CEUR Workshop Proceedings, Vol. 178, 01.12.2006, p. 19-34.

Research output: Contribution to journalConference article

TY - JOUR

T1 - On the topological landscape of Web services matchmaking

AU - Kil, Hyunyoung

AU - Oh, Seog Chan

AU - Lee, Dongwon

PY - 2006/12/1

Y1 - 2006/12/1

N2 - Despite the rapid development in web services technologies, there has been little study on the public web services from network analysis perspective. To address this, in this paper, we have performed a topological study on various web service networks using real-world data sets. We first propose a flexible framework by which we can study semantic web services network "matchmaking" in a unified manner. Under the matching framework, then, we have conducted extensive experiments to study the characteristics of various web services networks. By and large, publicly available web services networks exhibit the typical characteristics of small world networks well and power law like distributions to some extent.

AB - Despite the rapid development in web services technologies, there has been little study on the public web services from network analysis perspective. To address this, in this paper, we have performed a topological study on various web service networks using real-world data sets. We first propose a flexible framework by which we can study semantic web services network "matchmaking" in a unified manner. Under the matching framework, then, we have conducted extensive experiments to study the characteristics of various web services networks. By and large, publicly available web services networks exhibit the typical characteristics of small world networks well and power law like distributions to some extent.

UR - http://www.scopus.com/inward/record.url?scp=84884370090&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84884370090&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:84884370090

VL - 178

SP - 19

EP - 34

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -