Sciweavers

282 search results - page 39 / 57
» Generating non-redundant association rules
Sort
View
PODS
2003
ACM
156views Database» more  PODS 2003»
15 years 9 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...
106
Voted
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
14 years 13 days ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...
ICPR
2008
IEEE
15 years 10 months ago
A probabilistic Self-Organizing Map for facial recognition
This article presents a method aiming at quantifying the visual similarity between an image and a class model. This kind of problem is recurrent in many applications such as objec...
Christophe Garcia, Grégoire Lefebvre
174
Voted
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 9 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
91
Voted
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
15 years 4 months ago
Estimating Missing Data in Data Streams
Networks of thousands of sensors present a feasible and economic solution to some of our most challenging problems, such as real-time traffic modeling, military sensing and trackin...
Nan Jiang, Le Gruenwald