388 search results - page 3 / 78 » Mining Frequent Itemsets Using Support Constraints |
JCIT
2008
13 years 7 months ago
2008
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Mining association rules is a task of data mining, which extracts knowledge in the form of significant implication relation of useful items (objects) from a database. Mining multi...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
ICANN
2005
Springer
14 years 1 months ago
2005
Springer
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...
DAWAK
2010
Springer
13 years 8 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...