association rule discovery
Recently Published Documents


TOTAL DOCUMENTS

57
(FIVE YEARS 2)

H-INDEX

9
(FIVE YEARS 0)

2021 ◽  
Vol 1 (2) ◽  
pp. 54-66
Author(s):  
M. Hamdani Santoso

Data mining can generally be defined as a technique for finding patterns (extraction) or interesting information in large amounts of data that have meaning for decision support. One of the well-known and commonly used association rule discovery data mining methods is the Apriori algorithm. The Association Rule and the Apriori Algorithm are two very prominent algorithms for finding a number of frequently occurring sets of items from transaction data stored in databases. The calculation is done to determine the minimum value of support and minimum confidence that will produce the association rule. The association rule is used to produce the percentage of purchasing activity for an itemset within a certain period of time using the RapidMiner software. The results of the test using the priori algorithm method show that the association rule, that customers often buy toothpaste and detergents that have met the minimum confidence value. By searching for patterns using this a priori algorithm, it is hoped that the resulting information can improve further sales strategies.


2020 ◽  
Vol 24 ◽  
pp. 105-122
Author(s):  
González-Méndez Andy ◽  
Martín Diana ◽  
Morales Eduardo ◽  
García-Borroto Milton

Associative classification is a pattern recognition approach that integrates classification and association rule discovery to build accurate classification models. These models are formed by a collection of contrast patterns that fulfill some restrictions. In this paper, we introduce an experimental comparison of the impact of using different restrictions in the classification accuracy. To the best of our knowledge, this is the first time that such analysis is performed, deriving some interesting findings about how restrictions impact on the classification results. Contrasting these results with previously published papers, we found that their conclusions could be unintentionally biased by the restrictions they used. We found, for example, that the jumping restriction could severely damage the pattern quality in the presence of dataset noise. We also found that the minimal support restriction has a different effect in the accuracy of two associative classifiers, therefore deciding which one is the best depends on the support value. This paper opens some interesting lines of research, mainly in the creation of new restrictions and new pattern types by joining different restrictions.


Sign in / Sign up

Export Citation Format

Share Document