American Psychological Association 6th edition

KAI CHEN. (2005, January 1). Mining frequent closed itemsets without candidate generation. Presented at the. Berlin: Springer, 2005. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17457112

ISO-690 (author-date, English)

KAI CHEN, 2005. Mining frequent closed itemsets without candidate generation. In: [online]. Berlin: Springer, 2005. 1 January 2005. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17457112

Modern Language Association 9th edition

KAI CHEN. Mining frequent closed itemsets without candidate generation. Berlin: Springer, 2005., 2005, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17457112.

Mohr Siebeck - Recht (Deutsch - Österreich)

Emerald - Harvard

KAI CHEN. (2005), “Mining frequent closed itemsets without candidate generation”, in , Vol. , Berlin: Springer, 2005., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17457112.

Warning: These citations may not always be 100% accurate.