Sciweavers

6982 search results - page 1001 / 1397
» Collaboration
Sort
View
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
16 years 7 months ago
Overcoming Incomplete User Models in Recommendation Systems Via an Ontology
Abstract. To make accurate recommendations, recommendation systems currently require more data about a customer than is usually available. We conjecture that the weaknesses are due...
Vincent Schickel-Zuber, Boi Faltings
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 7 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
2003
ACM
120views Data Mining» more  KDD 2003»
16 years 7 months ago
On detecting differences between groups
Understanding the differences between contrasting groups is a fundamental task in data analysis. This realization has led to the development of a new special purpose data mining t...
Geoffrey I. Webb, Shane M. Butler, Douglas A. Newl...
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 7 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 7 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
« Prev « First page 1001 / 1397 Last » Next »