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

Yilmazcan Özyurt

dblp:285/4976 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Applied, 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
2 papers
Probabilistic and Bayesian machine learning · 40% Transfer learning and domain adaptation · 26% Representation and self-supervised learning · 26%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
0.712023
Contrastive Learning for Unsupervised Domain Adaptation of Time Series · ICLR 2023
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation
0.712023
Contrastive Learning for Unsupervised Domain Adaptation of Time Series · ICLR 2023
Web and social media mining › web usage mining
clickstream analysis
0.612022
A Deep Markov Model for Clickstream Analytics in Online Shopping · WWW 2022
Web and social media mining › user behavior analysis
user behavior modeling
0.612022
A Deep Markov Model for Clickstream Analytics in Online Shopping · WWW 2022
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › markov chain
deep markov models
0.512021
AttDMM: An Attentive Deep Markov Model for Risk Scoring in Intensive Care Units · KDD 2021
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.512021
AttDMM: An Attentive Deep Markov Model for Risk Scoring in Intensive Care Units · KDD 2021
Medical and health informatics › clinical prediction
clinical risk prediction
0.512021
AttDMM: An Attentive Deep Markov Model for Risk Scoring in Intensive Care Units · KDD 2021
Machine learning › Time series and sequential data
time series
0.212023
Contrastive Learning for Unsupervised Domain Adaptation of Time Series · ICLR 2023
Web and social media mining
e-commerce
0.212022
A Deep Markov Model for Clickstream Analytics in Online Shopping · WWW 2022

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

generative deep probabilistic model · 1.0attention · 1.0contrastive learning · 0.7latent variable model · 0.6deep markov model · 0.6attention network · 0.6
YearPublicationVenuePosition
2025 Personalized Exercise Recommendation with Semantically-Grounded Knowledge Tracing
abstract
We introduce ExRec, a general framework for personalized exercise recommendation with semantically-grounded knowledge tracing. Our method builds on the observation that existing exercise recommendation approaches simulate student performance via knowledge tracing (KT) but they often overlook two key aspects: (a) the semantic content of questions and (b) the sequential, structured progression of student learning. To address this, our ExRec presents an end-to-end pipeline, from annotating the KCs of questions and learning their semantic representations to training KT models and optimizing several reinforcement learning (RL) methods. Moreover, we improve standard Q-learning-based continuous RL methods via a tailored model-based value estimation (MVE) approach that directly leverages the components of KT model in estimating cumulative knowledge improvement. We validate the effectiveness of our ExRec using various RL methods across four real-world tasks with different educational goals in online math learning. We further show that ExRec generalizes robustly to new, unseen questions and that it produces interpretable student learning trajectories. Together, our findings highlight the promise of KT-guided RL for effective personalization in education.
Yilmazcan Özyurt, Tunaberk Almaci, Stefan Feuerriegel, Mrinmaya Sachan
NeurIPS1
2023 Contrastive Learning for Unsupervised Domain Adaptation of Time Series
Yilmazcan Özyurt, Stefan Feuerriegel, Ce Zhang 0001
ICLR1
2022 A Deep Markov Model for Clickstream Analytics in Online Shopping
abstract
Machine learning is widely used in e-commerce to analyze clickstream sessions and then to allocate marketing resources. Traditional neural learning can model long-term dependencies in clickstream data, yet it ignores the different shopping phases (i. e., goal-directed search vs. browsing) in user behavior as theorized by marketing research. In this paper, we develop a novel, theory-informed machine learning model to account for different shopping phases as defined in marketing theory. Specifically, we formalize a tailored attentive deep Markov model called ClickstreamDMM for predicting the risk of user exits without purchase in e-commerce web sessions. Our ClickstreamDMM combines (1) an attention network to learn long-term dependencies in clickstream data and (2) a latent variable model to capture different shopping phases (i. e., goal-directed search vs. browsing). Due to the interpretable structure, our ClickstreamDMM allows marketers to generate new insights on how shopping phases relate to actual purchase behavior. We evaluate our model using real-world clickstream data from a leading e-commerce platform consisting of 26,279 sessions with 250,287 page clicks. Thereby, we demonstrate that our model is effective in predicting user exits without purchase: compared to existing baselines, it achieves an improvement by 11.5 % in AUROC and 12.7 % in AUPRC. Overall, our model enables e-commerce platforms to detect users at the risk of exiting without purchase. Based on it, e-commerce platforms can then intervene with marketing resources to steer users toward purchasing.
Yilmazcan Özyurt, Tobias Hatt, Ce Zhang 0001, Stefan Feuerriegel
WWW1
2021 AttDMM: An Attentive Deep Markov Model for Risk Scoring in Intensive Care Units
abstract
Clinical practice in intensive care units (ICUs) requires early warnings when a patient's condition is about to deteriorate so that preventive measures can be undertaken. To this end, prediction algorithms have been developed that estimate the risk of mortality in ICUs. In this work, we propose a novel generative deep probabilistic model for real-time risk scoring in ICUs. Specifically, we develop an attentive deep Markov model called AttDMM. To the best of our knowledge, AttDMM is the first ICU prediction model that jointly learns both long-term disease dynamics (via attention) and different disease states in health trajectory (via a latent variable model). Our evaluations were based on an established baseline dataset (MIMIC-III) with 53,423 ICU stays. The results confirm that compared to state-of-the-art baselines, our AttDMM was superior: AttDMM achieved an area under the receiver operating characteristic curve (AUROC) of 0.876, which yielded an improvement over the state-of-the-art method by 2.2%. In addition, the risk score from the AttDMM provided warnings several hours earlier. Thereby, our model shows a path towards identifying patients at risk so that health practitioners can intervene early and save patient lives.
Yilmazcan Özyurt, Mathias Kraus, Tobias Hatt, Stefan Feuerriegel
KDD1