Download now Free registration required
Focus of this paper is to present a new method based on transactional matrix for finding association rules more efficiently. Apriori algorithm is one of the classical algorithms for finding association rules, but it has limitations of number of times database scanned is too large and number of candidate item sets generated is large. To reduce these two limitations a new method tries to find the association rules directly from a matrix which is generated from the transactional database.
- Format: PDF
- Size: 231.13 KB