MINI: Mining informative non-redundant itemsets

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

Volumn 4702 LNAI, Issue , 2007, Pages 438-445

  Gallo, Arianna ^a   De Bie, Tijl ^a   Cristianini, Nello ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATABASE SYSTEMS; KNOWLEDGE REPRESENTATION; STATISTICAL METHODS; USER INTERFACES;

FREQUENT ITEMSET MINING; INFORMATIVE NON-REDUNDANT ITEMSETS; MAXIMAL FREQUENT ITEMSETS; TRANSACTION DATABASES;

DATA MINING;

EID: 38049129637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74976-9_44     Document Type: Conference Paper

References (10)

1. Agrawal, R., Imieliski, T., Swarni, A.: Mining association rules between sets of items in large databases. In: SIGMOD, pp. 207-216. ACM Press, New York (1993)
2. Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations, In: KDD, Portland, USA, pp. 189-194 (1996)
3. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. 24(1), 25-46 (1999)
4. Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Moment: Maintaining closed frequent itemsets over a stream sliding window. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol. 3275, Springer, Heidelberg (2004)
5. Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets, pp. 74-85. Springer, Heidelberg (2002)
6. Muhonen, J., Toivonen, H.: Closed non-derivable itemset. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 601-608. Springer, Heidelberg (2006)
7. Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Min. Knowl. Discov. 7(1), 5-22 (2003)
8. Geng, L., Hamilton, H. J.: Interestingness measures for data mining: A survey. ACM Comput. Surv. 38(3), 9 (2006)
9. Yang, C., Fayyad, U., Bradley, P.S.: Efficient discovery of error-tolerant frequent itemsets in high dimensions. In: SIGKDD, pp. 194-203. ACM Press, New York (2001)
10. Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing itemset patterns: a profile-based approach. In: 11th ACM SIGKDD, pp. 314-323. ACM Press, New York (2005)