Sciweavers

98 search results - page 8 / 20
» Parallel Mining of Maximal Frequent Itemsets from Databases
Sort
View
DAWAK
2005
Springer
14 years 1 months ago
A Decremental Algorithm for Maintaining Frequent Itemsets in Dynamic Databases
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...
Shichao Zhang, Xindong Wu, Jilian Zhang, Chengqi Z...
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
14 years 1 months ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 4 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
ACTA
2007
85views more  ACTA 2007»
13 years 7 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
CIKM
2006
Springer
13 years 11 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