Solution-Maximal depth of decision tree derived

Maximal depth of decision tree derived

Assignment Help C/C++ Programming

Reference no: EM131100313

Given a training set of 50 million tuples with 25 attributes each taking 4 bytes space. One attribute is a class label with two distinct values, whereas for other attributes each has 30 distinct values. You have only a 512 MB main memory laptop. Outline an efficient method that constructs decision trees efficiently, and answer the following questions explicitly:

(1) How many scans of the database does your algorithm take if the maximal depth of decision tree derived is 5?

(2) What is the maximum memory space your algorithm will use in your tree induction?

Reference no: EM131100313

Questions Cloud

Communication protocols and devices : Can you help me prepare a presentation that examines and depicts a cluster connected over a LAN and provide the communication protocols and devices at each level of the OSI model are discussed and depicted in a diagram in the presentation.

The same pure bip problem to fix : Use the following set of constraints for the same pure BIP problem to fix as many variables as possible. Also identify the constraints which become redundant because of the fixed variables.

Support and troubleshooting checklist : Develop a support and troubleshooting checklist based on the five operating systems issues. Include:

The tightest possible nonlinear programming : (a) Use the following outline in designing the main features of a branch-and-bound algorithm for solving this problem (and similar problems) directly without reformulation.

Maximal depth of decision tree derived : (1) How many scans of the database does your algorithm take if the maximal depth of decision tree derived is 5? (2) What is the maximum memory space your algorithm will use in your tree induction?

Formulate an ip model for this problem : A machine shop makes two products. Each unit of the first product requires 3 hours on machine 1 and 2 hours on machine 2. Each unit of the second product requires 2 hours on machine 1 and 3 hours on machine 2. Machine 1 is available only 8 hours p..

Find the percentage error over the band : find the percentage error over the band in making this approximation.

Write paper on should america go to second world war or not : Write a paper about should america go to Second World War or not. Have a clear thesis statement You are making an argument Plan your essay Integrate your quotes six pages double space, with Chicago Style.

Name of the employee with a given ssn : We are about to run a query on this Emp table to find the name of the employee with a given ssn, say 1000; i.e., in SQL, "select name from Emp where ssn=1000". In a worst-case scenario, how long this operation will take? Express your answer in bot..

User Account

All Pages

Maximal depth of decision tree derived

Reference no: EM131100313

Reference no: EM131100313

Questions Cloud

Reviews

Write a Review

C/C++ Programming Questions & Answers

Create program that uses functions and reference parameters

Write a program using vectors and iterators

Write the code required to analyse and display the data

Write a webservices application

Iimplement a client-server of the game

Model-view-controller

Design a nested program

Convert celsius temperatures to fahrenheit temperatures

Evaluate and output the value in the given base

Design a base class shape with virtual functions

Implementation of classes

Technical paper: memory management

Assured A++ Grade

Academics

Major Subjects

Majors

Get In Touch

TERMS & POLICIES

HELP & SUPPORT