השוואת שיטות

	FP-Growth (גידול דפוסים תדירים)	כריית תהליכים
תחום	למידת מכונה	כריית תהליכים
משפחה	Machine learning	Process / pipeline
שנת המקור	2000	2016
הוגה השיטה	Jiawei Han, Jian Pei & Yiwen Yin	Wil van der Aalst
סוג	Frequent-itemset mining algorithm	Data-driven process analysis technique
מקור מכונן	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.	van der Aalst, W. M. P. (2016). Process Mining: Data Science in Action (2nd ed.). Springer. ISBN: 978-3-662-49850-7
כינויים	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme	Workflow Mining, Event Log Analysis, Process Discovery, Süreç Madenciliği
קשורות	4	2
תקציר	FP-Growth, introduced by Jiawei Han, Jian Pei, and Yiwen Yin in 2000, mines frequent itemsets from transaction data without generating candidate sets, the costly step that slows the classic Apriori algorithm. It compresses the database into a frequent-pattern tree (FP-tree) in two scans, then grows frequent patterns recursively from that structure, making it dramatically faster than Apriori on large, dense datasets.	Process Mining is a data-driven discipline that extracts knowledge about real-world processes from event logs recorded by information systems. Introduced systematically by Wil van der Aalst, with foundational workflow mining formalized in 2004 and consolidated in the 2016 textbook, the technique bridges data science and process management. It enables organizations to discover how processes actually execute, check whether execution conforms to prescribed models, and diagnose performance bottlenecks — all directly from digital traces.