The document provides a list of 11 questions related to various machine learning and artificial intelligence concepts for a tutorial. The questions cover topics such as decision tree construction, naive Bayes and Gibbs algorithms, perceptrons, radial basis functional neural networks, self-organizing feature maps, proximity measures, cluster evaluation methods, single linkage clustering, k-means algorithm, and applications/advantages/disadvantages of artificial neural networks. The questions also include examples to demonstrate algorithms and concepts.
The document provides a list of 11 questions related to various machine learning and artificial intelligence concepts for a tutorial. The questions cover topics such as decision tree construction, naive Bayes and Gibbs algorithms, perceptrons, radial basis functional neural networks, self-organizing feature maps, proximity measures, cluster evaluation methods, single linkage clustering, k-means algorithm, and applications/advantages/disadvantages of artificial neural networks. The questions also include examples to demonstrate algorithms and concepts.
The document provides a list of 11 questions related to various machine learning and artificial intelligence concepts for a tutorial. The questions cover topics such as decision tree construction, naive Bayes and Gibbs algorithms, perceptrons, radial basis functional neural networks, self-organizing feature maps, proximity measures, cluster evaluation methods, single linkage clustering, k-means algorithm, and applications/advantages/disadvantages of artificial neural networks. The questions also include examples to demonstrate algorithms and concepts.
Subject Name & Code: Artificial Intelligence & Machine Learning, [21CS54] Semester: 5th Section: A, B, C
TUTORIAL III
1. Explain the structure with procedure to construct decision tree.
2. Asses the student’s performance during his course of study and predict whether the student will get a job offer or not in his final year of the course. The training dataset T consists of 10 data instances with attributes such as ‘CGPA’, ‘Instructiveness’, ‘Practical knowledge’, ‘Communication Skills’ as shown in below table. CGPA Instructiveness Practical Knowledge Communication Skills Job Offer >=9 yes Very good good yes >=8 no good moderate yes >=9 no average poor no <8 no average good no >=8 yes good moderate yes >=9 yes good moderate yes <8 yes good poor no >=9 no Very good good yes >=8 yes good good yes >=8 yes average good yes
3. State Naïve Bayes algorithm and Gibbs algorithm.
4. Explain Perceptron and learning theory with an algorithm. 5. Consider a perceptron to represent the Boolean function AND with the initial weights w 1=0.3, w2=-0.2, learning rate α=0.2 and bias θ=0.4. Design a perceptron that performs the Boolean function AND and update the weights until the Boolean function gives the desired output. 6. Illustrate with an steps how radial basis functional neural networks works. 7. Consider the example which considers four training samples each vector of length 4 and 2 output units. Train the SOFM network by determining the class memberships of input data. Training samples: X1:(1,0,1,0) X2: (1,0,0,0) X3: (1,1,1,1) X4: (0,1,1,0) Output units: unit 1, unit 2 Learning rate n(t)=0.6, Initial weight matrix {{0.3,0.5,0.7,0.2},{0.6,0.5,0.4,0.2}} 8. Explain Proximity measures. 9. What are cluster evaluation methods? 10. Consider the array of points as shown in below table. Apply single linkage algorithm. objects x y 0 1 4 1 2 5 2 5 10 3 12 18 4 14 28
11. Explain k-means algorithm in detail.
12. State the applications of ANN. List the advantages and disadvantages of ANN.