השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| כריית דפוסים מתפתחים× | כריית כללי אסוציאציה (Apriori)× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 1999 | 1994 |
| הוגה השיטה≠ | Guozhu Dong & Jinyan Li | Rakesh Agrawal & Ramakrishnan Srikant |
| סוג≠ | Supervised pattern discovery | Unsupervised pattern discovery algorithm |
| מקור מכונן≠ | Dong, G., & Li, J. (1999). Efficient mining of emerging patterns: Discovering trends and differences. ACM SIGKDD, 43–52. DOI ↗ | Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216. DOI ↗ |
| כינויים | 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 |
| קשורות | 3 | 3 |
| תקציר≠ | 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. |
| ScholarGateמערך נתונים ↗ |
|
|