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.

Yan Zheng Wei

dblp:92/1432 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2008
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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
2 papers
Recommender systems · 100%
Artificial intelligence
1 paper
Reinforcement learning · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems › collaborative filtering
hybrid recommendation
0.112005
A market-based approach to recommender systems · ACM Trans. Inf. Syst. 2005
Machine learning › Reinforcement learning › exploration › exploration strategies
boltzmann exploration
0.012005
Learning Users' Interests by Quality Classification in Market-Based Recommender Systems · IEEE Trans. Knowl. Data Eng. 2005
Algorithmic game theory and mechanism design › mechanism design › incentive mechanism design
reward mechanisms
0.012005
A market-based approach to recommender systems · ACM Trans. Inf. Syst. 2005

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

simulation · 0.1reinforcement learning · 0.1quality classification · 0.1boltzmann exploration · 0.1auction protocol · 0.1bidding strategy · 0.1bidding strategies · 0.1
YearPublicationVenuePosition
2008 User evaluation of a market-based recommender system
Yan Zheng Wei, Nicholas R. Jennings, Luc Moreau 0001, Wendy Hall 0001
Auton. Agents Multi Agent Syst.1
2005 Learning Users' Interests by Quality Classification in Market-Based Recommender Systems
abstract
Recommender systems are widely used to cope with the problem of information overload and, to date, many recommendation methods have been developed. However, no one technique is best for all users in all situations. To combat this, we have previously developed a market-based recommender system that allows multiple agents (each representing a different recommendation method or system) to compete with one another to present their best recommendations to the user. In our system, the marketplace encourages good recommendations by rewarding the corresponding agents who supplied them according to the users' ratings of their suggestions. Moreover, we have theoretically shown how our system incites the agents to bid in a manner that ensures only the best recommendations are presented. To do this effectively in practice, however, each agent needs to be able to classify its recommendations into different internal quality levels, learn the users' interests for these different levels, and then adapt its bidding behavior for the various levels accordingly. To this end, in this paper, we develop a reinforcement learning and Boltzmann exploration strategy that the recommending agents can exploit for these tasks. We then demonstrate that this strategy does indeed help the agents to effectively obtain information about the users' interests which, in turn, speeds up the market convergence and enables the system to rapidly highlight the best recommendations.
Yan Zheng Wei, Luc Moreau 0001, Nicholas R. Jennings
IEEE Trans. Knowl. Data Eng.1
2005 A market-based approach to recommender systems
abstract
Recommender systems have been widely advocated as a way of coping with the problem of information overload for knowledge workers. Given this, multiple recommendation methods have been developed. However, it has been shown that no one technique is best for all users in all situations. Thus we believe that effective recommender systems should incorporate a wide variety of such techniques and that some form of overarching framework should be put in place to coordinate the various recommendations so that only the best of them (from whatever source) are presented to the user. To this end, we show that a marketplace, in which the various recommendation methods compete to offer their recommendations to the user, can be used in this role. Specifically, this article presents the principled design of such a marketplace (including the auction protocol, the reward mechanism, and the bidding strategies of the individual recommendation agents) and evaluates the market's capability to effectively coordinate multiple methods. Through analysis and simulation, we show that our market is capable of shortlisting recommendations in decreasing order of user perceived quality and of correlating the individual agent's internal quality rating to the user's perceived quality.
Yan Zheng Wei, Luc Moreau 0001, Nicholas R. Jennings
ACM Trans. Inf. Syst.1
2004 Learning Users' Interests in a Market-Based Recommender System
Yan Zheng Wei, Luc Moreau 0001, Nicholas R. Jennings
IDEAL1