Efficient incremental mining of top-K frequent closed itemsets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4755 LNAI, Issue , 2007, Pages 275-280

  Pietracaprina, Andrea ^a   Vandin, Fabio ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DYNAMICAL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

CLOSED ITEMSETS; EFFICIENT ALGORITHMS; INCREMENTAL MINING; ITEMSETS;

DATA MINING;

EID: 38149074872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75488-6_29     Document Type: Conference Paper

References (11)

1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of the ACM SIGMOD Intl. Conference on Management of Data, pp. 207-216 (1993)
2. Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On maximal frequent and minimal infrequent sets in binary matrices. Annals of Mathematics and Artificial Intelligence 39, 211-221 (2003)
3. Cheung, Y., Fu, A.: Mining frequent itemsets without support threshold: with and without item constraints. IEEE Trans, on Knowledge and Data Engineering 16(9), 1052-1069 (2004)
4. Fu, A., Kwong, R., Tang, J.: Mining n-most interesting itemsets. In: Proc. of the Intl. Symp. on Methodologies for Intelligent Systems, pp. 59-67 (2000)
5. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proc. of the 7th Int. Conference on Database Theory, pp. 398-416 (1999)
6. Pietracaprina, A., Vandin, F.: Efficient Incremental Mining of Top-K Frequent Closed Itemsets. Technical Report, available at http://www.dei.unipd. it/c~apri/PietracaprinaVTR07.pdf
7. Pietracaprina, A., Zandolin, D.: Mining frequent itemsets using Patricia tries. In: Proc. of the Workshop on Frequent Itemset Mining Implementations, FIMI 2003. CEUR-WS Workshop On-line Proceedings. Melbourne, USA, vol. 90 (2003)
8. Seppanen, J., Mannila, H.: Dense itemsets. In: Proc. of the 10th ACM SIGKDD Intl. Conference on Knowledge Discovery and Data Mining, pp. 683-688 (2004)
9. Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 16-31. Springer, Heidelberg (2004)
10. Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans, on Knowledge and Data Engineering 17(5), 652-664 (2005)
11. Yang, G.: The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proc. of the 10th ACM SIGKDD Intl. Conference on Knowledge Discovery and Data Mining, pp. 344-353 (2004)