WARBERT: A Hierarchical BERT-based Model for Web API Recommendation

• URL: http://arxiv.org/abs/2509.23175v1
• Date: Sat, 27 Sep 2025 08:09:41 GMT
• Title: WARBERT: A Hierarchical BERT-based Model for Web API Recommendation
• Authors: Zishuo Xu, Yuhong Gu, Dezhong Yao,
• Abstract summary: WARBERT is a hierarchical BERT-based model for Web API recommendation.<n> WARBERT leverages dual-component feature fusion and attention comparison to extract precise semantic representations of API and mashup descriptions.<n> WARBERT achieves improvements of up to 11.7% compared to existing solutions.
• Score: 4.591441870423474
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: With the emergence of Web 2.0 and microservices architecture, the number of Web APIs has increased dramatically, further intensifying the demand for efficient Web API recommendation. Existing solutions typically fall into two categories: recommendation-type methods, which treat each API as a label for classification, and match-type methods, which focus on matching mashups through API retrieval. However, three critical challenges persist: 1) the semantic ambiguities in comparing API and mashup descriptions, 2) the lack of detailed comparisons between the individual API and the mashup in recommendation-type methods, and 3) time inefficiencies for API retrieval in match-type methods. To address these challenges, we propose WARBERT, a hierarchical BERT-based model for Web API recommendation. WARBERT leverages dual-component feature fusion and attention comparison to extract precise semantic representations of API and mashup descriptions. WARBERT consists of two main components: WARBERT(R) for Recommendation and WARBERT(M) for Matching. Specifically, WAR-BERT(R) serves as an initial filter, narrowing down the candidate APIs, while WARBERT(M) refines the matching process by calculating the similarity between candidate APIs and mashup. The final likelihood of a mashup being matched with an API is determined by combining the predictions from WARBERT(R) and WARBERT(M). Additionally, WARBERT(R) incorporates an auxiliary task of mashup category judgment, which enhances its effectiveness in candidate selection. Experimental results on the ProgrammableWeb dataset demonstrate that WARBERT outperforms most existing solutions and achieves improvements of up to 11.7% compared to the model MTFM (Multi-Task Fusion Model), delivering significant enhancements in accuracy and effiency.

Related papers

• WAR-Re: Web API Recommendation with Semantic Reasoning [8.893397992271396]
  WAR-Re is an LLM-based model for Web API recommendation with semantic reasoning for justification.<n> WAR-Re achieves a gain of up to 21.59% over the state-of-the-art baseline model in recommendation accuracy.
  arXiv  Detail & Related papers  (2025-11-08T03:09:31Z)
• Generating Accurate OpenAPI Descriptions from Java Source Code [42.02451453254076]
  AutoOAS detects exposed REST endpoint paths, corresponding HTTP methods, HTTP response codes, and the data models of request parameters and responses directly from Java source code. Based on a manually created ground truth, AutoOAS achieved the highest precision and recall when identifying REST endpoint paths, HTTP methods, parameters, and responses.
  arXiv  Detail & Related papers  (2024-10-31T12:34:35Z)
• MCBA: A Matroid Constraint-Based Approach for Composite Service Recommendation Considering Compatibility and Diversity [9.17544142889514]
  This paper introduces a Matroid Constraint-Based Approach (MCBA) for composite service recommendation. In the first stage, the API composition issue is formulated as a minimal group Steiner tree (M GST) problem. In the second stage, a Marginal Relevance method under partition matroid constraints (MMR-PMC) is employed to ensure recommendation diversity.
  arXiv  Detail & Related papers  (2024-09-03T04:46:02Z)
• ToolACE: Winning the Points of LLM Function Calling [139.07157814653638]
  ToolACE is an automatic agentic pipeline designed to generate accurate, complex, and diverse tool-learning data.<n>We demonstrate that models trained on our synthesized data, even with only 8B parameters, achieve state-of-the-art performance on the Berkeley Function-Calling Leaderboard.
  arXiv  Detail & Related papers  (2024-09-02T03:19:56Z)
• FANTAstic SEquences and Where to Find Them: Faithful and Efficient API Call Generation through State-tracked Constrained Decoding and Reranking [57.53742155914176]
  API call generation is the cornerstone of large language models' tool-using ability. Existing supervised and in-context learning approaches suffer from high training costs, poor data efficiency, and generated API calls that can be unfaithful to the API documentation and the user's request. We propose an output-side optimization approach called FANTASE to address these limitations.
  arXiv  Detail & Related papers  (2024-07-18T23:44:02Z)
• Beyond Two-Tower Matching: Learning Sparse Retrievable Cross-Interactions for Recommendation [80.19762472699814]
  Two-tower models are a prevalent matching framework for recommendation, which have been widely deployed in industrial applications. It suffers two main challenges, including limited feature interaction capability and reduced accuracy in online serving. We propose a new matching paradigm named SparCode, which supports not only sophisticated feature interactions but also efficient retrieval.
  arXiv  Detail & Related papers  (2023-11-30T03:13:36Z)
• APICom: Automatic API Completion via Prompt Learning and Adversarial Training-based Data Augmentation [6.029137544885093]
  API recommendation is the process of assisting developers in finding the required API among numerous candidate APIs. Previous studies mainly modeled API recommendation as the recommendation task, and developers may not yet be able to find what they need. Motivated by the neural machine translation research domain, we can model this problem as the generation task. We propose a novel approach APICom based on prompt learning, which can generate API related to the query according to the prompts.
  arXiv  Detail & Related papers  (2023-09-13T15:31:50Z)
• Adaptive REST API Testing with Reinforcement Learning [54.68542517176757]
  Current testing tools lack efficient exploration mechanisms, treating all operations and parameters equally. Current tools struggle when response schemas are absent in the specification or exhibit variants. We present an adaptive REST API testing technique incorporates reinforcement learning to prioritize operations during exploration.
  arXiv  Detail & Related papers  (2023-09-08T20:27:05Z)
• Evaluating Embedding APIs for Information Retrieval [51.24236853841468]
  We evaluate the capabilities of existing semantic embedding APIs on domain generalization and multilingual retrieval. We find that re-ranking BM25 results using the APIs is a budget-friendly approach and is most effective in English. For non-English retrieval, re-ranking still improves the results, but a hybrid model with BM25 works best, albeit at a higher cost.
  arXiv  Detail & Related papers  (2023-05-10T16:40:52Z)
• Diversity-aware Web APIs Recommendation with Compatibility Guarantee [5.9601266637512085]
  We propose a Diversity-aware and Compatibility-driven web APIs Recommendation approach, namely DivCAR. DivCAR employs random walk sampling technique on a pre-built correlation graph to generate diverse correlation subgraphs. With the diverse correlation subgraphs, we model the compatible web APIs recommendation problem to be a minimum group Steiner tree search problem.
  arXiv  Detail & Related papers  (2021-08-10T00:20:34Z)
• FrugalMCT: Efficient Online ML API Selection for Multi-Label Classification Tasks [27.35907550712252]
  Multi-label classification tasks such as OCR are a major focus of the growing machine learning as a service industry. We propose FrugalMCT, a principled framework that adaptively selects the APIs to use for different data in an online fashion while respecting user's budget. We conduct systematic experiments using ML APIs from Google, Microsoft, Amazon, IBM, Tencent and other providers for tasks including multi-label image classification, scene text recognition and named entity recognition.
  arXiv  Detail & Related papers  (2021-02-18T02:59:58Z)
• AutoRC: Improving BERT Based Relation Classification Models via Architecture Search [50.349407334562045]
  BERT based relation classification (RC) models have achieved significant improvements over the traditional deep learning models. No consensus can be reached on what is the optimal architecture. We design a comprehensive search space for BERT based RC models and employ neural architecture search (NAS) method to automatically discover the design choices.
  arXiv  Detail & Related papers  (2020-09-22T16:55:49Z)

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.