Sciweavers

284 search results - page 13 / 57
» Mining Frequent Itemsets in Distributed and Dynamic Database...
Sort
View
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
15 years 11 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
PODS
2004
ACM
130views Database» more  PODS 2004»
15 years 9 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
CIKM
2006
Springer
15 years 1 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
91
Voted
KDD
2007
ACM
170views Data Mining» more  KDD 2007»
15 years 10 months ago
From frequent itemsets to semantically meaningful visual patterns
Data mining techniques that are successful in transaction and text data may not be simply applied to image data that contain high-dimensional features and have spatial structures....
Junsong Yuan, Ying Wu, Ming Yang
77
Voted
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
15 years 3 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang