بتل کد Battle Codeدارد باز می‌شود…

جواب «Walk Down the Tree» چالش 2 از جلسه‌ی 51

سؤال

تابع predict همیشه به راست می‌رود و برای همین همه‌چیز yes می‌شود. داخل حلقه را درست کن: اگر ویژگیِ گره در ردیف کمتر از آستانه بود به left برو، وگرنه به right. خروجی: [29, 0, 0] -> yes، [25, 3, 0] -> no، [20, 1, 1] -> no و [32, 2, 0] -> yes.

راهنما

if row[node["feature"]] < node["threshold"]: و بعد node = node["left"].

یک جواب درست

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 build(rows, labels, depth, max_depth, min_samples):
    if depth == max_depth or len(rows) < min_samples or gini(labels) == 0:
        return {"leaf": majority(labels)}
    best = best_split(rows, labels)
    if best is None:
        return {"leaf": majority(labels)}
    score, f, t = best
    left_rows, left_labels, right_rows, right_labels = [], [], [], []
    for i in range(len(rows)):
        if rows[i][f] < t:
            left_rows.append(rows[i])
            left_labels.append(labels[i])
        else:
            right_rows.append(rows[i])
            right_labels.append(labels[i])
    left = build(left_rows, left_labels, depth + 1, max_depth, min_samples)
    right = build(right_rows, right_labels, depth + 1, max_depth, min_samples)
    if "leaf" in left and "leaf" in right and left["leaf"] == right["leaf"]:
        return left    # both sides say the same thing: the question is useless
    return {"feature": f, "threshold": t, "left": left, "right": right}



def predict(node, row):
    while "leaf" not in node:
        if row[node["feature"]] < node["threshold"]:
            node = node["left"]
        else:
            node = node["right"]
    return node["leaf"]



tree = build(rows, labels, 0, 2, 2)
for day in [[29, 0, 0], [25, 3, 0], [20, 1, 1], [32, 2, 0]]:
    print(day, "->", predict(tree, day))

اول خودت امتحان کن؛ جواب‌های دیگر هم قبول است. برگرد و خودت حلش کن