Sciweavers

422 search results - page 57 / 85
» Online Generation of Association Rules
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 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
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
14 years 3 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
14 years 2 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
14 years 18 days 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
DEXA
2006
Springer
129views Database» more  DEXA 2006»
14 years 16 days ago
Selectively Storing XML Data in Relations
This paper presents a new framework for users to select relevant data from an XML document and store it in an existing relational database, as opposed to previous approaches that s...
Wenfei Fan, Lisha Ma