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

Bradley Sturt

dblp:135/6750 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-1053-0780ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2Theory of computation · 1 · 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 · 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
Algorithmic game theory and mechanism design › fair division
group fairness
0.712023
Group fairness in dynamic refugee assignment · EC 2023
Algorithmic game theory and mechanism design › market design
matching markets
0.712023
Group fairness in dynamic refugee assignment · EC 2023
Machine learning › Graph learning
heterogeneous graph
0.212014
Personalized entity recommendation: a heterogeneous information network approach · WSDM 2014
Recommender systems › knowledge-aware recommendation
entity recommendation
0.212014
Personalized entity recommendation: a heterogeneous information network approach · WSDM 2014
Recommender systems › collaborative filtering
implicit feedback
0.112014
Personalized entity recommendation: a heterogeneous information network approach · WSDM 2014

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

predictive modeling · 0.7machine learning · 0.7network embedding · 0.4heterogeneous information network · 0.4
YearPublicationVenuePosition
2023 Group fairness in dynamic refugee assignment
abstract
Ensuring that refugees and asylum seekers thrive (e.g., find employment) in their host countries is a profound humanitarian goal, and a primary driver of employment is the geographic location to which the refugee or asylum seeker is assigned. In the past few years, innovations in analytics have given rise to machine learning (ML) models that predict integration outcomes using personal characteristics. With these ML models, recent research has proposed and implemented algorithms that assign refugees and asylum seekers to geographic locations in a manner that maximizes the average employment. While these algorithms can have substantial overall positive impact (up to 50% increases in average employment rate compared with current practice), using data from two industry collaborators we show that the impact of these algorithms can vary widely across key subgroups based on country of origin, age, or educational background.
Daniel Freund 0001, Thodoris Lykouris, Elisabeth Paulson, Bradley Sturt, Wentao Weng
EC4
2014 Personalized entity recommendation: a heterogeneous information network approach
abstract
Among different hybrid recommendation techniques, network-based entity recommendation methods, which utilize user or item relationship information, are beginning to attract increasing attention recently. Most of the previous studies in this category only consider a single relationship type, such as friendships in a social network. In many scenarios, the entity recommendation problem exists in a heterogeneous information network environment. Different types of relationships can be potentially used to improve the recommendation quality. In this paper, we study the entity recommendation problem in heterogeneous information networks. Specifically, we propose to combine heterogeneous relationship information for each user differently and aim to provide high-quality personalized recommendation results using user implicit feedback data and personalized recommendation models.
Xiao Yu 0007, Xiang Ren 0001, Yizhou Sun, Quanquan Gu, Bradley Sturt, Urvashi Khandelwal, Brandon Norick, Jiawei Han 0001
WSDM5
2013 Recommendation in heterogeneous information networks with implicit user feedback
abstract
Recent studies suggest that by using additional user or item relationship information when building hybrid recommender systems, the recommendation quality can be largely improved. However, most such studies only consider a single type of relationship, e.g., social network. Notice that in many applications, the recommendation problem exists in an attribute-rich heterogeneous information network environment. In this paper, we study the entity recommendation problem in heterogeneous information networks. We propose to combine various relationship information from the network with user feedback to provide high quality recommendation results.
Xiao Yu 0007, Xiang Ren 0001, Yizhou Sun, Bradley Sturt, Urvashi Khandelwal, Quanquan Gu, Brandon Norick, Jiawei Han 0001
RecSys4