The Data Mining Forum                             open-source data mining software data mining conferences Data Science for Social and Behavioral Analytics DSSBA 2022 data science journal
IMPORTANT: This is the old Data Mining forum.
I keep it online so that you can read the old messages.

Please post your new messages in the new forum:
Mining Top K sequential rules
Posted by: noura
Date: May 13, 2014 02:10PM

hi sir,

i have tried to download the presentation in
but I couldn't

i have please a small question about Top-K sequential Rules, what is exactly their utility and i was reasding your paper "Mining Top-K Sequential Rules" and i read in the second page "Note that X and Y are unordered." so for a rule {a, b, c}⇒{e, f, g} i think we can write {b,A}⇒{f,g} is this possible?

thanks for reading my message

Best regards,

Options: ReplyQuote
Re: Mining Top K sequential rules
Date: May 13, 2014 02:29PM


Here is the link to download the PDF of the powerpoint presentation:

If it still does not work, you may send me an e-mail at philippe.fv AT and I can send it directly to your e-mail.

Note however that the powerpoint is not very detailed. It just gives the main points about the algorithm.

Yes, the rule {a, b, c}⇒{e, f, g} could be written as {b,a,c}⇒{g, f, e} and it would have the same meaning. But to make it easier to read, in the examples provided in the paper the letters are always alphabetically ordered. Note also that in the implementations letters are also alphabetically ordered. The reason is that it allows some optimizations (without any loss of generality).

What is the utility? Well, sequential rules can be used to identify which items are followed by which items in a sequence with a high confidence. This may be used for example to perform prediction. For example, if you have some sequences of webpages visited by user, you may discover some rules such as page1, page2 --> page3, meaning that people who have visited page1 and page2 (in any order), will then visit page 3 with a given confidence. I have used this application as an example in this paper:

Now, why mining the top-k rules? The reason is that sometimes it may be hard to decide what is the appropriate minsup threshold (it depends on your data). So using a top-k algorithm, you can say that you want to find only the k=1000 most frequent rules for example.

This is the main idea.


Options: ReplyQuote
Re: Mining Top K sequential rules
Posted by: noura
Date: May 14, 2014 08:57AM

Hi Sir,

i can download the file from the link provided above,thank you.

now, it is very clear sir, many thanks for this explanation

I am thinking to use suqential rule mining for network security, and i am thinking to decrease the time of response and analyse by using limted number of important and usful sequential rule.

thanks once again

Best regards

Options: ReplyQuote
Re: Mining Top K sequential rules
Date: May 14, 2014 05:02PM


Glad that the download link works.

It seems like a good project.



Options: ReplyQuote

This forum is powered by Phorum and provided by P. Fournier-Viger (© 2012).
Terms of use.