Sciweavers

2988 search results - page 104 / 598
» Experiments with a New Boosting Algorithm
Sort
View
JCDL
2009
ACM
127views Education» more  JCDL 2009»
15 years 11 months ago
Finding topic trends in digital libraries
We propose a generative model based on latent Dirichlet allocation for mining distinct topics in document collections by integrating the temporal ordering of documents into the ge...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
RECSYS
2009
ACM
15 years 11 months ago
Recommending new movies: even a few ratings are more valuable than metadata
In the Netflix Prize competition many new collaborative filtering (CF) approaches emerged, which are excellent in optimizing the RMSE of the predictions. Matrix factorization (M...
István Pilászy, Domonkos Tikk
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
15 years 9 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
TASE
2008
IEEE
15 years 4 months ago
New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
Hoksung Yau, Yunpeng Pan, Leyuan Shi
JCDL
2004
ACM
170views Education» more  JCDL 2004»
15 years 10 months ago
Looking for new, not known music only: music retrieval by melody style
With the growth of digital music, content-based music retrieval (CBMR) has attracted increasingly attention. For most CBMR systems, the task is to return music objects similar to ...
Fang-Fei Kuo, Man-Kwan Shan