Mining frequent patterns with counting inference
Résumé
In this paper, we propose the algorithm PASCAL which introduces a novel optimization of the well-known algorithm Apriori. This optimization is based on a new strategy called pattern counting inference that relies on the concept of key patterns. We show that the support of frequent non-key patterns can be inferred from frequent key patterns without accessing the database. Experiments comparing PASCAL to the three algorithms Apriori, Close and Max-Miner, show that PASCAL is among the most efficient algorithms for mining frequent patterns.
Fichier principal
Mining_Frequent_Patterns_with_Counting_Inference_Bastide_et_al._SIGKDD_2000.pdf (739.27 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...