Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qingying Chen

dblp:201/6682 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 75% Information retrieval · 25%
Software engineering, system software, and programming languages
2 papers
Empirical software engineering · 61% Program synthesis and code generation · 31% Software maintenance and evolution · 8%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference › heterogeneous treatment effect estimation
uplift modeling
1.012026
Uplift Modeling with Delayed Feedback: Identifiability and Algorithms · AAAI 2026
Information retrieval › document retrieval › domain-specific retrieval
code search
0.312018
A neural framework for retrieval and summarization of source code · ASE 2018
Program synthesis and code generation
code summarization
0.312018
A neural framework for retrieval and summarization of source code · ASE 2018
Empirical software engineering › developer studies › developer behavior
developer productivity
0.312017
On the scalability of Linux kernel maintainers' work · ESEC/SIGSOFT FSE 2017
Empirical software engineering
mining software repositories
0.312017
On the scalability of Linux kernel maintainers' work · ESEC/SIGSOFT FSE 2017
Empirical software engineering › open source software
open source governance
0.112017
On the scalability of Linux kernel maintainers' work · ESEC/SIGSOFT FSE 2017
Software maintenance and evolution
software ecosystems
0.112017
On the scalability of Linux kernel maintainers' work · ESEC/SIGSOFT FSE 2017

Methods — techniques the papers use, named apart from their topics

potential outcome modeling · 1.0counterfactual regression · 1.0variational autoencoder · 0.7neural network · 0.7statistical modeling · 0.3regression analysis · 0.3
YearPublicationVenuePosition
2026 Uplift Modeling with Delayed Feedback: Identifiability and Algorithms
abstract
Uplift modeling has obtained significant attention, with broad applications in medicine, economics, and marketing. For example, in a push notification scenario, accurately estimating the uplift of different push frequencies on user activation and notification switch close rate is critical for balancing user experience and business goals. Existing methods only use binary labels, i.e., convert or not within the observational window. However, they ignore time information (e.g., users who convert on day 1 vs. day 14 reflect different sensitivities) and fail to model potential closures outside the window, i.e., due to treatments always taking time to manifest causal impacts on outcomes, the potential outcomes of interest cannot be observed promptly and accurately. Failing to account for these issues can result in skewed uplift modeling. To address this gap, this work examines how observation timing influences the assessment of uplift by explicitly modeling the potential response time. Theoretical analysis establishes the conditions for identifiability under delayed feedback scenarios. We introduce CFR-DF (Counterfactual Regression with Delayed Feedback), a systematic framework that jointly learns both the latent response times and the underlying potential outcomes. Empirical evaluations on synthetic and real-world datasets, including an A/B test with over 1 billion users for 14 days, validate the approach, demonstrating its ability to handle temporal delays and improve estimation accuracy compared to previous uplift modeling methods.
Chunyuan Zheng 0001, Anpeng Wu, Chuan Zhou 0013, Taojun Hu, Qingying Chen, Huiyou Jiang, Haoxuan Li 0001, Zhouchen Lin
AAAI5
2026 User Activity Modeling under Inflated Distribution
Xiang Li 0067, Chunyuan Zheng 0001, Qingying Chen, Huiyou Jiang, Haoxuan Li 0001, Zhouchen Lin
SIGIR4
2024 Bi-Branch Meta-Learning for Few-Shot Word Sense Disambiguation
Qingying Chen, Peng Zhang 0002
CogSci1
2018 A neural framework for retrieval and summarization of source code
abstract
Code retrieval and summarization are two tasks often employed by software developers to reuse code that spreads over online repositories. In this paper, we present a neural framework that allows bidirectional mapping between source code and natural language to improve these two tasks. Our framework, BVAE, is designed to have two Variational AutoEncoders (VAEs) to model bimodal data: C-VAE for source code and L-VAE for natural language. Both VAEs are trained jointly to reconstruct their input as much as possible with regularization that captures the closeness between the latent variables of code and description. BVAE could learn semantic vector representations for both code and description and generate completely new descriptions for arbitrary code snippets. We design two instance models of BVAE for retrieval and summarization tasks respectively and evaluate their performance on a benchmark which involves two programming languages: C# and SQL. Experiments demonstrate BVAE’s potential on the two tasks.
Qingying Chen, Minghui Zhou 0001
ASE1
2017 On the scalability of Linux kernel maintainers' work
abstract
Open source software ecosystems evolve ways to balance the workload among groups of participants ranging from core groups to peripheral groups. As ecosystems grow, it is not clear whether the mechanisms that previously made them work will continue to be relevant or whether new mechanisms will need to evolve. The impact of failure for critical ecosystems such as Linux is enormous, yet the understanding of why they function and are effective is limited. We, therefore, aim to understand how the Linux kernel sustains its growth, how to characterize the workload of maintainers, and whether or not the existing mechanisms are scalable. We quantify maintainers' work through the files that are maintained, and the change activity and the numbers of contributors in those files. We find systematic differences among modules; these differences are stable over time, which suggests that certain architectural features, commercial interests, or module-specific practices lead to distinct sustainable equilibria. We find that most of the modules have not grown appreciably over the last decade; most growth has been absorbed by a few modules. We also find that the effort per maintainer does not increase, even though the community has hypothesized that required effort might increase. However, the distribution of work among maintainers is highly unbalanced, suggesting that a few maintainers may experience increasing workload. We find that the practice of assigning multiple maintainers to a file yields only a power of 1/2 increase in productivity. We expect that our proposed framework to quantify maintainer practices will help clarify the factors that allow rapidly growing ecosystems to be sustainable.
Minghui Zhou 0001, Qingying Chen, Audris Mockus, Fengguang Wu
ESEC/SIGSOFT FSE2
2017 Fast participant recruitment algorithm for large-scale Vehicle-based Mobile Crowd Sensing
Kefu Yi, RongHua Du, Qingying Chen, Kai Gao 0010
Pervasive Mob. Comput.4