L34: Agglomerative Clustering Algorithm | Plot Dendrogram Solved Numerical Question | Data Mining
HTML-код
- Опубликовано: 11 сен 2024
- Full Course of Data warehouse and Data Mining(DWDM): • Datawarehouse and Data...
In this lecture you can learn about Agglomerative Clustering Algorithm - Plot Dendrogram Solved Numerical Question in Data warehouse and Data Mining(DWDM) Course. Following topics of Data warehouse and Data Mining(DWDM) Course are discussed in this lecture: Agglomerative Clustering Algorithm with Solved Numerical Example on How to Plot Dendrogram using Single Link Approach. This topic is very important for College University Semester Exams and Other Competitive exams like GATE, NTA NET, NIELIT, DSSSB tgt/ pgt computer science, KVS CSE, PSUs etc.
Agglomerative Clustering Algorithm - Plot Dendrogram Solved Numerical Question 1(Hindi)
Data Warehouse and Data Mining Lectures Series in Hindi
👉 Follow us on Social media:
Facebook: tiny.cc/ibdrsz
▶️ Links for Hindi playlists of all subjects are:
Data Structure: tiny.cc/lkppsz
DBMS : tiny.cc/zkppsz
Java: tiny.cc/1lppsz
Control System: tiny.cc/3qppsz
Computer Network Security: tiny.cc/6qppsz
Web Engineering: tiny.cc/7qppsz
Operating System: tiny.cc/dqppsz
EDC: tiny.cc/cqppsz
TOC: tiny.cc/qqppsz
Software Engineering: tiny.cc/5rppsz
DCN: tiny.cc/8rppsz
Data Warehouse and Data Mining: tiny.cc/yrppsz
Compiler Design: tiny.cc/1sppsz
Information Theory and Coding: tiny.cc/2sppsz
Computer Organization and Architecture(COA): tiny.cc/4sppsz
Discrete Mathematics (Graph Theory): tiny.cc/5sppsz
Discrete Mathematics Lectures: tiny.cc/gsppsz
C Programming: tiny.cc/esppsz
C++ Programming: tiny.cc/9sppsz
Algorithm Design and Analysis(ADA): tiny.cc/fsppsz
E-Commerce and M-Commerce(ECMC): tiny.cc/jsppsz
Adhoc Sensor Network(ASN): tiny.cc/nsppsz
Cloud Computing: tiny.cc/osppsz
STLD (Digital Electronics): tiny.cc/ysppsz
Artificial Intelligence: tiny.cc/usppsz
Links for #GATE/#UGCNET/ PGT/ TGT CS Previous Year Solved Questions:
UGC NET : tiny.cc/brppsz
DBMS GATE PYQ : tiny.cc/drppsz
TOC GATE PYQ: tiny.cc/frppsz
ADA GATE PYQ: tiny.cc/grppsz
OS GATE PYQ: tiny.cc/irppsz
DS GATE PYQ: tiny.cc/jrppsz
Network GATE PYQ: tiny.cc/mrppsz
CD GATE PYQ: tiny.cc/orppsz
Digital Logic GATE PYQ: tiny.cc/rrppsz
C/C++ GATE PYQ: tiny.cc/srppsz
COA GATE PYQ: tiny.cc/xrppsz
DBMS for GATE UGC NET : tiny.cc/0tppsz
Last value of d will be 3
yes
@@abdulsohail9913 yes bhai
Ya
yup and graph will move up by 1
han bhai sahi bol rahe ho
Last value of d must be 3
in last table the value of D should come as 3 not 2
Last one for D the value will be 3.
So the Dendogram will also be changed according to that.
Ha bhai
exactly bro
yes i am also getting the same final value is 3
Exactly
Last value of d is 3 not 2
Yeahh it's 3 !!
Sir the flow should be from bottom to top right, as it is an aglomerative clustering??
Nice explanation, I had my doubts cleared .
Yeah.!! Last value for (d),(EA-BC)=3. And so the graph will be at point Y=3 for D and EACB
Thanks for clean and concise explaination
In the first step instead of finding the distance between E, C you computed for E, A.
take any because distance is same.
@@adilumr6359 how? For EA it's 1 and for EC it's 2
@@aashushaikh5843 bro he edited the part and after he take e,c
@@rohanwarghade7111 it's been a year bro
I don't even remember what this doubt was about😂
Very good skillfully presented this topic ...
Sir EACB's distance from D is 3 for every pair wight?
sir ji Last waale main (E,A), (B,C) -> D ki value 3 hongi
very well explained sir, thanks for making this concept so easy. 1 day before exam = Easy engineering classes
Grateful😇
Thanks a lot sir
In last step are mistake
Sir last row value of 'D' is wrong the right value is 3 but u take 2..?
1 ki pairing sabse phle isliye hui h kyoki sbse small element hi 1 se
thankyou sir
sir last meh value 3 hai kya kar rhae ho sir such a silly mistake
also in first pairing, the distance (E,A)->C = min((E,C),(A,C)) which should be 2
Exactly
Sir jaise ki aapne kaha (e,a) ki pair 1 pe hua similarly (b,c) toh 2 pe pair hua hai
Toh aap 1 kaise bol rhe hai?
there is a mistake found @6:18 for ((E,A),(B,C)) , (D)=3 and so the dendogram graph will be at point Y=3 for D and EACB
Last Value of D will be 3 not 2.
Gtu syllabus according exam paper solve karvaea sir
Last value 3 ati hai
Min Ka pura neat solve karke dikhao na
d value should be 3 not 2 last wala
ye jo data dia jaega us mai kia hamesha diagonal pe value 0 hi hogi???
G awais bhai diagonal me zero hogi
@@farhankhanawan and we can ignore the values above the diogonal?
Ye side me techmax kholke video banaoge toh aisehi galat video banega......uparse jo bachhe end moment pe padhenge unke toh lagahi doge ap.....
value thik krke dobara video bnao sir smjh ni ayi
Sir I also know mistake before you
Kyaa ye herarchical algo he tell me plzz ??
han. hierarchical me agglomerative hai
Ye iski type he ??
@@hanicreation988 Yes
sir there is fault in your every vedio
Aap etna glat kyu karta ha D ke row me not value 2 only 3 aaya ge
Why r u repeating mistakes in every videos???
To ensure we are attentive
ghatiya video
bhai 3 log ko lafde hogaye tere 2 ke chakar mai
Bhai galti kardiya re starting me hi
Khud padhle pehle fir dusro ko samjhana
couldn't you explain in English😠 so everyone understand .
no, learn hindi
U should learn our language to learn great things 😂😂
Ye sab sirf paiso ke liye padate hai asli padene wale esa nhi krte 😂 sake book se padare hai sir ham engineer hai sab samjhna padta hai 😭😭
It's "DENDROGRAM" not DENDOGRAM
last value of D is 3