Sciweavers

627 search results - page 6 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
74
Voted
PVLDB
2010
95views more  PVLDB 2010»
14 years 9 months ago
Small Domain Randomization: Same Privacy, More Utility
Random perturbation is a promising technique for privacy preserving data mining. It retains an original sensitive value with a certain probability and replaces it with a random va...
Rhonda Chaytor, Ke Wang
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
15 years 4 months ago
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
Ozgur Ozturk, Hakan Ferhatosmanoglu
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 4 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
ICCBR
2003
Springer
15 years 4 months ago
An Empirical Analysis of Linear Adaptation Techniques for Case-Based Prediction
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...
Colin Kirsopp, Emilia Mendes, Rahul Premraj, Marti...
ICPR
2004
IEEE
16 years 7 days ago
Outlier Detection Using k-Nearest Neighbour Graph
We present an Outlier Detection using Indegree Number (ODIN) algorithm that utilizes k-nearest neighbour graph. Improvements to existing kNN distance -based method are also propos...
Ismo Kärkkäinen, Pasi Fränti, Ville...