Sciweavers

628 search results - page 77 / 126
» Selective association rule generation
Sort
View
ICPR
2008
IEEE
16 years 1 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
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 2 days 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
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
15 years 6 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
ICANN
2005
Springer
15 years 5 months ago
Principles of Employing a Self-organizing Map as a Frequent Itemset Miner
This work proposes a theoretical guideline in the specific area of Frequent Itemset Mining (FIM). It supports the hypothesis that the use of neural network technology for the prob...
Vicente O. Baez-Monroy, Simon O'Keefe
CONCUR
2006
Springer
15 years 3 months ago
Concurrent Rewriting for Graphs with Equivalences
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari