Sciweavers

2600 search results - page 419 / 520
» Clustering with or without the Approximation
Sort
View
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 9 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
SIGMOD
2008
ACM
116views Database» more  SIGMOD 2008»
14 years 9 months ago
SPADE: the system s declarative stream processing engine
In this paper, we present Spade - the System S declarative stream processing engine. System S is a large-scale, distributed data stream processing middleware under development at ...
Bugra Gedik, Henrique Andrade, Kun-Lung Wu, Philip...
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
14 years 6 months ago
Speeding Up Secure Computations via Embedded Caching.
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
K. Zhai, W. K. Ng, A. R. Herianto, S. Han
EUROSYS
2007
ACM
14 years 6 months ago
Dynamic and adaptive updates of non-quiescent subsystems in commodity operating system kernels
Continuously running systems require kernel software updates applied to them without downtime. Facilitating fast reboots, or delaying an update may not be a suitable solution in m...
Kristis Makris, Kyung Dong Ryu
KDD
2009
ACM
189views Data Mining» more  KDD 2009»
14 years 3 months ago
CoCo: coding cost for parameter-free outlier detection
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
Christian Böhm, Katrin Haegler, Nikola S. M&u...