TY - GEN
T1 - Socially-enriched semantic mashup of web APIs
AU - Jung, Jooik
AU - Lee, Kyong Ho
PY - 2012
Y1 - 2012
N2 - As Web mashups are becoming one of the salient tools for providing composite services that satisfy users' requests, there have been many endeavors to enhance the process of recommending the most adequate mashup to users. However, previous approaches show numerous pitfalls such as the problem of cold-start, and the lack of utilization of social information as well as functional properties of Web APIs and mashups. All these factors undoubtedly hinder the proliferation of mashup users as locating the most appropriate mashup becomes a cumbersome task. In order to resolve the issues, we propose an efficient method of recommending mashups based on the functional and social features of Web APIs. Specifically, the proposed method utilizes the social and functional relationships among Web APIs to produce and recommend the chains of candidate mashups. Experimental results with a real world data set show a precision of 86.9% and a recall of 75.2% on average, which validates that the proposed method performs more efficiently for various kinds of user requests as compared to a previous work.
AB - As Web mashups are becoming one of the salient tools for providing composite services that satisfy users' requests, there have been many endeavors to enhance the process of recommending the most adequate mashup to users. However, previous approaches show numerous pitfalls such as the problem of cold-start, and the lack of utilization of social information as well as functional properties of Web APIs and mashups. All these factors undoubtedly hinder the proliferation of mashup users as locating the most appropriate mashup becomes a cumbersome task. In order to resolve the issues, we propose an efficient method of recommending mashups based on the functional and social features of Web APIs. Specifically, the proposed method utilizes the social and functional relationships among Web APIs to produce and recommend the chains of candidate mashups. Experimental results with a real world data set show a precision of 86.9% and a recall of 75.2% on average, which validates that the proposed method performs more efficiently for various kinds of user requests as compared to a previous work.
UR - http://www.scopus.com/inward/record.url?scp=84868343375&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84868343375&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-34321-6_26
DO - 10.1007/978-3-642-34321-6_26
M3 - Conference contribution
AN - SCOPUS:84868343375
SN - 9783642343209
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 389
EP - 403
BT - Service-Oriented Computing - 10th International Conference, ICSOC 2012, Proceedings
PB - Springer Verlag
T2 - 10th International Conference on Service-Oriented Computing, ICSOC 2012
Y2 - 12 November 2012 through 15 November 2012
ER -