The Data Mining Forum 
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: https://forum2.philippe-fournier-viger.com/index.php
Doubts in SPAM algorithm
Posted by:
vivek basati
Date: March 22, 2012 05:52AM
hello sir,
i have problem in executing SPAM algorithm in SPMF FRAMEWORK.
i have problem in executing SPAM algorithm in SPMF FRAMEWORK.
- can you please tell me what integer should i give in minsup(minimum support count) for that inputfile you gave??
- please clear me difference in relative minsup(%) used in prefix-span and absolete minsup(integer) used in SPAM??
Re: Doubts in SPAM algorithm
Posted by:
webmasterphilfv
Date: March 22, 2012 08:02AM
Hello,
Thanks for asking the question in the forum.
OK. I will explain the difference between absolute minimum support and relative minimum support.
Consider that you have a sequence database containing 1000 sequences.
If you say minsup = 50 % it is the same thing as saying minsup = 500 sequences.
500 is called an absolute minimum support.
0.5 is called a relative minimum support and it means 50 %.
It is just a different way to tell the minimum support to the algorithm.
In my implementations, SPAM uses an absolute minimum support and PrefixSpan uses a relative minimum support. For SPAM, I have done like this because it was more simple. But I could add the feature of using a relative minimum support when I will have some free time.
Best,
Philippe
Hope this helps!
Edited 1 time(s). Last edit at 03/22/2012 08:03AM by webmasterphilfv.
Thanks for asking the question in the forum.
OK. I will explain the difference between absolute minimum support and relative minimum support.
Consider that you have a sequence database containing 1000 sequences.
If you say minsup = 50 % it is the same thing as saying minsup = 500 sequences.
500 is called an absolute minimum support.
0.5 is called a relative minimum support and it means 50 %.
It is just a different way to tell the minimum support to the algorithm.
In my implementations, SPAM uses an absolute minimum support and PrefixSpan uses a relative minimum support. For SPAM, I have done like this because it was more simple. But I could add the feature of using a relative minimum support when I will have some free time.
Best,
Philippe
Hope this helps!
Edited 1 time(s). Last edit at 03/22/2012 08:03AM by webmasterphilfv.
Re: Doubts in SPAM algorithm
Posted by:
vivek basati
Date: March 22, 2012 08:27AM
hi,Thanq very much sir.
In frequent pattern mining algorithms like prefix-span or SPAM or among any other
algorithms which one would be efficient??
If you cant say directly, can you clarify me which one would be efficient
considering criteria's like time,memory,no. of counts etc...??
Ill be glad if anyone help me in this analysis.
In frequent pattern mining algorithms like prefix-span or SPAM or among any other
algorithms which one would be efficient??
If you cant say directly, can you clarify me which one would be efficient
considering criteria's like time,memory,no. of counts etc...??
Ill be glad if anyone help me in this analysis.