来自加拿大代写的顾客授权发布的introduction to data mining，COMP3401作业要求片段，我们不会发布COMP3401的answer在网站，我们曾经写过COMP3401及相关的introduction to data mining写过很多作业，考试，如果你也需要代写这个课程的作业请联系客服WX:QQ 5757940 ，代写人的代写服务覆盖全球华人留学生，可以为CA的学生提供非常准时精湛的服务，小作业assignment代写、essay代写享适时优惠，project、paper代写、论文代写支持分期付款，网课、exam代考预约时刻爆单中赶紧来撩。
目标1。 决策树是一种数据结构，分类器在其上运行以进行预测。 每个内部节点都附有一个“测试属性”，分支是测试的结果。 叶节点附有类标签。 正在预测其类标签的对象从根开始，并在每个节点处由测试结果引导，沿着特定路径到达叶节点，并在叶节点处为其分配类标签。 这个项目的目标是......
Task:
Goal
1. A decision tree is a data structure on which the classifier runs to make a prediction. Each internal node is attached with a ‘testing attribute’ and the branches are the outcomes for the testing. The leaf nodes are attached with the class labels. The object whose class label is being predicted starts from the root, and is guided at each node by the testing outcome to follow a specific path to a leaf node, where it is assigned the class label. The goal of this project is to implement a decision tree based on following application: customers are assessed for their RISK level, high or low, depending on the five attributes: age, credit_history, income, race, health. The subsequent section contains some details that you will need to know in completing your project.
2. How to represent a decision tree
A crucial step for building a decision tree is to select the testing attribute at each node. This has been discussed in detail in the class. An issue that has not been discussed in the class, however, is exactly how to use a data structure to represent a decision tree in a programming environment. This concerns with the implementation, and depends on the language you will use. In the general case, you need to represent the following information for each node: testing attribute, the values in the domain of the testing attribute, and for each branch the identity of the child that it leads to. In Python, you can use sequence type for this purpose. For each internal node, the list of the form below may be used:
[A, {v1: B1, …, vp: Bp}] where A is the testing attribute at the node. The key-value pairs in the dictionary represent branches where vi is a value in Domain(A) and Bi is a reference to a child. For a leaf node, simply use [L] to represent it where L is the class label attached to the node. For example, consider the following decision tree:
The above decision tree contains a total of eight nodes. They are represented as follows:
A: [‘age’, {‘young’: B1, ‘adult’: B2, ‘senior’: B3}]
B1: [‘salary’, {‘high’: C1, ‘low’: C2}]
B2: [‘YES’]
B3: [‘occupation’, {‘worker’: C3, ‘politician’: C4}]
C1: [‘YES’]
C2: [‘NO’]
C3: [‘NO’]
C4: [‘YES’]
In almost all the cases, the root is used to identify the entire decision tree. The above representation is easy to work with. For example, suppose each person is represented by a dictionary of the form {‘age’: v1, ‘salary’: v2, ‘occupation’: v3}. To predict the class label for an individual p, we can simply use the following loop: node A while node is a list v p[node[0]] node node[1][v] return node[0] It’s equally easy to predict the class labels for a group of instances, such as those represented in a matrix. (Detail omitted.)
3. Encoding the values for nominal attributes In many cases, you need to test the accuracy of the decision tree on a testing set. The testing set is usually represented as a mxn matrix where the rows are attributes and the columns are objects. In numpy, the most commonly used input function that operates on matrix is loadtxt(*). But this function requires the matrix to have numerical values while in most cases the values for a nominal age attribute are symbols.
If you are a student from an English-speaking country, please feel free to contact us at [email protected] and we will provide you with an excellent writing service.
为什么选择代写人 代写
作为现存十年的代写服务机构，我们没有任何学术丑闻，我们保护顾客隐私、多元化辅导、写作、越来越多的小伙伴选择代写人为他们解决棘手的各类作业难题，保障GPA，为留学梦助力！ 我们的客服团队及写手老师总是能第一时间响应顾客的各类作业需求，有些人即使有重要的事甚至带伤上场协助考试。Final季，忙的时候一天十几场考试还在继续坚持着，我知道，他们明明可以不用这么辛苦的…但是他们为了坚守承诺，为了另一端屏幕外的那一份期望，他们没有选择退缩、时刻为同学们提供最好的！这么有温度的代写还不添加备用一下？WX/QQ： 5757940
