For example: if my dataset contains (A, B), but does not contain (B, A). Then the algorithm may generate the rule A -> B, but will not generate the rule B -> A.

Is there an association rules algorithm, or variation of an algorithm, that respects the order of items in this manner?

  • $\begingroup$ There's the SPADE algorithm. $\endgroup$ – igorkf Aug 17 at 19:47

I think you might be looking for a sequential pattern mining algorithm, such as apriori all.

Agrawal, Rakesh, and Ramakrishnan Srikant. "Mining sequential patterns." Data Engineering, 1995. Proceedings of the Eleventh International Conference on. IEEE, 1995.

Implementation of many current algorithms for mining sequential patterns are available in SPMF.

| cite | improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.