جواب «The Best Question» چالش 5 از جلسهی 50
سؤال
تابع best_split(rows, labels) را بنویس: برای هر ویژگی f و هر آستانهی t (مقدارهای متفاوت آن ستون به ترتیب، به جز کوچکترین) سؤال را با weighted_gini امتیاز بده، بشمار و کمترین امتیاز را به شکل (score, f, t) نگه دار (در تساوی، اولی). خروجی: questions tried: 18 و best: homework < 2 gini 0.333.
راهنما
دو حلقهی تودرتو: for f in range(len(rows[0])): و for t in sorted(set(row[f] for row in rows))[1:]:.
یک جواب درست
DATA = '''
temp,homework,rain,play
24,1,0,yes
30,0,0,yes
18,3,0,no
22,2,1,no
27,1,0,yes
15,0,0,yes
20,4,0,no
33,1,1,no
26,0,0,yes
19,2,0,no
28,3,0,no
23,0,1,no
21,1,0,yes
31,2,0,yes
'''.strip()
lines = DATA.splitlines()
features = lines[0].split(",")[:-1]
rows = []
labels = []
for line in lines[1:]:
parts = line.split(",")
rows.append([int(v) for v in parts[:-1]])
labels.append(parts[-1])
def gini(group):
if len(group) == 0:
return 0.0
score = 1.0
for c in sorted(set(group)):
p = group.count(c) / len(group)
score -= p * p
return score
def split(rows, labels, f, t):
left = [labels[i] for i in range(len(rows)) if rows[i][f] < t]
right = [labels[i] for i in range(len(rows)) if rows[i][f] >= t]
return left, right
def weighted_gini(left, right):
n = len(left) + len(right)
return len(left) / n * gini(left) + len(right) / n * gini(right)
def best_split(rows, labels):
best = None
tried = 0
for f in range(len(rows[0])):
for t in sorted(set(row[f] for row in rows))[1:]:
left, right = split(rows, labels, f, t)
score = weighted_gini(left, right)
tried += 1
if best is None or score < best[0]:
best = (score, f, t)
print("questions tried:", tried)
return best
score, f, t = best_split(rows, labels)
print("best:", features[f], "<", t, "gini", round(score, 3))
اول خودت امتحان کن؛ جوابهای دیگر هم قبول است. برگرد و خودت حلش کن