3 research outputs found
Deep Learning Framework for Online Interactive Service Recommendation in Iterative Mashup Development
Recent years have witnessed the rapid development of service-oriented
computing technologies. The boom of Web services increases the selection burden
of software developers in developing service-based systems (such as mashups).
How to recommend suitable follow-up component services to develop new mashups
has become a fundamental problem in service-oriented software engineering. Most
of the existing service recommendation approaches are designed for mashup
development in the single-round recommendation scenario. It is hard for them to
update recommendation results in time according to developers' requirements and
behaviors (e.g., instant service selection). To address this issue, we propose
a deep-learning-based interactive service recommendation framework named DLISR,
which aims to capture the interactions among the target mashup, selected
services, and the next service to recommend. Moreover, an attention mechanism
is employed in DLISR to weigh selected services when recommending the next
service. We also design two separate models for learning interactions from the
perspectives of content information and historical invocation information,
respectively, as well as a hybrid model called HISR. Experiments on a
real-world dataset indicate that HISR outperforms several state-of-the-art
service recommendation methods in the online interactive scenario for
developing new mashups iteratively.Comment: 15 pages, 6 figures, and 3 table
Minimizing inter-server communications by exploiting self-similarity in online social networks
Efficiently operating on relevant data for users in large-scale online social network (OSN) systems is a challenging problem. Storage systems used by popular OSN systems often rely on key-value stores, where randomly partitioning the data of users among servers across the data centers is the defacto standard. Although by using DHTs, the random partition scheme is highly scalable for hosting a large number of users, it leads to costly inter-server communications across data centers due to the complexity of interconnection and interaction between OSN users. In this paper, we explore how to reduce the inter-server communications by retaining the simple and robust nature of OSNs. We propose a data placement solution atop OSN systems to divide users among servers according to the interaction-locality-based structure. Our approach exploits a simple, yet powerful principle of OSN interactions, self-similarity, which reveals that the inter-server communication cost is minimized under such intrinsic structure. Our algorithm avoids a significant amount of inter-server traffic as well as achieves load balance among servers across the data centers. We demonstrate the existence of self-similarity in large-scale Facebook traces including 10 million Facebook users and 24 million interaction events. We conduct comprehensive trace-driven simulations to evaluate this design exploiting the unique feature of self-similarity. Results show that our scheme significantly reduces the traffic and latency of the existing schemes