Sciweavers

1403 search results - page 38 / 281
» Set cover algorithms for very large datasets
Sort
View
AAIM
2008
Springer
208views Algorithms» more  AAIM 2008»
13 years 10 months ago
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purc...
Yunhong Zhou, Dennis M. Wilkinson, Robert Schreibe...
MEDIAFORENSICS
2010
13 years 10 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...
ISCI
1998
139views more  ISCI 1998»
13 years 8 months ago
A Rough Set Approach to Attribute Generalization in Data Mining
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
Chien-Chung Chan
HCW
2000
IEEE
14 years 27 days ago
Design of a Framework for Data-Intensive Wide-Area Applications
Applications that use collections of very large, distributed datasets have become an increasingly important part of science and engineering. With high performance wide-area networ...
Michael D. Beynon, Tahsin M. Kurç, Alan Sus...
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
14 years 5 months ago
Finding Representative Association Rules from Large Rule Collections.
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
Warren L. Davis IV, Peter Schwarz, Evimaria Terzi