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

Jiayi Liu 0005

dblp:09/247-5 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2023
0009-0009-8014-4218ORCID · verified

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 2 · 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 50% Recommender systems · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems › multi-objective optimization
multi-objective recommendation
0.712023
Stationary Algorithmic Balancing For Dynamic Email Re-Ranking Problem · KDD 2023
Information retrieval
reranking
0.712023
Stationary Algorithmic Balancing For Dynamic Email Re-Ranking Problem · KDD 2023
Mathematical optimization › control theory
adaptive control
0.212023
Stationary Algorithmic Balancing For Dynamic Email Re-Ranking Problem · KDD 2023
Mathematical optimization
online optimization
0.212023
Stationary Algorithmic Balancing For Dynamic Email Re-Ranking Problem · KDD 2023

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

multi-objective optimization · 1.3adaptive control model · 1.3
YearPublicationVenuePosition
2023 Stationary Algorithmic Balancing For Dynamic Email Re-Ranking Problem
abstract
Email platforms need to generate personalized rankings of emails that satisfy user preferences, which may vary over time. We approach this as a recommendation problem based on three criteria: closeness (how relevant the sender and topic are to the user), timeliness (how recent the email is), and conciseness (how brief the email is). We propose MOSR (Multi-Objective Stationary Recommender), a novel online algorithm that uses an adaptive control model to dynamically balance these criteria and adapt to preference changes. We evaluate MOSR on the Enron Email Dataset, a large collection of real emails, and compare it with other baselines. The results show that MOSR achieves better performance, especially under non-stationary preferences, where users value different criteria more or less over time. We also test MOSR's robustness on a smaller down-sampled dataset that exhibits high variance in email characteristics, and show that it maintains stable rankings across different samples. Our work offers novel insights into how to design email re-ranking systems that account for multiple objectives impacting user satisfaction.
Jiayi Liu 0005, Jennifer Neville
KDD1
2017 ClaimVerif: A Real-time Claim Verification System Using the Web and Fact Databases
abstract
Our society is increasingly digitalized. Every day, a tremendous amount of information is being created, shared, and digested through all kinds of cyber channels. Although people can easily acquire information from various sources (social media, news articles, etc.), the truthfulness of most received information remains unverified. In many real-life scenarios, false information has become the de facto cause that leads to detrimental decision makings, and techniques that can automatically filter false information are highly demanded. However, verifying whether a piece of information is trustworthy is difficult because: (1) selecting candidate snippets for fact checking is nontrivial; and (2) detecting supporting evidences, i.e. stances, suffers from the difficulty of measuring the similarity between claims and related evidences. We build ClaimVerif, a claim verification system that not only provides credibility assessment for any user-given query claim, but also rationales the assessment results with supporting evidences. ClaimVerif can automatically select the stances from millions of documents and employs two-step training to justify the opinions of the stances. Furthermore, combined with the credibility of stances sources, ClaimVerif degrades the score of stances from untrustworthy sources and alleviates the negative effects from rumor spreaders. Our empirical evaluations show that ClaimVerif achieves both high accuracy and efficiency in different claim verification tasks. It can be highly useful in practical applications by providing multi-dimension analysis for the suspicious statements, including the stances, opinions, source credibility and estimated judgements.
Shi Zhi, Yicheng Sun, Jiayi Liu 0005, Chao Zhang 0014, Jiawei Han 0001
CIKM3