Sciweavers

627 search results - page 59 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 8 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
PROFES
2010
Springer
15 years 3 months ago
Regularities in Learning Defect Predictors
Collecting large consistent data sets for real world software projects is problematic. Therefore, we explore how little data are required before the predictor performance plateaus...
Burak Turhan, Ayse Basar Bener, Tim Menzies
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 11 months ago
Selling Privacy at Auction
We initiate the study of markets for private data, through the lens of differential privacy. Although the purchase and sale of private data has already begun on a large scale, a t...
Arpita Ghosh, Aaron Roth
ICIP
1998
IEEE
16 years 27 days ago
Semantic Visual Templates: Linking Visual Features to Semantics
The rapid growth of visual data over the last few years has lead to many schemes for retrieving such data. With content-based systems today, there exists a significant gap between...
Shih-Fu Chang, William Chen, Hari Sundaram
CIKM
2006
Springer
15 years 3 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum