WS-finder

A framework for similarity search of web services

Jiangang Ma, Quan Z. Sheng, Kewen Liao, Yanchun Zhang, Anne H.H. Ngu

Research output: Chapter in Book/Report/Conference proceedingConference Paper published in ProceedingsResearchpeer-review

Abstract

Most existing Web service search engines employ keyword search over databases, which computes the distance between the query and the Web services over a fixed set of features. Such an approach often results in incompleteness of search results. The Earth Mover's Distance (EMD) has been successfully used in multimedia databases due to its ability to capture the differences between two distributions. However, calculating EMD is computationally intensive. In this paper, we present a novel framework calledWS-Finder, which improves the existing keywordbased search techniques for Web services. In particular, we employ EMD for many-to-many partial matching between the contents of the query and the service attributes. We also develop a generalized minimization lower bound as a new EMD filter for partial matching. This new EMD filter is then combined to a k-NN algorithm for producing complete top-k search results. Furthermore, we theoretically and empirically show that WS-Finder is able to produce query answers effectively and efficiently.

Original languageEnglish
Title of host publicationService-Oriented Computing - 10th International Conference, ICSOC 2012, Proceedings
EditorsC Liu, H Ludwig, F Toumani, Q Yu
PublisherSpringer-Verlag London Ltd.
Pages313-327
Number of pages15
Volume7638
ISBN (Print)9783642343209
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event10th International Conference on Service-Oriented Computing, ICSOC 2012 - Shanghai, China
Duration: 12 Nov 201215 Nov 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7636 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Conference on Service-Oriented Computing, ICSOC 2012
CountryChina
CityShanghai
Period12/11/1215/11/12

Fingerprint

Similarity Search
Web services
Web Services
Earth (planet)
Query
Filter
Multimedia Databases
Many to many
Partial
Search engines
Keyword Search
Incompleteness
Search Engine
Framework
Attribute
Lower bound

Cite this

Ma, J., Sheng, Q. Z., Liao, K., Zhang, Y., & Ngu, A. H. H. (2012). WS-finder: A framework for similarity search of web services. In C. Liu, H. Ludwig, F. Toumani, & Q. Yu (Eds.), Service-Oriented Computing - 10th International Conference, ICSOC 2012, Proceedings (Vol. 7638, pp. 313-327). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7636 LNCS). Springer-Verlag London Ltd.. https://doi.org/10.1007/978-3-642-34321-6_21
Ma, Jiangang ; Sheng, Quan Z. ; Liao, Kewen ; Zhang, Yanchun ; Ngu, Anne H.H. / WS-finder : A framework for similarity search of web services. Service-Oriented Computing - 10th International Conference, ICSOC 2012, Proceedings. editor / C Liu ; H Ludwig ; F Toumani ; Q Yu. Vol. 7638 Springer-Verlag London Ltd., 2012. pp. 313-327 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{50f7402999b8469fbbf90a1957bb9849,
title = "WS-finder: A framework for similarity search of web services",
abstract = "Most existing Web service search engines employ keyword search over databases, which computes the distance between the query and the Web services over a fixed set of features. Such an approach often results in incompleteness of search results. The Earth Mover's Distance (EMD) has been successfully used in multimedia databases due to its ability to capture the differences between two distributions. However, calculating EMD is computationally intensive. In this paper, we present a novel framework calledWS-Finder, which improves the existing keywordbased search techniques for Web services. In particular, we employ EMD for many-to-many partial matching between the contents of the query and the service attributes. We also develop a generalized minimization lower bound as a new EMD filter for partial matching. This new EMD filter is then combined to a k-NN algorithm for producing complete top-k search results. Furthermore, we theoretically and empirically show that WS-Finder is able to produce query answers effectively and efficiently.",
author = "Jiangang Ma and Sheng, {Quan Z.} and Kewen Liao and Yanchun Zhang and Ngu, {Anne H.H.}",
year = "2012",
doi = "10.1007/978-3-642-34321-6_21",
language = "English",
isbn = "9783642343209",
volume = "7638",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag London Ltd.",
pages = "313--327",
editor = "C Liu and H Ludwig and F Toumani and Q Yu",
booktitle = "Service-Oriented Computing - 10th International Conference, ICSOC 2012, Proceedings",
address = "Germany",

}

Ma, J, Sheng, QZ, Liao, K, Zhang, Y & Ngu, AHH 2012, WS-finder: A framework for similarity search of web services. in C Liu, H Ludwig, F Toumani & Q Yu (eds), Service-Oriented Computing - 10th International Conference, ICSOC 2012, Proceedings. vol. 7638, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7636 LNCS, Springer-Verlag London Ltd., pp. 313-327, 10th International Conference on Service-Oriented Computing, ICSOC 2012, Shanghai, China, 12/11/12. https://doi.org/10.1007/978-3-642-34321-6_21

WS-finder : A framework for similarity search of web services. / Ma, Jiangang; Sheng, Quan Z.; Liao, Kewen; Zhang, Yanchun; Ngu, Anne H.H.

Service-Oriented Computing - 10th International Conference, ICSOC 2012, Proceedings. ed. / C Liu; H Ludwig; F Toumani; Q Yu. Vol. 7638 Springer-Verlag London Ltd., 2012. p. 313-327 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7636 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference Paper published in ProceedingsResearchpeer-review

TY - GEN

T1 - WS-finder

T2 - A framework for similarity search of web services

AU - Ma, Jiangang

AU - Sheng, Quan Z.

AU - Liao, Kewen

AU - Zhang, Yanchun

AU - Ngu, Anne H.H.

PY - 2012

Y1 - 2012

N2 - Most existing Web service search engines employ keyword search over databases, which computes the distance between the query and the Web services over a fixed set of features. Such an approach often results in incompleteness of search results. The Earth Mover's Distance (EMD) has been successfully used in multimedia databases due to its ability to capture the differences between two distributions. However, calculating EMD is computationally intensive. In this paper, we present a novel framework calledWS-Finder, which improves the existing keywordbased search techniques for Web services. In particular, we employ EMD for many-to-many partial matching between the contents of the query and the service attributes. We also develop a generalized minimization lower bound as a new EMD filter for partial matching. This new EMD filter is then combined to a k-NN algorithm for producing complete top-k search results. Furthermore, we theoretically and empirically show that WS-Finder is able to produce query answers effectively and efficiently.

AB - Most existing Web service search engines employ keyword search over databases, which computes the distance between the query and the Web services over a fixed set of features. Such an approach often results in incompleteness of search results. The Earth Mover's Distance (EMD) has been successfully used in multimedia databases due to its ability to capture the differences between two distributions. However, calculating EMD is computationally intensive. In this paper, we present a novel framework calledWS-Finder, which improves the existing keywordbased search techniques for Web services. In particular, we employ EMD for many-to-many partial matching between the contents of the query and the service attributes. We also develop a generalized minimization lower bound as a new EMD filter for partial matching. This new EMD filter is then combined to a k-NN algorithm for producing complete top-k search results. Furthermore, we theoretically and empirically show that WS-Finder is able to produce query answers effectively and efficiently.

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

U2 - 10.1007/978-3-642-34321-6_21

DO - 10.1007/978-3-642-34321-6_21

M3 - Conference Paper published in Proceedings

SN - 9783642343209

VL - 7638

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 313

EP - 327

BT - Service-Oriented Computing - 10th International Conference, ICSOC 2012, Proceedings

A2 - Liu, C

A2 - Ludwig, H

A2 - Toumani, F

A2 - Yu, Q

PB - Springer-Verlag London Ltd.

ER -

Ma J, Sheng QZ, Liao K, Zhang Y, Ngu AHH. WS-finder: A framework for similarity search of web services. In Liu C, Ludwig H, Toumani F, Yu Q, editors, Service-Oriented Computing - 10th International Conference, ICSOC 2012, Proceedings. Vol. 7638. Springer-Verlag London Ltd. 2012. p. 313-327. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-34321-6_21