Demo Data from VLDB 2026 / reviewers in the wild / expert
Yueying Qing
dblp:321/8160
· DBLP profile ↗
5ranked-venue papers
1as first author
5since 2021 · last 2027
0000-0002-2653-7901ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Services computing and microservices · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Services computing and microservices › service recommendation
qos-aware recommendation |
0.7 | 1 | 2023 | Web Service Recommendation via Integrating Heterogeneous Graph Attention Network Representation and FiBiNET Score Prediction · IEEE Trans. Serv. Comput. 2023 |
Services computing and microservices › service recommendation
web service recommendation |
0.7 | 1 | 2023 | Web Service Recommendation via Integrating Heterogeneous Graph Attention Network Representation and FiBiNET Score Prediction · IEEE Trans. Serv. Comput. 2023 |
Methods — techniques the papers use, named apart from their topics
meta-path similarity · 1.3heterogeneous graph attention network · 1.3FiBiNET · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2027 | CurvGCL: Curvature-guided graph contrastive learning for reliability-aware recommendation
Yueying Qing, Buqing Cao, Shanpeng Liu, Jianxun Liu 0001, Jinjun Chen |
Expert Syst. Appl. | 1 |
| 2023 | Web Service Recommendation via Combining Bilinear Graph Representation and xDeepFM Quality PredictionabstractWith the increasing number of Web services, how to provide developers with Web services that meet their Mashup requirements accurately and efficiently has become a challenging problem. Therefore, focusing on the problem of “recommending appropriate services to build high-quality Mashup applications”, this paper proposes a Web service recommendation method via combining bilinear graph attention representation and xDeepFM (eXtreme Deep Factorization Machine) quality prediction. This method is based on content and structure-oriented service function classification and combines it with the service invocation prediction based on multi-dimensional quality attributes. Firstly, it uses the Word2Vec model to learn the latent semantic representations from service description documents. Then, it constructs the service relationship network according to tags and shared annotation relationships of Web services. Next, a bilinear aggregator is used to model the pairwise interactions between neighbor service nodes. Integrated with the traditional weighted sum aggregator, a bilinear graph neural network (BGNN) with stronger node representation ability is constructed. It exploits BGNN to calculate the representation of service nodes in the network and divides services into different functionality clusters. Finally, the high-quality representation results are combined with multi-dimensional QoS attributes. Aiming at the Web services in the service cluster, it utilizes xDeepFM to model and mine the complex interactions between Web services” features, and predict and rank the invocation scores of Web services. The experimental results on the real dataset of ProgrammableWeb show that compared with the other ten methods, the proposed approach has better performance in terms ofAccuracy,Recall,F1,Logloss, andAUC, and has better performance in classification and recommendation. Buqing Cao, Lulu Zhang 0004, Mi Peng, Yueying Qing, Guosheng Kang, Jianxun Liu 0001 |
IEEE Trans. Netw. Serv. Manag. | 4 |
| 2023 | Web Service Recommendation via Integrating Heterogeneous Graph Attention Network Representation and FiBiNET Score PredictionabstractThe rapid growth in the number and diversity of Web service, coupled with the myriad of similar Web service in functionality, makes it challenging to find most suitable Web service for users to accelerate and accomplish Mashup development. Therefore, this article proposes a Web service recommendation method via integrating heterogeneous graph attention network representation and FiBiNET (Feature Importance and Bilinear feature Interaction NETwork) score prediction. In this method, first, a heterogeneous information service network is constructed by using composite service information, atomic service information, and their respective attribute information. Second, the meta-paths are defined according to different semantic information and service similarity matrixes are built by using commuting matrix and meta-path-based similarity measurement technology. A two-layer attention model is designed to calculate the node level attention and meta-path-level attention of the services respectively, and generate the feature representation of Web service. Third, for the Web services in the service cluster, combining their feature representations with multi-dimensional QoS attributes, the FiBiNET is exploited to dynamically learn the importance of features and complex feature interactions, and predict the score of Web services. Finally, the experiments are performed on the real Web service dataset. The experimental results show that the proposed method is better than the other nine methods in terms of accuracy, recall, F1, and AUC, and achieves better classification and recommendation quality. Buqing Cao, Mi Peng, Lulu Zhang 0004, Yueying Qing, Bing Tang, Guosheng Kang, Jianxun Liu 0001 |
IEEE Trans. Serv. Comput. | 4 |
| 2022 | A Negative Sampling-Based Service Recommendation Method
Ziming Xie, Buqing Cao, Xinwen Liyan, Bing Tang, Yueying Qing |
CollaborateCom (1) | 5 |
| 2022 | Web API recommendation via combining graph attention representation and deep factorization machines quality predictionabstractSUMMARY As more and more companies and organizations encapsulate and publish their business data or resources to the Internet in the form of APIs, the number of web APIs has grown exponentially. For this reason, it has become challenging to quickly and effectively find web APIs from such a large‐scale web API collection, which meet the requirements of mashup developers. To this end, this article focuses on recommending suitable web APIs to build high‐quality mashups by classifying and integrating content‐oriented service functionality with service invocation prediction. The proposed web API recommendation method for mashup development uses graph attention representation and DeepFM quality prediction. First, it uses the web API composition and shared annotation relationships to construct a web API relationship network. Second, it applies the self‐attention mechanism to compute the attention coefficients of different neighboring nodes in the web API relationship network. So, for a specific web API node, the weighted sum of the importance of its neighboring nodes and features characterizes that web API node. Doing so ensures that the service can be divided more accurately into different functional clusters via high‐quality characterization. Third, for the web APIs in a cluster, the high‐quality representation results are combined with multidimensional quality of service attributes. It employs the DeepFM to model and mine complex interaction relationships between features and subsequently predict and rank the invocation scores of web APIs. Finally, experiments are compared and analyzed on real‐world web API datasets. It can be seen from the results of several groups of comparative experiments that the proposed method outperforms other nine baseline methods on accuracy, recall, F1, DCG, and AUC and achieved a good classification accuracy and recommendation effect. Buqing Cao, Mi Peng, Yueying Qing, Jianxun Liu 0001, Guosheng Kang, Bing Li 0010, Kenneth K. Fletcher |
Concurr. Comput. Pract. Exp. | 3 |