Questionneural and tree learning on continuous attributesa

Assignment Help Data Structure & Algorithms

Reference no: EM13380330

Question

Neural and Tree Learning on Continuous Attributes

(a) In general, feedforward neural networks (multi-layer perceptrons) trained by error back-propagation are:

(i) fast to train, and fast to run on unseen examples

(ii) slow to train, and fast to run on unseen examples

(iii) fast to train, and slow to run on unseen examples

(iv) slow to train, and slow to run on unseen examples

In one sentence, explain your choice of answer.

Suppose you have a decision tree (DT) and a multi-layer perceptron (MLP) that have been trained on data sampled from a two-class target function, with all attributes numeric. You can think of both models as graphs whose edges are labelled with numbers: weights in the MLP and threshold constants for attribute tests in the DT.

(b) Compare and contrast the roles of these numbers in the two models.

Reference no: EM13380330

Questions Cloud

Inadynamicbusinessmodelwealsorepresentthelife-cyclerelations : inadynamicbusinessmodelwealsorepresentthelife-cyclerelationshipsamongtheseentitiesshowingwhichentityisresponsibleforwhic

The dynamic businessmodel you are supposed to include in : the dynamic businessmodel you are supposed to include in your assignment represents the

Quality building supply qbs has proposed a project to : quality building supply qbs has proposed a project to develop a business system.the project team has gathered the

Write a research paper excluding the title page on logical : write a research paper excluding the title page on logical circular and arithmetic shift operations. use an example not

Questionneural and tree learning on continuous attributesa : questionneural and tree learning on continuous attributesa in general feedforward neural networks multi-layer

Questionlearning for numeric predictiona let the weights of : questionlearning for numeric predictiona let the weights of a two-input perceptron be w0 02 w1 05 and w2 05.

Decision tree learninga describe the main steps in the : decision tree learninga describe the main steps in the basic decision tree learning algorithm. the table below contains

Concept learninga write an algorithm called find-g to nd a : concept learninga write an algorithm called find-g to nd a maximally-general consistent hypothesis. you can assume the

Well-posed machine learning problemsa what is required to : well-posed machine learning problemsa what is required to dene a well-posed learning problem ?b here are two potential

User Account

All Pages