Sciweavers

1552 search results - page 263 / 311
» Mining for Patterns in Contradictory Data
Sort
View
151
Voted
KDD
2009
ACM
223views Data Mining» more  KDD 2009»
16 years 4 months ago
Collaborative filtering with temporal dynamics
Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are ...
Yehuda Koren
147
Voted
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
15 years 7 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
129
Voted
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 4 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
15 years 8 months ago
Aggregation of Imprecise and Uncertain Information for Knowledge Discovery in Databases
We consider the problem of aggregation for uncertain and imprecise data. For such data, we define aggregation operators and use them to provide information on properties and patte...
Sally I. McClean, Bryan W. Scotney, Mary Shapcott
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 4 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos