جواب «A Stump» چالش 6 از جلسهی 50
سؤال
دو تابع بنویس: stump(rows, labels) بهترین سؤال را با best_split پیدا کند و برای هر طرف برچسب اکثریت را با majority بگذارد و یک دیکشنری با کلیدهای feature، threshold، left و right برگرداند؛ predict(s, row) همان یک سؤال را بپرسد. خروجی: if homework < 2: yes, else: no، stump: 11 / 14، [29, 0, 0] -> yes، [25, 3, 0] -> no و [20, 1, 1] -> yes (کُنده باران را نمیبیند!).
راهنما
score, f, t = best_split(rows, labels) و بعد left, right = split(rows, labels, f, t).
یک جواب درست
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
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)
if best is None or score < best[0]:
best = (score, f, t)
return best
def majority(labels):
return max(sorted(set(labels)), key=labels.count)
def stump(rows, labels):
score, f, t = best_split(rows, labels)
left, right = split(rows, labels, f, t)
return {"feature": f, "threshold": t, "left": majority(left), "right": majority(right)}
def predict(s, row):
if row[s["feature"]] < s["threshold"]:
return s["left"]
return s["right"]
s = stump(rows, labels)
print(f"if {features[s['feature']]} < {s['threshold']}: {s['left']}, else: {s['right']}")
right = sum(1 for i in range(len(rows)) if predict(s, rows[i]) == labels[i])
print("stump:", right, "/", len(rows))
for day in [[29, 0, 0], [25, 3, 0], [20, 1, 1]]:
print(day, "->", predict(s, day))
اول خودت امتحان کن؛ جوابهای دیگر هم قبول است. برگرد و خودت حلش کن