Computer Science ›› 2006, Vol. 33 ›› Issue (3): 188-190.
Previous Articles Next Articles
Online:
Published:
Abstract: In this paper, a fast and efficient algorithm MPNAR is presented to discover positive and negative association rules. Meanwhile, a method based on binary format is proposed to calculate the support of candidate ferquent itemsets. The experiments show that
Key words: Data mining, Frequent itemsets, Negative association rules
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2006/V33/I3/188
Cited