Sciweavers

74 search results - page 5 / 15
» Association Mining in Large Databases: A Re-examination of I...
Sort
View
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
15 years 10 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
FQAS
2004
Springer
146views Database» more  FQAS 2004»
15 years 1 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
PAKDD
2004
ACM
199views Data Mining» more  PAKDD 2004»
15 years 2 months ago
Temporal Sequence Associations for Rare Events
In many real world applications, systematic analysis of rare events, such as credit card frauds and adverse drug reactions, is very important. Their low occurrence rate in large da...
Jie Chen, Hongxing He, Graham J. Williams, Huidong...
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
ICTAI
2003
IEEE
15 years 2 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo