An algorithm based on predicate path graph for mining multidimensional association rules

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multidimensional association rules is more common in association rule mining. For a shortcoming that current multidimensional association mining algorithms need to scan database many times, this paper presents an association rule mining algorithm, Ex-Apriori, based on the predicate path graph. The algorithm can produce the predicate path graph by scanning database only once, and dig out the frequent pattern based on the frequent predicate path graph. Hence it avoids the shortcoming of scanning database many times. The experiment shows that compared with the classical association rule mining algorithm Apriori, Ex-Apriori algorithm has a significant improvement in time efficiency. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhu, H., & Li, Q. (2013). An algorithm based on predicate path graph for mining multidimensional association rules. In Lecture Notes in Electrical Engineering (Vol. 211 LNEE, pp. 783–791). https://doi.org/10.1007/978-3-642-34522-7_83

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free