Diversity-aware Web APIs Recommendation with Compatibility Guarantee
- URL: http://arxiv.org/abs/2108.04389v1
- Date: Tue, 10 Aug 2021 00:20:34 GMT
- Title: Diversity-aware Web APIs Recommendation with Compatibility Guarantee
- Authors: Wenwen Gonga, Yulan Zhang, Xuyun Zhang, Yucong Duan, Yawei Wang, Yifei
Chena and Lianyong Qi
- Abstract summary: 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.
- Score: 5.9601266637512085
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: With the ever-increasing prevalence of web APIs (Application Programming
Interfaces) in enabling smart software developments, finding and composing a
list of existing web APIs that can corporately fulfil the software developers'
functional needs have become a promising way to develop a successful mobile
app, economically and conveniently. However, the big volume and diversity of
candidate web APIs put additional burden on the app developers' web APIs
selection decision-makings, since it is often a challenging task to
simultaneously guarantee the diversity and compatibility of the finally
selected a set of web APIs. Considering this challenge, a Diversity-aware and
Compatibility-driven web APIs Recommendation approach, namely DivCAR, is put
forward in this paper. First, to achieve diversity, DivCAR employs random walk
sampling technique on a pre-built correlation graph to generate diverse
correlation subgraphs. Afterwards, with the diverse correlation subgraphs, we
model the compatible web APIs recommendation problem to be a minimum group
Steiner tree search problem. Through solving the minimum group Steiner tree
search problem, manifold sets of compatible and diverse web APIs ranked are
returned to the app developers. At last, we design and enact a set of
experiments on a real-world dataset crawled from www.programmableWeb.com.
Experimental results validate the effectiveness and efficiency of our proposed
DivCAR approach in balancing the web APIs recommendation diversity and
compatibility.
Related papers
- 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) - Tree Search for Language Model Agents [69.43007235771383]
We propose an inference-time search algorithm for LM agents to perform exploration and multi-step planning in interactive web environments.
Our approach is a form of best-first tree search that operates within the actual environment space.
It is the first tree search algorithm for LM agents that shows effectiveness on realistic web tasks.
arXiv Detail & Related papers (2024-07-01T17:07:55Z) - 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) - Mirror: A Universal Framework for Various Information Extraction Tasks [28.43708291298155]
We propose a universal framework for various IE tasks, namely Mirror.
We recast existing IE tasks as a multi-span cyclic graph extraction problem and devise a non-autoregressive graph decoding algorithm.
Our model has decent compatibility and outperforms or reaches competitive performance with SOTA systems.
arXiv Detail & Related papers (2023-11-09T14:58:46Z) - 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) - Enhancing API Documentation through BERTopic Modeling and Summarization [0.0]
This paper focuses on the complexities of interpreting Application Programming Interface (API) documentation.
Official API documentation serves as a primary source of information for developers, but it can often be extensive and lacks user-friendliness.
Our novel approach employs the strengths of BERTopic for topic modeling and Natural Language Processing (NLP) to automatically generate summaries of API documentation.
arXiv Detail & Related papers (2023-08-17T15:57:12Z) - 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) - UKP-SQUARE: An Online Platform for Question Answering Research [50.35348764297317]
We present UKP-SQUARE, an online QA platform for researchers which allows users to query and analyze a large collection of modern Skills.
UKP-SQUARE allows users to query and analyze a large collection of modern Skills via a user-friendly web interface and integrated tests.
arXiv Detail & Related papers (2022-03-25T15:00:24Z) - Towards API Testing Across Cloud and Edge [1.6930453121661675]
API economy is driving the digital transformation of business applications across the hybrid Cloud and edge environments.
We envision a test framework named Distributed Software Test Kit (DSTK) to handle this challenge.
arXiv Detail & Related papers (2021-09-06T15:27:36Z) - 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) - Mining Implicit Relevance Feedback from User Behavior for Web Question
Answering [92.45607094299181]
We make the first study to explore the correlation between user behavior and passage relevance.
Our approach significantly improves the accuracy of passage ranking without extra human labeled data.
In practice, this work has proved effective to substantially reduce the human labeling cost for the QA service in a global commercial search engine.
arXiv Detail & Related papers (2020-06-13T07:02:08Z)
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.