EDBT 2026 Demo / reviewers in the wild / expert
Yayu Ni
dblp:138/3111
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 4 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Services computing and microservices · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › text mining › topic model
latent topic models |
0.4 | 1 | 2019 | SeCo-LDA: Mining Service Co-Occurrence Topics for Composition Recommendation · IEEE Trans. Serv. Comput. 2019 |
Services computing and microservices
service composition |
0.4 | 1 | 2019 | SeCo-LDA: Mining Service Co-Occurrence Topics for Composition Recommendation · IEEE Trans. Serv. Comput. 2019 |
Methods — techniques the papers use, named apart from their topics
latent dirichlet allocation · 0.8association rule mining · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | SeCo-LDA: Mining Service Co-Occurrence Topics for Composition RecommendationabstractService composition remains an important topic where recommendation is widely recognized as a core mechanism. Existing works on service recommendation typically examine either association rules from mashup-service usage records, or latent topics from service descriptions. This paper moves one step further, by studying latent topic models over service collaboration history. A concept of service co-occurrence topic is coined, equipped with a mechanism developed to construct service co-occurrence documents. The key idea is to treat each service as a document and its co-occurring services as the bag of words in that document. Four gauges are constructed to measure self-co-occurrence of a specific service. A theoretical approach, Service Co-occurrence LDA (SeCo-LDA), is developed to extract latent service co-occurrence topics, including representative services and words, temporal strength, and services' impact on topics. Such derived knowledge of topics will help to reveal the trend of service composition, understand collaboration behaviors among services and lead to better service recommendation. To verify the effectiveness and efficiency of our approach, experiments on a real-world data set were conducted. Compared with methods of Apriori, content matching based on service description, and LDA using mashup-service usage records, our experiments show that SeCo-LDA can recommend service composition more effectively, i.e., 5% better in terms of Mean Average Precision than baselines. Zhenfeng Gao, Yushun Fan, Cheng Wu 0002, Wei Tan 0001, Jia Zhang 0001, Yayu Ni, Shuhui Chen |
IEEE Trans. Serv. Comput. | 6 |
| 2016 | SeCo-LDA: Mining Service Co-occurrence Topics for RecommendationabstractService ecosystem consists of all kinds of services, and some of them may be composed by developers to create new mashups. Existing work on service recommendation and composition mine either frequent patterns from mashup-service usage records, or latent topics from service metadata. In this paper, we propose Service Co-occurrence LDA (SeCo-LDA), a novel approach that mines latent topic models over service co-occurrence patterns. The key idea is to treat each service as a document, and its bag of co-occurring services as the bag of words in that document. Using this model, we can analyze such service co-occurrence documents with a probabilistic topic model. We show how to derive service co-occurrence topics, and then validate our model on the real-world ProgrammableWeb.com dataset. We illustrate that SeCo-LDA can discover meaningful latent service composition patterns including their temporal strength and services' impacts, which conventional Apriori can not reveal. Comparing with Apriori, content matching based on service description and LDA directly using mashup-service usage records, we have demonstrated that SeCo-LDA can recommend service composition more effectively, 5% better in terms of MAP than the baseline approach. Zhenfeng Gao, Yushun Fan, Cheng Wu 0002, Wei Tan 0001, Jia Zhang 0001, Yayu Ni, Shuhui Chen |
ICWS | 6 |
| 2016 | NCSR: Negative-Connection-Aware Service Recommendation for Large Sparse Service NetworkabstractCurrently, most web service recommendation studies concentrate on mining association patterns among services from historical compositions and recommending proper services based on patterns derived. However, latent negative patterns which indicate the inappropriate combinations of services, are mostly ignored. Therefore, by combining additional negative patterns with the already-exploited positive patterns in the large spares network of web services, we present a more comprehensive and accurate model for service recommendation. More specifically, we combine positive and negative composition patterns mined from service annotated tags. The extensive experiments conducted on a real-life dataset show that our method can outperform not only traditional APriori -based recommendation method but also Link Prediction-based one. The experiments on a synthetic dataset show that our method can also be effective to make recommendations in large-scale service network. Yayu Ni, Yushun Fan, Wei Tan 0001, Keman Huang, Jing Bi 0001 |
IEEE Trans Autom. Sci. Eng. | 1 |
| 2014 | Negative-Connection-Aware Tag-Based Association Mining and Service Recommendation
Yayu Ni, Yushun Fan, Keman Huang, Jing Bi 0001, Wei Tan 0001 |
ICSOC | 1 |
| 2013 | Mirror, Mirror, on the Web, Which Is the Most Reputable Service of Them All? - A Domain-Aware and Reputation-Aware Method for Service Recommendation
Keman Huang, Jinhui Yao, Yushun Fan, Wei Tan 0001, Surya Nepal, Yayu Ni, Shiping Chen 0001 |
ICSOC | 6 |