Social Web Mashups Full Completion via Frequent Sequence Mining

TitleSocial Web Mashups Full Completion via Frequent Sequence Mining
Publication TypeConference Paper
Year of Publication2011
AuthorsMaaradji, Abderrahmane, Hakim Hacid, Ryan Skraba, and Athena Vakali
PublisherIEEE Computer Society
ISBN Number978-1-4577-0879-4
KeywordsMashups, Sequence mining, Social networks, Web services

In this paper we address the problem of WebMashups full completion which consists of predicting themost suitable set of (combined) services that successfully meetthe goals of an end-user Mashup, given the current service(or composition of services) initially supplied. We model fullcompletion as a frequent sequence mining problem and weshow how existing algorithms can be applied in this context.To overcome some limitations of the frequent sequence miningalgorithms, e.g., efficiency and recommendation granularity,we propose FESMA, a new and efficient algorithm for computingfrequent sequences of services and recommending completions.FESMA also integrates a social dimension, extractedfrom the transformation of user ? service interactions intouser ? user interactions, building an implicit graph thathelps to better predict completions of services in a fashiontailored to individual users. Evaluations show that FESMAis more efficient outperforming the existing algorithms evenwith the consideration of the social dimension. Our proposalhas been implemented in a prototype, SoCo, developed at BellLabs.


auth logo

Location & Contact

Department of Informatics
Aristotle University of Thessaloniki
Thessaloniki GR-54124

t  | (+30) 2310 998415
e |