ScholarGate
Asszisztens

Módszerek összehasonlítása

Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.

Szekvenciális mintázatbányászat×FP-Growth (Frequent Pattern Growth)×Folyamatbányászat×
TudományterületGépi tanulásGépi tanulásFolyamatbányászat
MódszercsaládMachine learningMachine learningProcess / pipeline
Keletkezés éve199520002016
MegalkotóRakesh Agrawal & Ramakrishnan SrikantJiawei Han, Jian Pei & Yiwen YinWil van der Aalst
TípusUnsupervised pattern discoveryFrequent-itemset mining algorithmData-driven process analysis technique
AlapműAgrawal, R., & Srikant, R. (1995). Mining sequential patterns. IEEE International Conference on Data Engineering (ICDE), 3–14. DOI ↗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
Alternatív nevekSequence Pattern Mining, Sequential Data Mining, Temporal Pattern Mining, Ardışık Örüntü Madenciliğifrequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütmeWorkflow Mining, Event Log Analysis, Process Discovery, Süreç Madenciliği
Kapcsolódó342
ÖsszefoglalóSequential Pattern Mining discovers ordered patterns that recur across multiple event sequences in a database. Introduced by Agrawal and Srikant in 1995, it extends association-rule mining to time-ordered transactions. A pattern is frequent when it appears as an ordered subsequence in at least a user-specified fraction of all sequences. The method is widely applied wherever the order of events carries meaning, such as customer purchase histories, clickstream logs, electronic health records, and DNA sequence analysis.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.
ScholarGateAdatkészlet
  1. v1
  2. 1 Források
  3. PUBLISHED
  1. v1
  2. 2 Források
  3. PUBLISHED
  1. v1
  2. 2 Források
  3. PUBLISHED

Ugrás a kereséshez Diák letöltése

ScholarGateMódszerek összehasonlítása: Sequential Pattern Mining · FP-Growth · Process Mining. Letöltve 2026-06-17, forrás: https://scholargate.app/hu/compare