השוואת שיטות

	כריה של דפוסים סדרתיים (Sequential Pattern Mining)	כריית כללי אסוציאציה (Apriori)
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1995	1994
הוגה השיטה	Rakesh Agrawal & Ramakrishnan Srikant	Rakesh Agrawal & Ramakrishnan Srikant
סוג	Unsupervised pattern discovery	Unsupervised pattern discovery algorithm
מקור מכונן	Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. IEEE International Conference on Data Engineering (ICDE), 3–14.	Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216.
כינויים	Sequence Pattern Mining, Sequential Data Mining, Temporal Pattern Mining, Ardışık Örüntü Madenciliği	Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis
קשורות	3	3
תקציר	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.	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.