Sciweavers

12148 search results - page 2198 / 2430
» Generalized Bundle Methods
Sort
View
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 4 months ago
Modeling relationships at multiple scales to improve accuracy of large recommender systems
The collaborative filtering approach to recommender systems predicts user preferences for products or services by learning past useritem relationships. In this work, we propose no...
Robert M. Bell, Yehuda Koren, Chris Volinsky
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 4 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 4 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
156
Voted
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 4 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
144
Voted
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 4 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
« Prev « First page 2198 / 2430 Last » Next »