Sciweavers

282 search results - page 43 / 57
» Optimal randomization for privacy preserving data mining
Sort
View
DKE
2010
167views more  DKE 2010»
13 years 6 months ago
Discovering private trajectories using background information
Trajectories are spatio-temporal traces of moving objects which contain valuable information to be harvested by spatio-temporal data mining techniques. Applications like city traf...
Emre Kaplan, Thomas Brochmann Pedersen, Erkay Sava...
CIKM
2008
Springer
13 years 11 months ago
Exploiting context to detect sensitive information in call center conversations
Protecting sensitive information while preserving the shareability and usability of data is becoming increasingly important. In call-centers a lot of customer related sensitive in...
Tanveer A. Faruquie, Sumit Negi, Anup Chalamalla, ...
EDM
2009
116views Data Mining» more  EDM 2009»
13 years 6 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 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
ECAI
2010
Springer
13 years 9 months ago
Mining Outliers with Adaptive Cutoff Update and Space Utilization (RACAS)
Recently the efficiency of an outlier detection algorithm ORCA was improved by RCS (Randomization with faster Cutoff update and Space utilization after pruning), which changes the ...
Chi-Cheong Szeto, Edward Hung