ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

연관 규칙 마이닝(Apriori)×FP-성장 (빈발 패턴 성장)×프로세스 마이닝×
분야머신러닝머신러닝프로세스 마이닝
계열Machine learningMachine learningProcess / pipeline
기원 연도199420002016
창시자Rakesh Agrawal & Ramakrishnan SrikantJiawei Han, Jian Pei & Yiwen YinWil van der Aalst
유형Unsupervised pattern discovery algorithmFrequent-itemset mining algorithmData-driven process analysis technique
원전Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216. 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
별칭Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysisfrequent 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
관련342
요약Association Rule Mining is an unsupervised data-mining technique that discovers co-occurrence patterns among items in transactional datasets. Formally introduced by Agrawal, Imieliński, and Swami in 1993, and refined with the landmark Apriori algorithm by Agrawal and Srikant in 1994, it identifies rules of the form X ⇒ Y — meaning that transactions containing itemset X tend to also contain itemset Y — quantified by support, confidence, and lift.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데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Association Rule Mining · FP-Growth · Process Mining. 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare