Data Mining Lecture - - Finding frequent item sets | Apriori Algorithm | Solved Example (Eng-Hindi)

ok i pull up

good job Abdul you are a good teacher, best wishes for your journey ahead in this field

wow

What If minimum support is not given in percentage????

Great exaplanation ♥

If l1 ^l2-->l3 then what is the confidence rule occurence of l1 or occurence of l2??

Thanks bro

Love You Bhai Thanks a lot 🙏🙏🙏🙏🙏

Well explained sir! Thank you

ask. Is it if we only want or are only able to make 3 iterations, does that violate the Apriori concept itself?

You are a god you helped me in exam

thank you so much sir

tommorrow is my paper and this vedio really help me

Whenever we got a tend b
And b tends c
How can I calculate support plz tell me

Thanks for making a clear explanation !!

Tq for well explanation I clear the whole concept

Really it is very helpful to me now sir tq very much ,even my teacher also can't explain like this sir tq

Thank u sir studying just a nyt before exam ur video is very helpful❤️

humny C -> D = A q nahi kia?

Could you please make videos on Sequential Pattern Mining? You break it down beautifully and easy to follow. You are doing a great job

when we have to c3?

If the confidence is not came according to the question, what should we write at final rule

A database has four transactions. Let min_sup=60% and min_conf-80%
TID
Date
Items Bought

100
10/15/2018
{K, A, B, D}

200
10/15/2018
{D, A, C, E, B}

300
10/19/2018
{C, A, B, E}

400
10/22/2018
{B, A, D}

1) Find all frequent items using Apriori & FP-growth, respectively. Compare the efficiency of the two-meaning process.
2) List all of the strong association rules (with support 's' and confidence 'c') matching the following meta-rule where X is a variable representing customers, and item i denotes variables representing items (e.g., "A", "B",etc.): Vx C transactions, buys(X,item1) ^ buys(X,item2) => buys(X,item3) [s,c]
Please explain this sir?

Thank you

Bro jo L1 h usi ko hum.large itemset bolte h..

good explained

A^c-->d how to calculate

are Abdul bhaiya kaha se kahaa pohoh gyr hatss off bro

If my frequent itemset is like: {1,2,3,4} then how association rules will be created?

How can we get 2 as I know it's answer is 8.

thanks very helpful in Apriori Algorithm

love from kerala , ktu student'

Thanks ! Clearly explained ! This is what i was in search of !

Awesome explanation

Thankyou sir 🙏

Best......teacher👍🏻

MashaALLAH good brother

great Allah Ap ke ilam ma aur izafa karay ameen

Hi it would have been good if u explained outline of why we calculated support and confidence and what is its use in apriori algorithm

Sir if it was A^c->D what would be confidence then please Tell i have an exam on fri

Or ager dono answer below than minimum confidence ho to Kya final answer ho ga

Bro ippudu A and C tends to D oste confidence ela find chestham I mean to say 3 items ochinappudu

Try to explain in English.. Plzzzzz...

Thanku for this video bhayya. .it's really helpful for my exam...

Perfect explanation 🥰😌

Thanks mere bhai....👏👏

Good work bro aacha samjaya agr koi language aati h programing ki toh video banao uplod maro

explaining it like a pro..

thanks sir

nicely explained