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

Ahmed Sayeed Faruk

dblp:359/0468 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0005-5823-1623ORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 77% Web and social media mining · 23%

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

TopicWeightPapersLastEvidence papers
Recommender systems › sequential decision making
contextual bandit recommendation
0.912025
Leveraging Heterogeneous Spillover in Maximizing Contextual Bandit Rewards · WWW 2025
Algorithmic game theory and mechanism design › multi-armed bandit
contextual bandits
0.912025
Leveraging Heterogeneous Spillover in Maximizing Contextual Bandit Rewards · WWW 2025
Algorithmic game theory and mechanism design
multi-armed bandit
0.912025
Leveraging Heterogeneous Spillover in Maximizing Contextual Bandit Rewards · WWW 2025
Web and social media mining › social influence analysis
social network influence
0.312025
Leveraging Heterogeneous Spillover in Maximizing Contextual Bandit Rewards · WWW 2025

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

heterogeneous spillover modeling · 1.7contextual multi-armed bandit · 1.7
YearPublicationVenuePosition
2025 Leveraging Heterogeneous Spillover in Maximizing Contextual Bandit Rewards
abstract
Recommender systems relying on contextual multi-armed bandits continuously improve relevant item recommendations by taking into account the contextual information. The objective of bandit algorithms is to learn the best arm (e.g., best item to recommend) for each user and thus maximize the cumulative rewards from user engagement with the recommendations. The context that these algorithms typically consider are the user and item attributes. However, in the context of social networks where the action of one user can influence the actions and rewards of other users, neighbors' actions are also a very important context, as they can have not only predictive power but also can impact future rewards through spillover. Moreover, influence susceptibility can vary for different people based on their preferences and the closeness of ties to other users which leads to heterogeneity in the spillover effects. Here, we present a framework that allows contextual multi-armed bandits to account for such heterogeneous spillovers when choosing the best arm for each user. Our experiments on several semi-synthetic and real-world datasets show that our framework leads to significantly higher rewards than existing state-of-the-art solutions that ignore the network information and potential spillover.
Ahmed Sayeed Faruk, Elena Zheleva
WWW1