检索结果-内蒙古大学图书馆

International Conference on Computer Supported Cooperative Work in Design

作者： Wanjun Chen Qiqi Chen Jiexun Shen Guosheng Kang Jianxun Liu Buqing Cao Lihong Zhang School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the advance of service computing technology, the number of Web APIs has risen dramatically over the Internet. Users tend to use Web APIs to achieve their business needs. However, it is difficult for users to find and select the desirable ones due to the plethora of Web APIs. To address this problem, some collab.rative filtering-based Web API recommendation methods have been proposed even though their performance is still far from satisfaction, since they only rely on Mashup-API interactions and feature interactions are not considered in the recommendation model. To further improve the recommendation performance, this paper proposes an interactive Web API recommendation method via exploring both Mashup-API interactions and functional description documents of Mashups and Web APIs. Specifically, LightGCN is employed to derive the node representations for the Mashup-API interaction graph, and BERT model is used for the text representations of functional description documents. Furthermore, the two presentations of both the Mashup and Web API are concatenated as the input of ANFM (Attentional Neural Factorization Machine) model, in which low and high-order feature interactions are fully modeled and the weights of feature interactions are trained by attention mechanism. Solid experiments are conducted over a real-world dataset and the experimental results indicate that the proposed method outperforms the baseline methods.

关键词： Attention mechanisms Federated learning Mashups Computational modeling Semantics Neural networks Service computing

来源：评论

学校读者我要写书评

暂无评论

Crawling and Exploring RESTful Web APIs from RapidAPI 17th

Crawling and Exploring RESTful Web APIs from RapidAPI

引用

CCF 17th International Conference on Service Science, CCF ICSS 2024

作者： Li, Wen Ren, Hongshuai Nie, Yamei Liu, Zihao Kang, Guosheng Liu, Jianxun Peng, Zhenlian School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (纸本)9789819757596

RapidAPI serves as a marketplace and management platform that integrates a wide range of Web APIs, offering developers access to a rich pool of API resources. More and more researchers are delving into ways to maximize the value created by leveraging these resources. Thus, acquiring the Web API data and knowing the details is of significance for researchers and ordinary users. In this paper, we propose the methodology of crawling Web APIs from RapidAPI (https://***/hub) and provide rich visualizations and statistical analysis for the crawled dataset. The crawling code and the crawled dataset are open for public access (https://***/IntelligentServicelab.RESTful-API-Crawler) so that researchers and users can acquire them with no effort. Moreover, the use cases of RESTful Web APIs are provided as a usage reference for users and developers. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Web crawler

来源：评论

学校读者我要写书评

暂无评论

JMF-SS: Joint Matrix Factorization for Web API Recommendation with Mashup-Mashup Similarities and API-API Similarities

JMF-SS: Joint Matrix Factorization for Web API Recommendatio...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Lihong Zhang Jing He Yamei Nie Xiaokang Zhou Qiqi Chen Guosheng Kang School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the development of service computing technology, the number of publicly availab.e Web APIs online has increased dramatically. Developers tend to use Web APIs to implement their software development requirements. However, due to the large number of Web APIs, how to select the appropriate Web API from the huge resource library for Mashup development has become a challenge. To solve this problem, some researchers have proposed Web API recommendation methods based on collab.rative filtering or matrix factorization. However, the Web API recommendation performance is still limited due to the reliance on Mashup- API interaction and the ignorance of Mashup and Web API description documents. Moreover, the Mashup-API interaction matrix is extremely sparse, resulting in low accuracy in matrix factorization and collab.rative filtering. To further improve the recommendation performance, we propose a novel joint matrix factorization method for the Mashup-API interaction matrix by incorporating the Mashup-Mashup similarity matrix and the API-API similarity matrix. A set of experiments are conducted on a real-world dataset, and the experimental results show that the proposed method outperforms the baselines.

关键词： Measurement Accuracy Federated learning Mashups Collab.rative filtering Service computing Libraries

来源：评论

学校读者我要写书评

暂无评论

Multi-view Hypergraph-based Self-supervised Learning Model for Web API Recommendation

Multi-view Hypergraph-based Self-supervised Learning Model f...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Jiexun Shen Dongfan Li Wanjun Chen Yong Xiao Guosheng Kang Jianxun Liu Zhenlian Peng School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

With the rapid development of service computing technology, how to recommend the desirable Web APIs to developers from the large number of APIs is a challenge. The traditional methods based on collab.rative filtering are limited by data sparsity. With the support of multi-dimensional relational feature modeling, graph neural network-based methods are proposed to mitigate data sparsity, but their convolution nature may amplify the noise effect. Therefore, how to simultaneously reduce the impact of sparsity and noisy data has been an open question in the field of API recommendation. To address the problem, this paper proposes a self-supervised learning method based on multi-view hypergraph for Web API recommendation. First, the Mashup-API interaction graph is transformed into a hypergraph, and the hyperedges are used as intermediate hubs to transfer messages between nodes, maintaining the global collab.ration effect between Mashup and API nodes. Then, a multi-view strategy is adopted to generate embeddings of Mashups and APIs through information fusion, by which recommendation probability is derived by dot product between the embeddings of Mashups and Web APIs. To train the model parameters effectively, a self-supervised learning method is used to reduce the effect of noisy data to improve the embeddings. Extensive experiments are conducted on a real-world dataset, and the experimental results show that the proposed model outperforms the baselines.

关键词： Knowledge engineering Mashups Noise Neural networks Collab.ration Service computing Self-supervised learning Feature extraction Data models Noise measurement

来源：评论

学校读者我要写书评

暂无评论

A General Complementary API Recommendation Framework based on Learning Model

A General Complementary API Recommendation Framework based o...

引用

IEEE International Conference on Web services (ICWS)

作者： Qiqi Chen Guosheng Kang Yamei Nie Jianxun Liu Buqing Cao HNUST Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Xiangtan China School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China

ISBN: (数字)9798350368550

ISBN: (纸本)9798350368567

With the advancement of service computing technology, the Internet has witnessed an exponential proliferation of Web APIs. However, the selection of suitable APIs from this vast pool for Mashup creation poses a great challenge for users. Various Web API recommendation methods have been proposed to address this issue, aiming to simplify the complex selection process. Despite these efforts, limited studies have been conducted on complementary function recommendation. In this context, a general complementary Web API recommendation framework based on a learning model, named CoWAR, is designed to recommend complementary Web APIs tailored for Mashup creation, based on the user’s selected Web APIs. Specifically, we propose a data lab.ling algorithm to generate the lab.led dataset based on Mashup-API interactions derived from historical Mashups and Web APIs. Additionally, we employ BERT model to generate representation vectors of Web APIs based on the functionality description documents. Subsequently, we utilize SANFM (Self-Attentional Neural Factorization Machines) to train the complementary Web API recommendation model with the lab.led sample dataset based on representation vectors of Web APIs. To the best of our knowledge, this is the first work addressing the complementary function recommendation problem with a learning model. By conducting a set of experiments over a real-world dataset, the effectiveness of the proposed approach is validated. The experimental results demonstrate that the learning model outperforms the traditional machine learning-based models and several deep learning-based models.

关键词： Training Measurement Mashups Service computing Vectors Data models lab.ling Context modeling

来源：评论

学校读者我要写书评

暂无评论

Online Course Recommendation by Exploring User Interaction and Course Description

Online Course Recommendation by Exploring User Interaction a...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Weike Zhou Xiaokang Zhou Jing He Yamei Nie Qiqi Chen Guosheng Kang School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the wide use of Massive Open Online Courses (MOOCs) and online education, the large number and variety of educational resources on the online course open platform make it difficult for users to choose, and the requirements for course recommendation algorithms and model performance are getting higher and higher. The existing course recommendation algorithms often ignore the interactive information between n learners and courses and the course descriptions, resulting in poor recommendation performance. To solve the problems above, our work proposes an online course recommendation approach via exploring user interactions and course description documents. Specifically, LightGCN model is used to represent the user-course interaction graph to derive the structural embeddings of users and courses. Moreover, BERT model is used to represent the course description documents to derive the description embeddings of courses. Based on the three embeddings, ANFM (Attention Neural Factorization Machine) model is applied to perform online course recommendation by modeling low-order and high-order feature interactions, and learning the weights of the feature interactions through the attention mechanism. Finally, solid experiments are conducted over a real-world public dataset. Experimental results show that the proposed approach outperforms the baseline methods under NDCG, Recall and Precision.

关键词： Electronic learning Attention mechanisms Federated learning Education Solids

来源：评论

学校读者我要写书评

暂无评论

Intersecting-boundary-sensitive fingerprinting for tampering detection of DNN models 24

Intersecting-boundary-sensitive fingerprinting for tampering...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Xiaofan Bai Chaoxiang He Xiaojing Ma Bin Benjamin Zhu Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security Microsoft School of Computer Science and Technology Huazhong University of Science and Technology and National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Cluster and Grid Computing Lab.

Cloud-based AI services offer numerous benefits but also introduce vulnerabilities, allowing for tampering with deployed DNN models, ranging from injecting malicious behaviors to reducing computing resources. Fingerprint samples are generated to query models to detect such tampering. In this paper, we present Intersecting-Boundary-Sensitive Fingerprinting (IBSF), a novel method for black-box integrity verification of DNN models using only top-1 lab.ls. Recognizing that tampering with a model alters its decision boundary, IBSF crafts fingerprint samples from normal samples by maximizing the partial Shannon entropy of a selected subset of categories to position the fingerprint samples near decision boundaries where the categories in the subset intersect. These fingerprint samples are almost indistinguishable from their source samples. We theoretically establish and confirm experimentally that these fingerprint samples' expected sensitivity to tampering increases with the cardinality of the subset. Extensive evaluation demonstrates that IBSF surpasses existing state-of-the-art fingerprinting methods, particularly with larger subset cardinality, establishing its state-of-the-art performance in black-box tampering detection using only top-1 lab.ls. The IBSF code is availab.e at: https://***/CGCL-codes/IBSF.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TH-SLP: Web Service Link Prediction Based on Topic-aware Heterogeneous Graph Neural Network

TH-SLP: Web Service Link Prediction Based on Topic-aware Het...

引用

IEEE International Conference on Web services (ICWS)

作者： Qian Peng Buqing Cao Xiang Xie Shanpeng Liu Guosheng Kang Jianxun Liu School of Computer Science and Engineering & Hunan Provincial Key Lab. For Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan Hunan China

With the emergence of more and more Web services, finding suitable services becomes a difficult problem. Service link prediction is employed to disclose relationships among services, which facilitates the further development of service composition, selection, and recommendation. But the existing link prediction approaches simply utilize the structural features of the service network. In reality, the rich text content in service node description documents also carries latent but fine-grained semantics generated by multifaceted topic-aware factors, yet few efforts are committed to mining them. In this paper, we propose a Web service link prediction method based on a topic-aware heterogeneous graph neural network. Specifically, the method consists of two main layers, including the meta-path intra-decomposition and the meta-path inter-mergence. Meta-path intra-decomposition aims to mine the topic distribution of the meta-paths-based context while capturing fine-grained topic-aware semantics. Meta-path inter-mergence uniquely aggregates topic-aware factors according to the mined distribution and adopts a multifaceted attention mechanism to aggregate different meta-paths, enabling service nodes to generate multifaceted topic-aware embeddings that preserve not only the structure and but also the topic-aware semantics. In addition, a topic prior guidance regularization item is set up for quality assurance of multifaceted topic-aware embedding that depends on global knowledge of the unstructured text content in description documents. Experimental results on real datasets show that our proposed model outperforms other existing baselines methods in the link prediction task, successfully validating the effectiveness of our proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

NebulaFL: Effective Asynchronous Federated Learning for JointCloud computing

arXiv

引用

arXiv 2024年

作者： Gao, Fei Hu, Ming Xie, Zhiyu Shi, Peichang Xie, Xiaofei Yi, Guodong Wang, Huaimin National Key Lab. of Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computing and Information Systems Singapore Management University Singapore Xiangjiang Lab Changsha China

With advancements in AI infrastructure and Trusted Execution Environment (TEE) technology, Federated Learning as a Service (FLaaS) through JointCloud computing (JCC) is promising to break through the resource constraints caused by heterogeneous edge devices in the traditional Federated Learning (FL) paradigm. Specifically, with the protection from TEE, data owners can achieve efficient model training with high-performance AI services in the cloud. By providing additional FL services, cloud service providers can achieve collab.rative learning among data owners. However, FLaaS still faces three challenges, i.e., i) low training performance caused by heterogeneous data among data owners, ii) high communication overhead among different clouds (i.e., data centers), and iii) lack of efficient resource scheduling strategies to balance training time and cost. To address these challenges, this paper presents a novel asynchronous FL approach named NebulaFL for collab.rative model training among multiple clouds. To address data heterogeneity issues, NebulaFL adopts a version control-based asynchronous FL training scheme in each data center to balance training time among data owners. To reduce communication overhead, NebulaFL adopts a decentralized model rotation mechanism to achieve effective knowledge sharing among data centers. To balance training time and cost, NebulaFL integrates a reward-guided strategy for data owners selection and resource scheduling. The experimental results demonstrate that, compared to the state-of-the-art FL methods, NebulaFL can achieve up to 5.71% accuracy improvement. In addition, NebulaFL can reduce up to 50% communication overhead and 61.94% costs under a target accuracy. Copyright © 2024, The Authors. All rights reserved.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Towards Dynamic Evolutionary Analysis of ProgrammableWeb for API-Mashup Ecosystem

Towards Dynamic Evolutionary Analysis of ProgrammableWeb for...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yang Wang Jiayan Xiang Hangyu Cheng Wanjun Chen Yong Xiao Guosheng Kang School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

With the wide adoption of Web APIs released on Internet, users tend to reuse them for business requirements or software development. Mashup is a useful technology for composing Web APIs into a new and value-added application. With the increasing number of Web APIs and Mashups, the API-Mashup ecosystem has emerged based on the invocation relationship between Mashups and Web APIs. In this paper, we take ProgrammableWeb, a typical API-Mashup ecosystem, as an example to investigate its dynamic evolutionary analysis. Although there have been some works on the API-Mashup ecosystem, they mainly focus on static analysis, i.e., the static characteristics of the API- Mashup ecosystem on a fixed time point. This paper conducts a comprehensive study on the dynamic evolutionary analysis of the API-Mashup ecosystem with a long time range from 2005 to 2021. First, we conduct a dynamic statistical analysis based on the API-Mashup ecosystem dataset. Next, we construct two cooperation networks, one between Web APIs, and the other between their categories. And the general characteristics of the two cooperation networks are presented. Finally, we investigate the derived cooperation networks from four perspectives: dynamic characteristics, degree distribution, betweenness centrality, and assortative mixing. Meanwhile, the corresponding insights are uncovered. Our work provides a foundation for visualization and understanding of the API-Mashup ecosystem from the timeline.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：