Association Analysis with One Scan of Databases

Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves better performance and efficiency than Apriori-like algorithms. However, the database still needs to be scanned twice to get t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Huang, Hao, Wu, Xindong, Relue, Richard
Format:	Report
Sprache:	eng
Schlagworte:	ALGORITHMS Computer Programming and Software DATA BASES FP-TREE(FREQUENT PATTERN-TREE) FREQUENCY INFORMATION RETRIEVAL P-TREE(PATTERN-TREE) PATTERN RECOGNITION SCANNING
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!