Thanks for your explanation. At the last step, is the support of {abfe} = 2? It seems that support of {abfe} = 1. Would you mind to answer this please?
minsupport=3/4 means subsequence need to be present in at least 3 sequences where 4 is the total number of sequences. In this video, Example has a total of 4 sequences and considered minsup=2 which means subsequence must be present in at least 2 sequences out of 4. therefore minsup that we considered is actually 2/4
{(ab)} is frequent and {b,f} is frequent and the have common item b. So we can join those two sequences to form 3-length sequence. While forming 3-length sequence in first sequence a,b are in same transaction and in second sequence b,f are in different transactions. Therefore we form 3-length sequence {(a,b),f}.
Best GSP video on youtube. Thank you
Very clean and clear explanation. Made it very easy to understand the algorithm properly.
Your explanation clear as the sun in the middle of the sky. A billion thanks
Thanks for the clear-cut explanation ma'am. I'm sure that I'm going to get full marks for this type of question in my tomorrow's exam.❤
Thank you for a dedicated educational lecture.
Good and Clear Explaination, Do more videos for similar algorithms
Thank you soo much. it helped me a lot
Amazing explanation, congratulations!
Great video mam.
Thanks for your explanation. At the last step, is the support of {abfe} = 2?
It seems that support of {abfe} = 1.
Would you mind to answer this please?
Ya thats correct, support of abfe=1. It is a mistake in video
@@shivanisrivarshini180 Thank you so much.
In C2 generation, don’t you also have to check for , , …. ?
If a and a both belongs to different transactions in a sequence then we consider it else no need to consider
thank u that was really helpful
Amazing explanation thank you so much
Nice video! Can you also please show PrefixSpan algorithm?
Can u please suggest implementation in python
NIT. Warangal?
How did you get {ab(f,g)} ?
How to proceed with support is given like 3/4 ? or 2/3?
minsupport=3/4 means subsequence need to be present in at least 3 sequences where 4 is the total number of sequences. In this video, Example has a total of 4 sequences and considered minsup=2 which means subsequence must be present in at least 2 sequences out of 4. therefore minsup that we considered is actually 2/4
thank you so much
how (ab)f is generated?
{(ab)} is frequent and {b,f} is frequent and the have common item b. So we can join those two sequences to form 3-length sequence. While forming 3-length sequence in first sequence a,b are in same transaction and in second sequence b,f are in different transactions. Therefore we form 3-length sequence {(a,b),f}.
hello can you share the lesson presentation with us?
PPT link is available in the description
can we say: {a(f,g)} and {fge} as {a(f,g)e} ?
No
Final output is wrong abfe will not be there
yeah even i noticed that
Do you mind explaining why ?
can you send me the ppts
PPT link is available in the description
docs.google.com/forms/d/e/1FAIpQLSd8t1TkZFsF0cxxF63Gnl5sH8ZPMUhNIf6X3P7tiuCk1Gkljg/viewform?usp=pp_url