decision tree (gini index) algoritmi nominal atributlar uchun

DOCX 3 sahifa 19,6 KB Bepul yuklash

3 sahifa

FaylHub.uz

Telegram orqali yuklab olish

Hajm 19,6 KB

Fayl turi DOCX

Sahifalar 3

Yangilangan Dek 2025

Sahifa ko'rinishi (3 sahifa)

Pastga aylantiring 👇

1 / 3

desicion tree (gini index) algoritmi nominal attribut uchun information before split (ibs) klasslar sonidan kelib chiqib hisoblanadi . misol uchun yes-9 , no-5 bo’ladigan bo’lsa unda ibs quyidagicha hisoblanadi : info([5, 9])= entropy(5/14, 9/14)= -5/14*log2(5/14)-9/14*log2(9/14)=0.940 misollarda ko’p uchraydigan logarifmik ifodalarni (entropy)ni wolfram alpha saytidan yechish mumkin. n% a-atribut b-atribut c-atribut d-atribut e-atribut class 1 17 5 a 9 a yes 2 3 26 b 30 a no 3 15 9 c 15 b yes 4 7 24 a 19 a yes 5 8 11 c 22 c yes 6 28 22 a 12 b no 7 10 10 a 11 a no 8 19 7 b 7 c yes 9 27 5 c 5 b no 10 12 19 b 10 c yes c-atribut ustuni bo’yicha gini index hisoblash jarayoni quyidagicha : c (ustun nomi) class (yes) class (no) p(yes) p(no) entropy probability a 2 2 2/4 2/4 1 4/10 …

2 / 3

t va a,blar esa class . l -> a k-> a m-> b m-> b l-> a k-> b k-> b m-> a l-> b k-> a m-> a k-> b m-> a k-> b l-> a 4. quyidagi data setdan foydalangan holda decision tree (gini index) algoritmi bo’yicha berilgan masalani barcha nominal atributlar ( outlook , temperature, humidity, windy) uchun yeching. n% outlook temperature humidity windy class 1 sunny hot high false no 2 sunny hot high true no 3 overcast hot high false yes 4 rainy mild high false yes 5 rainy cool normal false yes 6 rainy cool normal true no 7 overcast cool normal true yes 8 sunny mild high false no 9 sunny cool normal false yes 10 rainy mild normal false yes 11 sunny mild normal true yes 12 overcast mild high true yes 13 overcast hot normal false yes 14 rainy mild high …

3 / 3

decision tree (gini index) algoritmi nominal atributlar uchun - Page 3

Ko'proq o'qimoqchimisiz?

Barcha 3 sahifani Telegram orqali bepul yuklab oling.

To'liq faylni yuklab olish

"decision tree (gini index) algoritmi nominal atributlar uchun" haqida

desicion tree (gini index) algoritmi nominal attribut uchun information before split (ibs) klasslar sonidan kelib chiqib hisoblanadi . misol uchun yes-9 , no-5 bo’ladigan bo’lsa unda ibs quyidagicha hisoblanadi : info([5, 9])= entropy(5/14, 9/14)= -5/14*log2(5/14)-9/14*log2(9/14)=0.940 misollarda ko’p uchraydigan logarifmik ifodalarni (entropy)ni wolfram alpha saytidan yechish mumkin. n% a-atribut b-atribut c-atribut d-atribut e-atribut class 1 17 5 a 9 a yes 2 3 26 b 30 a no 3 15 9 c 15 b yes 4 7 24 a 19 a yes 5 8 11 c 22 c yes 6 28 22 a 12 b no 7 10 10 a 11 a no 8 19 7 b 7 c yes 9 27 5 c 5 b no 10 12 19 b …

Bu fayl DOCX formatida 3 sahifadan iborat (19,6 KB). "decision tree (gini index) algoritmi nominal atributlar uchun"ni yuklab olish uchun chap tomondagi Telegram tugmasini bosing.

Teglar: decision tree (gini index) algo… DOCX 3 sahifa Bepul yuklash Telegram