Article524: Unterschied zwischen den Versionen
Aus Aifbportal
K (Added from ontology) |
K (Added from ontology) |
||
| Zeile 1: | Zeile 1: | ||
| − | |||
| − | |||
| − | |||
| − | |||
{{Publikation Author | {{Publikation Author | ||
|Rank=5 | |Rank=5 | ||
| Zeile 8: | Zeile 4: | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| − | |Rank= | + | |Rank=1 |
| − | |Author= | + | |Author=Yves Bastide |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| − | |Rank= | + | |Rank=2 |
| − | |Author= | + | |Author=Rafik Taouil |
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=4 | |Rank=4 | ||
|Author=Gerd Stumme | |Author=Gerd Stumme | ||
| + | }} | ||
| + | {{Publikation Author | ||
| + | |Rank=3 | ||
| + | |Author=Nicolas Pasquier | ||
}} | }} | ||
{{Article | {{Article | ||
| Zeile 29: | Zeile 29: | ||
|Abstract=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. | |Abstract=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. | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
| − | | | + | |Download=2000_524_Bastide_Mining Frequent_1.pdf |
| − | |||
| − | |||
|Forschungsgebiet= | |Forschungsgebiet= | ||
|Projekt= | |Projekt= | ||
|Forschungsgruppe= | |Forschungsgruppe= | ||
}} | }} | ||
Version vom 7. August 2009, 12:48 Uhr
Mining Frequent Patterns with Counting Inference
Mining Frequent Patterns with Counting Inference
Veröffentlicht: 2000
Journal: SIGKDD Exploration Special Issue on Scalable Algorithms
Seiten: 71-80
Referierte Veröffentlichung
Kurzfassung
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.
Download: Media:2000_524_Bastide_Mining Frequent_1.pdf
Forschungsgebiet