Sciweavers

39 search results - page 5 / 8
» On Minimal Infrequent Itemset Mining
Sort
View
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
14 years 7 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan
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
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 7 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
ISDA
2008
IEEE
14 years 1 months ago
Novel Algorithms for Privacy Preserving Utility Mining
Privacy Preserving Data Mining (PPDM) has become a popular topic in the research community. How to strike a balance between privacy protection and knowledge discovery in the shari...
Jieh-Shan Yeh, Po-Chiang Hsu, Ming-Hsun Wen
AAAI
2006
13 years 8 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...