Stage-oe-small.jpg

Article524: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
 
K (Added from ontology)
Zeile 1: Zeile 1:
 +
{{Publikation Author
 +
|Rank=2
 +
|Author=Rafik Taouil
 +
}}
 
{{Publikation Author
 
{{Publikation Author
 
|Rank=5
 
|Rank=5
Zeile 4: Zeile 8:
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
|Rank=4
+
|Rank=3
|Author=Gerd Stumme
+
|Author=Nicolas Pasquier
}}
 
{{Publikation Author
 
|Rank=2
 
|Author=Rafik Taouil
 
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
Zeile 16: Zeile 16:
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
|Rank=3
+
|Rank=4
|Author=Nicolas Pasquier
+
|Author=Gerd Stumme
 
}}
 
}}
 
{{Article
 
{{Article

Version vom 15. Juli 2009, 01:02 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

BibTeX




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.



Forschungsgebiet