مقایسهٔ روش‌ها

	کشف الگوی نوظهور	کاوش قوانین انجمنی (آپریوری)	FP-Growth (رشد الگوی پرتکرار)
حوزه	یادگیری ماشین	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning	Machine learning
سال پیدایش	1999	1994	2000
پدیدآور	Guozhu Dong & Jinyan Li	Rakesh Agrawal & Ramakrishnan Srikant	Jiawei Han, Jian Pei & Yiwen Yin
نوع	Supervised pattern discovery	Unsupervised pattern discovery algorithm	Frequent-itemset mining algorithm
منبع بنیادین	Dong, G., & Li, J. (1999). Efficient mining of emerging patterns: Discovering trends and differences. ACM SIGKDD, 43–52.	Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.
نام‌های دیگر	EP Mining, Contrast Pattern Mining, Differential Pattern Mining, Yükselen Örüntü Madenciliği	Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme
مرتبط	3	3	4
خلاصه	Emerging Pattern Mining (EPM) is a contrast-based data mining technique that identifies itemsets whose support increases significantly — or jumps from zero — when moving from one dataset (or class) to another. Introduced by Dong and Li in 1999, it is primarily used in classification, anomaly detection, and trend analysis tasks where discovering discriminative patterns between two populations or time periods is the central objective.	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.