Social Web Mashups Full Completion via Frequent Sequence Mining

Abderrahmane Maaradji (1) , Hakim Hacid (2) , Ryan Skraba (1) , Athena Vakali (3)

1 Alcatel Lucent Bell Labs
2 Alcatel-Lucent Bell Labs France [Nozay]
3 Aristotle University of Thessaloniki

In this paper we address the problem of Web Mashups full completion which consists of predicting the most suitable set of (combined) services that successfully meet the goals of an end-user Mashup, given the current service (or composition of services) initially supplied. We model full completion as a frequent sequence mining problem and we show how existing algorithms can be applied in this context. To overcome some limitations of the frequent sequence mining algorithms, e.g., efficiency and recommendation granularity, we propose FESMA, a new and efficient algorithm for computing frequent sequences of services and recommending completions. FESMA also integrates a social dimension, extracted from the transformation of user-service interactions into user-user interactions, building an implicit graph that helps to better predict completions of services in a fashion tailored to individual users. Evaluations show that FESMA is more efficient outperforming the existing algorithms even with the consideration of the social dimension. Our proposal has been implemented in a prototype, SoCo, developed at Bell Labs.

Domaines: Web

Abderrahmane Maaradji, Hakim Hacid, Ryan Skraba, Athena Vakali. Social Web Mashups Full Completion via Frequent Sequence Mining. The 7th IEEE 2011 World Congress on Services (SERVICES 2011), Washington DC,USA, July 2011, 2011, http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6012680. ⟨10.1109/SERVICES.2011.98⟩. ⟨hal-00632947⟩