Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jinyun Yan
dblp:40/11207
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0003-0532-1930ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 5 · 2 first-authorArtificial intelligence and machine learning · 4 · 1 first-author
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.
| Databases, data mining, and information retrieval
4 papers |
Information retrieval · 49% Recommender systems · 28% Web and social media mining · 14% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › online advertising
ads allocation |
0.4 | 1 | 2020 | Ads Allocation in Feed via Constrained Optimization · KDD 2020 |
Mathematical optimization
constrained optimization |
0.4 | 1 | 2020 | Ads Allocation in Feed via Constrained Optimization · KDD 2020 |
Information retrieval
personalized search |
0.2 | 1 | 2014 | Cohort modeling for enhanced personalized search · SIGIR 2014 |
Information retrieval › personalized search
query personalization |
0.2 | 1 | 2014 | Cohort modeling for enhanced personalized search · SIGIR 2014 |
Web and social media mining
social network analysis |
0.2 | 1 | 2014 | LASTA: large scale topic assignment on multiple social networks · KDD 2014 |
Data mining › text mining › topic model
topic assignment |
0.2 | 1 | 2014 | LASTA: large scale topic assignment on multiple social networks · KDD 2014 |
Recommender systems
user profiling |
0.2 | 1 | 2014 | LASTA: large scale topic assignment on multiple social networks · KDD 2014 |
Information retrieval
web search |
0.2 | 1 | 2014 | Cohort modeling for enhanced personalized search · SIGIR 2014 |
Web and social media mining
user engagement |
0.1 | 1 | 2018 | Near Real-time Optimization of Activity-based Notifications · KDD 2018 |
Recommender systems › user interest modeling
user interest inference |
0.1 | 1 | 2014 | LASTA: large scale topic assignment on multiple social networks · KDD 2014 |
Methods — techniques the papers use, named apart from their topics
constrained optimization · 0.9multi-network learning · 0.2feature engineering · 0.2dynamic cohort learning · 0.2cohort modeling · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Ads Allocation in Feed via Constrained OptimizationabstractSocial networks and content publishing platforms have newsfeed applications, which show both organic content to drive engagement, and ads to drive revenue. This paper focuses on the problem of ads allocation in a newsfeed to achieve an optimal balance of revenue and engagement. To the best of our knowledge, we are the first to report practical solutions to this business-critical and popular problem in industry. Jinyun Yan, Birjodh Singh Tiwana, Shaunak Chatterjee |
KDD | 1 |
| 2018 | Near Real-time Optimization of Activity-based NotificationsabstractIn recent years, social media applications (e.g., Facebook, LinkedIn) have created mobile applications (apps) to give their members instant and real-time access from anywhere. To keep members informed and drive timely engagement, these mobile apps send event notifications. However, sending notifications for every possible event would result in too many notifications which would in turn annoy members and create a poor member experience. Viral Gupta, Jinyun Yan, Changji Shi, Zhongen Tao, P. J. Xiao, Curtis Wang, Shipeng Yu, Rómer Rosales, Ajith Muralidharan, Shaunak Chatterjee |
KDD | 3 |
| 2014 | LASTA: large scale topic assignment on multiple social networksabstractMillions of people use social networks everyday to talk about a variety of subjects, publish opinions and share information. Understanding this data to infer user's topical interests is a challenging problem with applications in various data-powered products. In this paper, we present 'LASTA' (Large Scale Topic Assignment), a full production system used at Klout, Inc., which mines topical interests from five social networks and assigns over 10,000 topics to hundreds of millions of users on a daily basis. The system continuously collects streams of user data and is reactive to fresh information, updating topics for users as interests shift. LASTA generates over 50 distinct features derived from signals such as user generated posts and profiles, user reactions such as comments and retweets, user attributions such as lists, tags and endorsements, as well as signals based on social graph connections. We show that using this diverse set of features leads to a better representation of a user's topical interests as compared to using only generated text or only graph based features. We also show that using cross-network information for a user leads to a more complete and accurate understanding of the user's topics, as compared to using any single network. We evaluate LASTA's topic assignment system on an internal labeled corpus of 32,264 user-topic labels generated from real users. Nemanja Spasojevic, Jinyun Yan, Adithya Rao, Prantik Bhattacharyya |
KDD | 2 |
| 2014 | Cohort modeling for enhanced personalized searchabstractWeb search engines utilize behavioral signals to develop search experiences tailored to individual users. To be effective, such personalization relies on access to sufficient information about each user's interests and intentions. For new users or new queries, profile information may be sparse or non-existent. To handle these cases, and perhaps also improve personalization for those with profiles, search engines can employ signals from users who are similar along one or more dimensions, i.e., those in the same cohort. In this paper we describe a characterization and evaluation of the use of such cohort modeling to enhance search personalization. We experiment with three pre-defined cohorts-topic, location, and top-level domain preference-independently and in combination, and also evaluate methods to learn cohorts dynamically. We show via extensive experimentation with large-scale logs from a commercial search engine that leveraging cohort behavior can yield significant relevance gains when combined with a production search engine ranking algorithm that uses similar classes of personalization signal but at the individual searcher level. Additional experiments show that our gains can be extended when we dynamically learn cohorts and target easily-identifiable classes of ambiguous or unseen queries. Jinyun Yan, Ryen W. White |
SIGIR | 1 |
| 2013 | A Time and Space Efficient Algorithm for Contextual Linear Bandits
José Bento 0001, Stratis Ioannidis, S. Muthukrishnan 0001, Jinyun Yan |
ECML/PKDD (1) | 4 |