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.

Shengyin Li

dblp:193/5356 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0004-5290-982XORCID · corroborated

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

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous 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.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
combinatorial optimization
0.412020
Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction · AAAI 2020
Mathematical optimization
discrete optimization
0.412020
Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction · AAAI 2020
Mathematical optimization › discrete optimization
mixed integer linear programming
0.412020
Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction · AAAI 2020
Mathematical optimization
solution prediction
0.412020
Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction · AAAI 2020
Machine learning › Graph learning › graph neural network
graph convolutional network
0.112020
Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction · AAAI 2020

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

solution prediction · 0.9local branching · 0.9graph convolutional network · 0.9
YearPublicationVenuePosition
2025 Introspectus AI: Long-term AI-Driven Dialogue Training To Promote Self-Reflection
abstract
Introspectus AI is a generative AI-based system designed to enhance self-reflection and support positive behavior change. By leveraging multimodal information from users' daily life recordings, it provides personalized and detailed feedback, aiming to deepen self-awareness and facilitate positive behavioral adjustments. This study explores the short-term and long-term impacts of interacting with Introspectus AI, focusing on its potential to enhance reflective practices and improve the acceptance of generative AI tools. Following the user experience was defined through an initial round of workshops with four experts. The resulting system was evaluated through a long-term study involving 64 participants. The results demonstrate that AI-supported interventions significantly improved engagement in self-reflection, the need for reflection, and insight, while also increasing user acceptance of generative AI over time. These findings underscore the potential of generative AI as a practical tool for self-improvement, offering insights into its broader applicability in promoting well-being and personal growth.
Shengyin Li, Guangyao Zhu, Danyang Peng, Ximing Shen, Chenyu Tu, Xiaru Meng, Yun Suen Pai, Giulia Barbareschi, Kouta Minamizawa
Proc. ACM Hum. Comput. Interact.1
2020 Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction
abstract
Mixed Integer Programming (MIP) is one of the most widely used modeling techniques for combinatorial optimization problems. In many applications, a similar MIP model is solved on a regular basis, maintaining remarkable similarities in model structures and solution appearances but differing in formulation coefficients. This offers the opportunity for machine learning methods to explore the correlations between model structures and the resulting solution values. To address this issue, we propose to represent a MIP instance using a tripartite graph, based on which a Graph Convolutional Network (GCN) is constructed to predict solution values for binary variables. The predicted solutions are used to generate a local branching type cut which can be either treated as a global (invalid) inequality in the formulation resulting in a heuristic approach to solve the MIP, or as a root branching rule resulting in an exact approach. Computational evaluations on 8 distinct types of MIP problems show that the proposed framework improves the primal solution finding performance significantly on a state-of-the-art open-source MIP solver.
Jian-Ya Ding, Chao Zhang 0096, Shengyin Li, Bing Wang 0017
AAAI4