Sciweavers

446 search results - page 60 / 90
» Randomization in Privacy-Preserving Data Mining
Sort
View
AUSDM
2006
Springer
112views Data Mining» more  AUSDM 2006»
14 years 1 months ago
Accuracy Estimation With Clustered Dataset
If the dataset available to machine learning results from cluster sampling (e.g. patients from a sample of hospital wards), the usual cross-validation error rate estimate can lead...
Ricco Rakotomalala, Jean-Hugues Chauchat, Fran&cce...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 10 months ago
High-throughput Protein Interactome Data: Minable or Not?
There is an emerging trend in post-genome biology to study the collection of thousands of protein interaction pairs (protein interactome) derived from high-throughput experiments....
Jake Yue Chen, Andrey Y. Sivachenko, Lang Li
KDD
2005
ACM
205views Data Mining» more  KDD 2005»
14 years 3 months ago
Feature bagging for outlier detection
Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel feature bagging approach for detecting outliers in...
Aleksandar Lazarevic, Vipin Kumar
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
13 years 11 months ago
Adaptive Informative Sampling for Active Learning
Many approaches to active learning involve periodically training one classifier and choosing data points with the lowest confidence. An alternative approach is to periodically cho...
Zhenyu Lu, Xindong Wu, Josh Bongard
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 11 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand