Sciweavers

507 search results - page 85 / 102
» Trust-based collaborative filtering
Sort
View
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
15 years 10 months ago
Complete This Puzzle: A Connectionist Approach to Accurate Web Recommendations Based on a Committee of Predictors
Abstract. We present a Context Ultra-Sensitive Approach based on two-step Recommender systems (CUSA-2step-Rec). Our approach relies on a committee of profile-specific neural networ...
Olfa Nasraoui, Mrudula Pavuluri
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
15 years 10 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
CHI
2002
ACM
15 years 10 months ago
Specifying preferences based on user history
Many applications require users to specify preferences. We support users in this task by letting them define preferences relative to their personal history or that of other users....
Loren G. Terveen, Jessica McMackin, Brian Amento, ...
SIGMOD
2008
ACM
109views Database» more  SIGMOD 2008»
15 years 10 months ago
Extreme visualization: squeezing a billion records into a million pixels
Database searches are usually performed with query languages and form fill in templates, with results displayed in tabular lists. However, excitement is building around dynamic qu...
Ben Shneiderman
CHI
2009
ACM
15 years 4 months ago
Matchin: eliciting user preferences with an online game
Eliciting user preferences for large datasets and creating rankings based on these preferences has many practical applications in community-based sites. This paper gives a new met...
Severin Hacker, Luis von Ahn