Constrained itemset mining on a sequence of incoming data blocks

International Journal of Intelligent Systems

Volumn 25, Issue 5, 2010, Pages 389-410

  Baralis, Elena ^a   Cerquitelli, Tania ^a   Chiusano, Silvia ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS METHODS; BUSINESS INFORMATION; DATA BLOCKS; DATA DISTRIBUTION; DATA MINING MODELS; DATA REPRESENTATIONS; EXECUTION TIME; FLAT FILES; FOREST STRUCTURE; ITEMSET MINING; OLD BLOCKS; OPEN SOURCES; PHYSICAL LEVEL; POSTGRESQL; REAL-LIFE DATABASE; RETAIL CHAINS; TRANSACTIONAL DATA; TREE ALGORITHMS;

EID: 77951056506     PISSN: 08848173     EISSN: 1098111X     Source Type: Journal    
DOI: 10.1002/int.20404     Document Type: Article

References (34)

1. Ganti V, Gehrke J, Ramakrishnan R. DEMON: mining and monitoring evolving data. IEEE Trans Knowl Data Eng 2001;13(1):50-63.
2. Ganti V, Gehrke JE, Ramakrishnan R.Mining data streams under block evolution. SIGKDD Explorations 2002;3(2):1-10.
3. Agrawal R, Imilienski T, Swami A. Mining association rules between sets of items in large databases. In SIGMOD'93 , Washington DC, May 1993.
4. Agrawal R, Srikant R. Fast algorithm for mining association rules. In: VLDB'94, Santiago, Chile, Sept. 1994.
5. Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In: ACM SIGMOD, 2000.
6. Mannila H, Toivonen H, Verkamo AI. Efficient algorithms for discovering association rules. In: KDD Workshop, 1994. pp 181-192.
7. Orlando S, Lucchese C, Palmerini P, Perego R, Silvestri F. KDCI: a multi-strategy algorithm for mining frequent sets. In: FIMI, 2003.
8. Savasere A, Omiecinski E, Navathe SB. An efficient algorithm for mining association rules in large databases. In: VLDB, 1995. pp 432-444.
9. Toivonen H. Sampling large databases for association rules. In: VLDB, 1996. pp 134-145.
10. Goethals B, Zaki MJ. FIMI'03: Workshop on frequent itemset mining implementations. In: FIMI'03, November 2003.
11. Goethals B, Zaki MJ, Bayardo R. FIMI'04: Workshop on frequent itemset mining implementations. In: FIMI'04, November 2004.
12. Agrawal R, Shim K. Developing tightly-coupled data mining applications on a relational database system. In ACM SIGKDD, 1996.
13. Imielinski T, Mannila H. A database perspective on knowledge discovery. Commun ACM 1996;39:58-64.
14. Imielinski T, Virmani A, Abdulghani A. Disovery board application programming interface and query language for database mining. In: KDD 96, Portland, Ore., August 1996. pp 20-26.
15. PostgreSQL. Web site on http://www.postgresql.org.
16. Grahne G, Zhu J. Efficiently using prefix-trees in mining frequent itemsets. In FIMI, November 2003.
17. Uno T, Kiyomi M, Arimura H. LCM ver. 2: efficient mining algorithms for frequent/closed/ maximal itemsets. In: FIMI, 2004.
18. El-HajjM, Zaiane OR. Inverted matrix: efficient discovery of frequent items in large datasets in the context of interactive mining. In: ACM SIGKDD, 2003.
19. Pietracaprina A, Zandolin D. Mining frequent itemsets using patricia tries. In: FIMI, 2003.
20. Baralis E, Cerquitelli T, Chiusano S. Index support for frequent itemsetmining in a relational DBMS. In: ICDE, 2005. pp 754-765.
21. FIMI. Web site http://fimi.cs.helsinki.fi/.
22. Agrawal N, Imielinski T, Swami A. Database mining: A performance perspective. In IEEE Trans. Knowl Data Eng 1993;5(6):914-925.
23. CheungW, Zaiane OR. Incremental mining of frequent patternswithout candidate generation or support constraint. In: IDEAS, July 2003. pp 111-116.
24. Aumann Y, Feldman R, Lipshtat O. Borders: An efficient algorithm for association generation in dynamic databases. In: JIIS, 1999. Vol 12, pp 61-73.
25. Cheung DW-L, Han J, Ng V,Wong CY.Maintenance of discovered association rules in large databases: An incremental updating technique. In: ICDE,Washington, DC, IEEE Computer Society, 1996. pp 106-114.
26. Veloso A, M. de Carvalho WM Jr., Pôssas B, Parthasarathy S, Zaki MJ. Mining frequent itemsets in evolving databases. In: SDM, 2002.
27. Dumitriu L. Interactive mining and knowledge reuse for the closed-itemset incrementalmining problem. SIGKDD Explorations, 2002;3(2):28-36.
28. Lan B, Ooi B, Tan K-L. Efficient indexing structures for mining frequenty patterns. In: IEEE ICDE, 2002.
29. Liu G, Lu H, LouW, Yu JX. On computing, storing and querying frequent patterns. In: ACM SIGKDD, 2003.
30. Ramesh G, ManiattyW, Zaki M. Indexing and data access methods for database mining. In: DMKD, 2002.
31. Zaki M. Scalable algorithms for association mining. IEEE Trans. Knowl Discovery Data Eng 2000;12(3):372-390.
32. Han J, Fu Y, Wang W, Koperski K, Zaiane O. DMQL: A data mining query language for relational databases. In: DMKD, 1996.
33. Meo R, Psaila G, Ceri S. A new SQL-like operator for mining association rules. In: VLDB, 1996.
34. Rajamani K, Iyer B, Chadha A. Using DB/2's object relational extensions for mining associations rules. September 1997. Technical Report TR 03,690, Santa Teresa Laboratory, IBM Corp.