Year: 2018
Type: article
Abstract: This paper details the ID3 classification algorithm.Very simply, ID3 builds a decision tree from a fixed set of examples.The resulting tree is used to future samples.The decision node is an attribute test with each branch (to another decision tree) being a possible value of the attribute.ID3 uses information gain to help it decide which attribute goes into a decision node.The main aim of thi identify relevant attributes based on quantitative and qualitative aspects of a student's profile such as CGPA, academic performance, technical and communication skills and design a model which can predict the placement of a student.For this ID3 classification technique based on decision tree has been used.I. D= {t1,t2,…………………………..,tn} C= {C1,C2,………………………...,Cm} where data is defined by D having set of tuples that is assigned to class C.e.g.Pattern recognition, an input pattern is classified into one of several classes based on similarity.A bank officer who has the authority to approve the loan of any person then he has to analyze customer behavior to decide passing the loan is risky or safe that is called classification.
DOI: 10.31142/ijtsrd11073
Authors: Kirandeep Kirandeep, Prof. Neena Madan, G.N.D.U, Regional Campus, Jalandhar, Punjab, India
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2795372570
