Goal-Driven Context-Aware Next Service Recommendation for Mashup Composition

• URL: http://arxiv.org/abs/2210.14127v1
• Date: Tue, 25 Oct 2022 16:24:21 GMT
• Title: Goal-Driven Context-Aware Next Service Recommendation for Mashup Composition
• Authors: Xihao Xie, Jia Zhang, Rahul Ramachandran, Tsengdar J. Lee and Seungwon Lee
• Abstract summary: Service discovery and recommendation has attracted significant momentum in both academia and industry. This paper proposes a novel incremental recommend-as-you-go approach to recommending next potential service based on the context of a mashup under construction.
• Score: 6.17189383632496
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As service-oriented architecture becoming one of the most prevalent techniques to rapidly deliver functionalities to customers, increasingly more reusable software components have been published online in forms of web services. To create a mashup, it gets not only time-consuming but also error-prone for developers to find suitable services from such a sea of services. Service discovery and recommendation has thus attracted significant momentum in both academia and industry. This paper proposes a novel incremental recommend-as-you-go approach to recommending next potential service based on the context of a mashup under construction, considering services that have been selected to the current step as well as its mashup goal. The core technique is an algorithm of learning the embedding of services, which learns their past goal-driven context-aware decision making behaviors in addition to their semantic descriptions and co-occurrence history. A goal exclusionary negative sampling mechanism tailored for mashup development is also developed to improve training performance. Extensive experiments on a real-world dataset demonstrate the effectiveness of our approach.

Related papers

• Learning Service Selection Decision Making Behaviors During Scientific Workflow Development [3.341965553962658]
  In this paper, a novel context-aware approach is proposed to recommending next services in a workflow development process. The problem of next service recommendation is mapped to next word prediction. Experiments on a real-word repository have demonstrated the effectiveness of this approach.
  arXiv  Detail & Related papers  (2024-03-30T16:58:42Z)
• EASRec: Elastic Architecture Search for Efficient Long-term Sequential Recommender Systems [82.76483989905961]
  Current Sequential Recommender Systems (SRSs) suffer from computational and resource inefficiencies. We develop the Elastic Architecture Search for Efficient Long-term Sequential Recommender Systems (EASRec) EASRec introduces data-aware gates that leverage historical information from input data batch to improve the performance of the recommendation network.
  arXiv  Detail & Related papers  (2024-02-01T07:22:52Z)
• QoS-Aware Graph Contrastive Learning for Web Service Recommendation [3.130026754572506]
  This study aims to address the challenges of data sparsity and the cold-start problem in web service recommendation using Quality of Service (QoS) Our model harnesses the power of graph contrastive learning to handle cold-start problems and improve accuracy effectively. Our research contributes to the potential for more accurate recommendations in real-world scenarios, even with limited user-service interaction data.
  arXiv  Detail & Related papers  (2024-01-06T08:36:04Z)
• A Survey on Service Route and Time Prediction in Instant Delivery: Taxonomy, Progress, and Prospects [58.746820564288846]
  Route&Time Prediction (RTP) aims to estimate the future service route as well as the arrival time of a worker. Despite a plethora of algorithms developed to date, there is no systematic, comprehensive survey to guide researchers in this domain. We categorize these methods based on three criteria: (i) type of task, subdivided into only-route prediction, only-time prediction, and joint route&time prediction; (ii) model architecture, which encompasses sequence-based and graph-based models; and (iii) learning paradigm, including Supervised Learning (SL) and Deep Reinforcement
  arXiv  Detail & Related papers  (2023-09-03T14:43:33Z)
• Exploring Large Language Model for Graph Data Understanding in Online Job Recommendations [63.19448893196642]
  We present a novel framework that harnesses the rich contextual information and semantic representations provided by large language models to analyze behavior graphs. By leveraging this capability, our framework enables personalized and accurate job recommendations for individual users.
  arXiv  Detail & Related papers  (2023-07-10T11:29:41Z)
• Exploring Attention-Aware Network Resource Allocation for Customized Metaverse Services [69.37584804990806]
  We design an attention-aware network resource allocation scheme to achieve customized Metaverse services. The aim is to allocate more network resources to virtual objects in which users are more interested.
  arXiv  Detail & Related papers  (2022-07-31T06:04:15Z)
• Learning Context-Aware Service Representation for Service Recommendation in Workflow Composition [6.17189383632496]
  This paper proposes a novel NLP-inspired approach to recommending services throughout a workflow development process. A workflow composition process is formalized as a step-wise, context-aware service generation procedure. Service embeddings are then learned by applying deep learning model from the NLP field.
  arXiv  Detail & Related papers  (2022-05-24T04:18:01Z)
• Nemo: Guiding and Contextualizing Weak Supervision for Interactive Data Programming [77.38174112525168]
  We present Nemo, an end-to-end interactive Supervision system that improves overall productivity of WS learning pipeline by an average 20% (and up to 47% in one task) compared to the prevailing WS supervision approach.
  arXiv  Detail & Related papers  (2022-03-02T19:57:32Z)
• A Deep Reinforcement Learning Approach for Composing Moving IoT Services [0.12891210250935145]
  We introduce a moving crowdsourced service model which is modelled as a moving region. We propose a deep reinforcement learning-based composition approach to select and compose moving IoT services. The experiments on two real-world datasets verify the effectiveness and efficiency of the deep reinforcement learning-based approach.
  arXiv  Detail & Related papers  (2021-11-06T22:02:31Z)
• A Privacy-Preserving Distributed Architecture for Deep-Learning-as-a-Service [68.84245063902908]
  This paper introduces a novel distributed architecture for deep-learning-as-a-service. It is able to preserve the user sensitive data while providing Cloud-based machine and deep learning services.
  arXiv  Detail & Related papers  (2020-03-30T15:12:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.