Sciweavers

446 search results - page 49 / 90
» Randomization in Privacy-Preserving Data Mining
Sort
View
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 10 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
AIED
2009
Springer
14 years 4 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
ICDM
2005
IEEE
128views Data Mining» more  ICDM 2005»
14 years 3 months ago
An Expected Utility Approach to Active Feature-Value Acquisition
In many classification tasks training data have missing feature values that can be acquired at a cost. For building accurate predictive models, acquiring all missing values is of...
Prem Melville, Foster J. Provost, Raymond J. Moone...
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 8 months ago
Improved Consistent Sampling, Weighted Minhash and L1 Sketching
Abstract--We propose a new Consistent Weighted Sampling method, where the probability of drawing identical samples for a pair of inputs is equal to their Jaccard similarity. Our me...
Sergey Ioffe
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 10 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford