Sciweavers

1701 search results - page 264 / 341
» Providing k-anonymity in data mining
Sort
View
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 11 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
MINENET
2005
ACM
14 years 3 months ago
Experiences with a continuous network tracing infrastructure
One of the most pressing problems in network research is the lack of long-term trace data from ISPs. The Internet carries an enormous volume and variety of data; mining this data ...
Alefiya Hussain, Genevieve Bartlett, Yuri Pryadkin...
IDEAS
2000
IEEE
90views Database» more  IDEAS 2000»
14 years 2 months ago
StreamJoin: A Generic Database Approach to Support the Class of Stream-Oriented Applications
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...
Clara Nippl, Ralf Rantzau, Bernhard Mitschang
IJCAI
2007
13 years 11 months ago
A Subspace Kernel for Nonlinear Feature Extraction
Kernel based nonlinear Feature Extraction (KFE) or dimensionality reduction is a widely used pre-processing step in pattern classification and data mining tasks. Given a positive...
Mingrui Wu, Jason D. R. Farquhar
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
13 years 12 months ago
Active learning for biomedical citation screening
Active learning (AL) is an increasingly popular strategy for mitigating the amount of labeled data required to train classifiers, thereby reducing annotator effort. We describe ...
Byron C. Wallace, Kevin Small, Carla E. Brodley, T...