Sciweavers

6094 search results - page 553 / 1219
» Applications of a Color-Naming Database
Sort
View
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 7 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
16 years 7 months ago
Using randomized response techniques for privacy-preserving data mining
Privacy is an important issue in data mining and knowledge discovery. In this paper, we propose to use the randomized response techniques to conduct the data mining computation. S...
Wenliang Du, Zhijun Zhan
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 7 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
VLDB
2004
ACM
139views Database» more  VLDB 2004»
16 years 7 months ago
Amit - the situation manager
: This paper presents the "situation manager", a tool that includes both a language and an efficient run-time execution mechanism, aimed at reducing the complexity of act...
Asaf Adi, Opher Etzion
VLDB
2006
ACM
122views Database» more  VLDB 2006»
16 years 7 months ago
A secure distributed framework for achieving k-anonymity
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
Wei Jiang, Chris Clifton