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

Mao Chen 0001

dblp:c/MaoChen-1 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 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 · 71% Web and social media mining · 22% Information retrieval · 7%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
user modeling
0.012002
Predicting category accesses for a user in a structured information space · SIGIR 2002
Recommender systems › user modeling
user preference modeling
0.012002
Predicting category accesses for a user in a structured information space · SIGIR 2002
Recommender systems
rating aggregation
0.012001
Computing and using reputations for internet ratings · EC 2001
Web and social media mining › trust assessment
reputation system
0.012001
Computing and using reputations for internet ratings · EC 2001
Information retrieval › user interaction
personalization
0.012002
Predicting category accesses for a user in a structured information space · SIGIR 2002
Machine learning › Trustworthy machine learning
robustness
0.012001
Computing and using reputations for internet ratings · EC 2001

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

reputation computation · 0.1empirical evaluation · 0.1temporal frequency analysis · 0.0markov model · 0.0
YearPublicationVenuePosition
2003 Content Distribution for Publish/Subscribe Services
Mao Chen 0001, Andrea S. LaPaugh, Jaswinder Pal Singh
Middleware1
2002 Categorizing information objects from user access patterns
abstract
Many web sites have dynamic information objects whose topics change over time. Classifying these objects automatically and promptly is a challenging and important problem for site masters. Traditional content-based and link structure based classification techniques have intrinsic limitations for this task. This paper proposes a framework to classify an object into an existing category structure by analyzing the users' traversals in the category structure. The key idea is to infer an object's topic from the predicted preferences of users when they access the object. We compare two approaches using this idea. One analyzes collective user behavior and the other each user's accesses. We present experimental results on actual data that demonstrate a much higher prediction accuracy and applicability with the latter approach. We also analyze the correlation between classification quality and various factors such as the number of users accessing the object. To our knowledge, this work is the first effort in combining object classification with user access prediction.
Mao Chen 0001, Andrea S. LaPaugh, Jaswinder Pal Singh
CIKM1
2002 Predicting category accesses for a user in a structured information space
abstract
In a categorized information space, predicting users ’ information needs at the category level can facilitate personalization, caching and other topic-oriented services. This paper presents a two-phase model to predict the category of a user’s next access based on previous accesses. Phase 1 generates a snapshot of a user’s preferences among categories based on a temporal and frequency analysis of the user’s access history. Phase 2 uses the computed preferences to make predictions at different category granularities. Several alternatives for each phase are evaluated, using the rating behaviors of on-line raters as the form of access considered. The results show that a method based on re-access pattern and frequency analysis of a user’s whole history has the best prediction quality, even over a path-based method (Markov model) that uses the combined history of all users.
Mao Chen 0001, Andrea S. LaPaugh, Jaswinder Pal Singh
SIGIR1
2001 Computing and using reputations for internet ratings
abstract
Ratings for products and services are increasingly important on the Internet, as they allow users to harvest the wisdom of the community in making decisions. However, the difficulty with ratings is that little is known about the people providing them. Interpreting ratings well requires that the reputations of raters be factored into the scores computed for rated objects, even though these reputations are not explicitly available. Taking advantage of the insight that reputation can be computed implicitly from ratings, this paper addresses the reputation problem for raters and its application to evaluating rated objects. We develop a general method to automatically compute reputations for raters based on the ratings they and others give to objects, and incorporate these reputations to generate value-added information about rated objects. We evaluate our mechanisms by performing experiments on data from major rating sites, and show that they have the desired properties of a good reputation system. In the process, we analyze some key characteristics of different types of Internet ratings. To our knowledge, this is the first investigation into automatically computing raters'reputations and applying these reputations to better evaluate rated objects.
Mao Chen 0001, Jaswinder Pal Singh
EC1