Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| 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. DOI ↗ | 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. |
| ScholarGateНабор от данни ↗ |
|
|