data mining fp growth | data mining fp growth algorithm | data mining fp tree example | fp growth

[@supergoan5431]

Though your "m" and "f" are weird,but explaination is good💯💯

[@saikumarageeru1170]

😂😂😂

[@jpt7331]

whats with the alien "m"

[@ankitmahajan3882]

haha

[@bikemaster5617]

alien "f"

[@amardhumane8638]

Hahahahhahahhhhha

[@ankitagarwal9436]

amazing...haha

[@ketananand3982]

Very nicely explained....but i wanna say that the second series(f,c,a,b,m) when connected to m:3 after b:3 finally becomes the series (f,c,a,b,m,p) because the last node is p:3.....I think another node with m:1 should be taken after b:3 and one count of m should be submitted from m:3. kindly have a look.

[@baburahul9345]

yeah u r right !! he made a mistake..

[@nourbadran7109]

You are right bro..

[@cvsnreddy1700]

ketan anand n

[@ferbot123]

it is correct

[@udupi123456]

wow this video and channel saved my last minute study for mtech , not sure if i will do it. but i dont need to be worried that i never understood this concept ....

[@ketanupase]

Mistake Created First table there is one mistake which is support of b item set is 4 and in table that you created there is 3 otherwise i understand all concept of fp- growth i liked it and i subscribed this channel really helpful

[@Jam05_]

Thanks bro! For helping, wishing you all the best for your future videos, keep going! 👍👌

[@puliranjithkumar8831]

At 10:36 .after b we visit m but we don't have to visit p why because we don't have p in ordered item p in second transaction.

[@sukainafatima4156]

Puli Ranjith kumar that doesnt matter as the pattern is satisfied already.

[@shanegracias8501]

It's wrong what he is teaching he drew a graph not a tree

[@shanegracias8501]

The name is fp tree not fp graph

[@akshaypendyala]

Yes exactly

[@anurondas3853]

Really awesome explanation brother!!! God bless you.

[@priyaphapale5181]

Superb video... You are amazing. Thank you so much.

[@DarlingHiroXX]

you succeeded in explaining the topic overall. thank you so much for that. 😄

[@hammayunraza5267]

Hi, Can I write 'C' as the first position or before 'F' in descending order during support count, because both have the same support count value?

[@coderclass1155]

Bhai apto Kamal karthe ho ❤🔥

[@shivamchauhan2673]

in f.c.a.b.m pattern we will use new m node after b:1 as the current one will lead to f.c.a.b.m.p making an extra p in last,

[@haseebsheikh6101]

Thanks man

[@rubel1477]

exactly

[@sreyassuresh1886]

"'f' looks like 'b'. Sorry for that." You think the 'm' is good enough?. Just kiddin'g. The explanation was good.

[@ShriramJoshi45]

Cool dude!!!..............Very nicely explained ........made so simple...............You have very good pace and cool and clam explanation. Its helping me to tackle subject in my MTech Exam form Bits Pillani. Subject which otherwise felt to be boaring. You have made it interesting.Thanks a ton.

[@Its_Personal456]

Hi I'm also join BITS Pilani m.tech program this year can you help me for some guidance and preparation for exam?? Have any notes or previous question paper share with me "[e-mail]"

[@saikumarminajagi1452]

*boring

[@meharfari5410]

Well done MaShaAllah

[@user-je3fs9ne1g]

Very nicely explained.👍👍👍

[@granturismoautos]

Excellent work! Please solve more questions of FP-Growth, Apriori Algorithm, etc. Thank you.

[@guptanitesh40]

bro you are doing great work continue the work......

[@anuj87in]

Thanks , Badly needed a quick and logical explanation

[@ashfiji]

very nicely done, my understanding that there should be m1 under b3 or (b1)

[@manijawa1988]

Very nicely explained sir. Thank you sir. :D

[@damanjeetsingh4112]

thanx a lot for this ... :) btw, 'h' bhool gaya :p

[@manijawa1988]

Sir do you any video for DBSCAN, market basket analysis as well? If yes, please share the link as I am unable to locate it on your page. Thank you in advance.

[@nitantsanwal]

nice videos..!! agar thode examples b doge to it would b better..ek episode samjane k liye banao n dusra ek video me usi topic k examples solve karao...

[@rafath6463]

Explanation is very clearly so thank you🔥❤️

[@Shivani-vg6lp]

Very good 👍

[@saurabhshinde9769]

Thnxxx man😊

[@RithuJagan_Settaigal]

sir your session is awesome well explained even the person from other than computer science department can also understand.sir i have a doubt while writing the ordered items why you didnt write c first since c and f have same support pattern .

[@omkarkumbhar2001]

Thanks Sir🙏🙏🙏🙏🙏

[@sunilkarki378]

Ramro. Nice explanation.

[@yashibhardwaj8292]

you explained very well sir great job :)

[@iamsmitthakkar]

Thanks buddy :) Keep doing it :) Good luck

[@christinajohn2457]

Thanks bro Easy hindhii.

[@ProudNepaliChannel]

why does mm have so many legs?

[@sanjaycharles]

you should see him at 8:08

[@ProudNepaliChannel]

@@sanjaycharles he was like, omg my m is one leg short!

[@hemantsah8567]

@@ProudNepaliChannel I thought its nm combined

[@sonalipatil1258]

Done.. thank u❤️

[@bhaskarrabha8922]

Bhai u have saved us...

[@akshatjain671]

well explained, thanks!

[@arjundixit5982]

Nice video...but so confusion between f and b...from starting😅😁😀

[@alliswell9436]

Sir g . Good tutorial. When I make CBS AND FP TREE IN FP TREE there are three items but there is no common so tell medo I just pick number 3 it's a middle value.

[@clincegm4674]

perfect ............got it......Thank u

[@youhavetodoit9070]

Thank You So Much

[@tazeenkhanam5]

Plz give a lecture on k-means,k-mediods and k-nearest neighbor algorithms with example

[@Aakash8739]

Very nicely explain well done

[@abhijeetvatsa201]

Hats off to sir

[@revanthjanaswamy5064]

What are the frequent item sets there ?

[@artcampus9806]

nicely explained..........................its really helpful.

[@harivamshididdiga1301]

Hi, great explanation. Can we join (b:1) of c,b,p directly to (p:3) instead of created a seperate node (p:1)??

[@siddheshbhande3122]

can you also show how to find association rules when FP tree is formed

[@narayana73babi]

very good

[@AbdulMuisAlAmin]

really clear, I am new with FP-Growth. could you please let me know what is the next step after generating FP Tree? I read several articles, they said that I should generate conditional FP-Tree and then frequent Itemset. I am not so clear with conditional FP-Tree and then frequent Itemset.

[@mujtababilal4333]

That's not how you write F I was confused all the time you mentioned F I saw b! 🤷🏻‍♂️ You should write what you say!

[@adamali89]

please add more lectures on data mining like neural network

[@jeremiahpothula3382]

superbbb❤️❤️❤️❤️

[@vinodkumarfbkp]

very nicely taught

[@vaishnaviboje]

Can we have make different fp growth tree from given data?

[@fionairis9314]

As u have 'h' in transaction_id 3.. why it's not mentioned in new item table?

[@barkhaarora1375]

Awesome explanation, just confused about second pattern. The second pattern must not include p, but you have included it.

[@avdeshpatel8631]

but sir your explanation is very nice

[@yatingaikwad4324]

Hi, Can you explain how FP stream works?

[@akankshasrivastav8150]

Thnkx

[@tapanmehta1793]

My question was when we have 4 frequent item sets and we are finding confidence , So while dividing (support/occurence of remaining 3) , Here do we have to check the occurrence of remaining 3 together or individually

[@santhoshkumar-il9qh]

Thanks bro Nice explanation

[@harshitKumar-in1mk]

bhai ek doubt hai f ka support 4 hai or c ka bhi support 4 hai agar c ko phele likha toh seq c,f,a,b,m,p hoga toh tree bhi toh alag banega toh Sol Galt toh nahi hooga

[@ramyamallavolu]

thanks alot bro!!!

[@mihirdesai2144]

Bro what is FP STREAM algorithm in topic mining... Where can I find it... It is used in one term paper of twitter topic Mining...

[@suneelvarma4821]

interviewer: What's your weakness? WA: "mn"

[@sanjithgeddam7850]

i like the way you write alphabet "m"

[@vaibhavgupta6428]

After reading out few of the below comments pointing out at "m", really made me feel sad. I am from India and studying here in USA under masters program. The thing I learned here, people appreciate you for things you do well and not put up criticism for such trivial subtle things. For such great efforts, it hurts when people from my nation find alien "m" and no appreciating words for the value achieved.

[@Jam05_]

Exactly bro even i'm irritated with such people mentality!

[@takbirhossaintushar7290]

please made a total data mining course with hindi lecture

[@bhanukirangunda5058]

u r explanation is very nice but we need the total video in english......

[@shaun4126]

I don't speak hindi and I understand this

[@KumarGaurav-gr6iw]

aillaa jaduuu

[@aakashyadav-ji9hi]

Nicely explaine so conclusion which is final item set : ( f,c,a,m) or (f,c,a} as both have min support =3 ?????

[@zirwawaqar5819]

please also find support, confidence, and lift or tell me to calculate them using original data or ordered item set.

[@--CSEMusfiraYaseen]

The support count for "o" is 2 in transaction 2 nd 3.

[@farzanaimtiyaz.2481]

Sir explain (decision tree each change node and decision )

[@gayatridevi2736]

o is repeated 2 time in transactiion 2 and 3 so why did you take o as 1 sir plzz explain

[@ashwaryasharma8288]

How to calculate support count in FP tree

[@kettec4372]

helpful....

[@thoufiqkhan4948]

Guys! We have a new superhero🥂

[@jaydeepsolanki3798]

ty sir

[@Uni_corn_blr]

You made it complicated..it's very simple to construct.

[@nba_nerd]

Trie data structure can be used for creating an fp tree

[@shlokabhalgat2093]

Please explain Mining frequent patterns from FP tree

[@nikhilbodduluri535]

U ar explanation is good but can u try it in english

[@umeshshrestha9650]

what if both support and confidence is given ? sir

[@WellAcademy]

+Umesh Shrestha Then you dont have to suppose you tke value of support and confidence from question

[@sangeethamurali1725]

We are getting the support value in order to generate the fp tree and find the itemset then only we have support

[@aksshhatam]

I think c will come before f in the priority pattern !

[@avdeshpatel8631]

sir i think you are not define the last step which calculated after defining the FP tree if its possible then try to upload all the steps sir

[@prathameshkhadse8329]

8:53 still looks like b. Haha.. Anyways, good tutorial.

[@pritipatel2445]

Sir iten no 3 me h item set he but aapne item me kyu nai liya he??

[@creativepredators7175]

How can u connect b with m while constructing the tree? It will be a cycle then it will not be a tree anymore

[@ashkanzahoor7242]

Sir O's support value is 2

[@MultiAkash1988]

while analysing a data how can we set minimum support and minimum confidence

[@WellAcademy]

akash singh It is given in the question or you have to assume

[@kbktechnical4794]

How to find minimum support in FP tree please tell me?

[@soumik3781]

There is a mistake in 10:34 In case of 2nd 'm' there will be separate node from 'b' but here you have joined it with the previous 'm' thats wrong!!

[@edatansubilgin123]

Thank you for your support, but could you please speak just in English during video, ı could'nt understood some parts in video. Thanks.

[@sangeethamurali1725]

We are assuming support= 3 or not

[@mohammedalazzani6700]

you should present ur lectures either in English or Hindi

[@rakeshxzy2875]

I understood how you create the FP tree, but didn't got the interpretation, which one is the frequent item set

[@yayathiexploration4894]

{f , c , a} is the frequent item set as that pattern only has support as 3 remaining all are splitted out and loosing min support count.

[@nandyhaaru9298]

Yayati Pavan Kumar Saragadam thanks

[@vasanthakumar2298]

while finding pattern why we consider f as first instead of c....here both values are 4