Mining top-K frequent itemsets through progressive sampling

Data Mining and Knowledge Discovery

Volumn 21, Issue 2, 2010, Pages 310-326

  Pietracaprina, Andrea ^a   Riondato, Matteo ^b   Upfal, Eli ^b   Vandin, Fabio ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b Brown Univerity   (United States)

Author keywords

Bloom filters; Frequent itemsets mining; Progressive sampling; Sampling; Top K frequent itemsets

Indexed keywords

BLOOMS (METAL); DATA STRUCTURES; SAMPLING;

BENCHMARK DATASETS; BLOOM FILTERS; BOUNDED ERRORS; FREQUENT ITEMSETS MININGS; GENERAL UPPER BOUND; ITEM SETS; PROGRESSIVE SAMPLING; RANDOM SAMPLE;

FILTRATION;

EID: 77958033888     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-010-0185-7     Document Type: Article

References (17)

1. Charikar M, Chen K, Farach-Colton M (2004) Finding frequent items in data streams. Theor Comput Sci 312(1):3-15
2. Chakaravarthy VT, Pandit V, Sabharwal Y (2009) Analysts of sampling techniques for association rule mining. Proceedings of ICDT 2009, pp 276-283
3. Chen B, Haas P, Scheuermann P (2002) A new two-phase sampling based algorithm for discovering association rules. Proceedings of KDD 2002, pp 462-468
4. Cohen E, Grossaug N, Kaplan H (2008) Processing top-k queries from samples. Comput Netw 52(14): 2605-2622
5. Gibbons PB, Matias Y (1998) New sampling-based summary statistics for improving approximate query answers. Proceedings of SIGMOD 1998, pp 331-342
6. John GH, Langley P (1996) Static versus dynamic sampling for data mining. Proceedings of KDD 1996, pp 367-370
7. Li Y, Gopalan RP (2004) Effective sampling for mining association rules. Proceedings of AUS-AI 2004, pp 391-401
8. Manku GS, Motwani R (2002) Approximate frequency counts over data streams. Proceedings of VLDB 2002, pp 346-357
9. Metwally A, Agrawal D, El Abbadi A (2005) Efficient computation of frequent and top-k elements in data streams. Proceedings of ICDT 2005, pp 398-412
10. Mitzenmacher M, Upfal E (2005) Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press, Cambridge
11. Parthasarathy S (2002) Efficient progressive sampling for association rules. Proceedings of ICDM 2002, pp 354-361
12. Pietracaprina A, Vandin F (2007) Efficient incremental mining of top-K frequent closed itemsets. Proceedings of discovery science 2007, pp 275-280
13. Toivonen H (1996) Sampling large databases for association rules. Proceedings of VLDB 1996, pp 134-145
14. Vasudevan D, Vjnović M (2009) Ranking through random sampling. Manuscript
15. Wang J, Han J, Lu Y, Tzvetkov P (2005) TFP: an efficient algorithm for mining top-κ frequent closed itemsets. IEEE Trans Knowl Data Eng 17(5):652-664 (Pubitemid 40750824)
16. Wong RC-W, Fu AW-C (2006) Mining top-K frequent itemsets from data streams. Data Min Knowl Discov 13(2):193-217
17. Zaki MJ, Parthasarathy S, Li W, Ogihara M (1997) Evaluation of sampling for data mining of association rules. Proceedings of RIDE 1997, pp 42-50