Sciweavers

9 search results - page 1 / 2
» On Randomization, Public Information and the Curse of Dimens...
Sort
View
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 6 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
VLDB
2005
ACM
136views Database» more  VLDB 2005»
13 years 10 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
JCIT
2010
190views more  JCIT 2010»
12 years 11 months ago
Application of Feature Extraction Method in Customer Churn Prediction Based on Random Forest and Transduction
With the development of telecom business, customer churn prediction becomes more and more important. An outstanding issue in customer churn prediction is high dimensional problem....
Yihui Qiu, Hong Li
ACMSE
2009
ACM
13 years 11 months ago
Applying randomized projection to aid prediction algorithms in detecting high-dimensional rogue applications
This paper describes a research effort to improve the use of the cosine similarity information retrieval technique to detect unknown, known or variances of known rogue software by...
Travis Atkison
CVPR
2003
IEEE
13 years 10 months ago
Adaptive Pattern Discovery for Interactive Multimedia Retrieval
Relevance feedback has been an indispensable component for multimedia retrieval systems. In this paper, we present an adaptive pattern discovery method, which addresses relevance ...
Yimin Wu, Aidong Zhang