Scribd
Upload
32 views

AI & ML Question Bank

The document discusses different classification algorithms like decision trees, Naive Bayes and neural networks. It includes definitions of key terms, algorithms and examples of applying different algorithms to sample datasets to classify outcomes.

Uploaded by

robinscherbatsky230780
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views

AI & ML Question Bank

The document discusses different classification algorithms like decision trees, Naive Bayes and neural networks. It includes definitions of key terms, algorithms and examples of applying different algorithms to sample datasets to classify outcomes.

Uploaded by

robinscherbatsky230780
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1.

Define the following : Entropy ,Decision tree, Restriction Bias, Preference


Bias, Information Gain, GINI Index, Gain Ratio
2. Write the ID3 algorithm to construct the decision tree.
3. Construct the decision tree for the following
Day Outlook Temp Humidity Wind Decision
1 Sunny Hot High Weak Yes
2 Sunny Hot High Strong No
3 Overcast Hot High Weak Yes
4 Rain Mild High Weak No
5 Rain Cool Normal Weak Yes

4. Consider the training dataset shown in the table below. Discretize the data and
apply c4.5 algorithm

5. Construct the decision tree for the following data using CART algorithm

6.Explain the c4.5 algorithm with an example.


7. Explain the steps involved in CART algorithm with example
8. Compare the ID3 and c4.5 algorithm
9.Explain the terms prior probability,likelihood probability and posterior probability
10. Define Maximum A Posteriori (MAP) Hypothesis, hMAP and Maximum
Likelihood (ML) Hypothesis, hML. 10. Check the correctness
11.. Take a real-time example of predicting the result of a student using Naïve Bayes
algorithm. The training dataset T consists of 8 data instances with attributes such as
‘Assessment’, ‘Assignment’, ‘Project’ and ‘Seminar’ as shown in Table 8.17. The
target variable is Result which is classified as Pass or Fail for a candidate student.
Given a test data to be (Assessment = Average, Assignment = Yes, Project = No and
Seminar = Good), predict the result of the student. Apply Laplace Correction if Zero
probability occurs

12.Explain the concept of Bayes optimal classifier with an example.


13.Consider an example of predicting a student’s result using Gaussian Naïve Bayes
algorithm for continuous attributes. The training dataset T consists of 10 data
instances with attributes such as ‘Assessment Marks ‘, ‘Assignment Marks’ and
‘Seminar Done’ as shown in Table 8.18. The target variable is Result which is
classified as Pass or Fail for a candidate student.
Given a test data to be (Assessment Marks = 75, Assignment Marks = 6, Seminar
Done = Poor), predict the result of the student.

14. Explain the different popular variants of Bayesian classifier


15. Explain steps of Locally Weighted Linear regression.
16. Describe Radial basis function with appropriate diagram.
17 Explain Naïve Bayes classifiers and Bayesian belief Networks.
18. A patient takes a lab test and the result comes back positive. The test returns a
correct positive result in only 98% of the cases in which the disease is actually present
and a correct negative result in only 97% of the cases in which the disease is not
present. Further ,0.008 of the entire population have the Cancer. Does a patient have
Cancer or not?
19. Derive Brute force MAP learning and also mention assumptions made in this
process.
20. Give decision tree to represent the following Boolean functions:

21. Explain Perceptron with appropriate diagram Represent AND Boolean function
using Perceptron.
22. Write Back propagation algorithmWrite a note on the biological neuron
16. Write a note on artificial neurons.
17.Explain the different types of activation functions
18.Explain the 4 steps involved in perceptron model.
19. Discuss about some of the types of artificial neural networks.
20.Design a two-layer network of perceptron to implement NAND gates. Assume
your own weights and biases in the range of [-0.5, 0.5]. Use learning rate ∝ = 0.4.
21.Explain the advantages and disadvantages of artificial neural network.Also explain
the applications of artificial neural networks
22. Consider the Network architecture with 4 input units and 2 output units. Consider
four training samples each vector of length 4.
Training samples
i1: (1, 1, 1, 0)
i2: (0, 0, 1, 1)
i3: (1, 0, 0, 1)
i4: (0, 0, 1, 0)
Output Units: Unit 1, Unit 2
Learning rate h(t) = 0.6
Initial Weight matrix
Identify an algorithm to learn without supervision? How do you cluster them as
expected?
22. List all the applications of clustering algorithm.List the advantages and
disadvantages of clustering algorithm
23.Find cosine similarity ,SMC, and Jaccard Coefficients for the following binary data
(i) (1 0 1 1) and ( 1 1 0 0) (ii) ( 1 0 0 0 1) and ( 1 0 0 0 0 1) and ( 1 1 0 0 0)
24. Find the hamming distance for the following binary data ; (i) ( 1 1 1) and ( 1 0 0)
(ii) ( 1 1 1 0 0) and ( 0 0 1 1 1)
25. Find the distance between : (a) ( Yellow,red,green) and ( red,green,yellow)
26. Use the below table dataset and apply hierarchical methods with seed points ( 7,8)
and (16,9) . Show the dendogram.

S.No X Y
.
1 3 5
2 7 8
3 12 5
4 16 9
5 20 8

27. Explain in detail the CLIQUE algorithm.


28. WHat is Fuzzy logic ? How does FCM help in cluster formation?
29. Explain in detail EM algorithm.
30. Explain the working of DBSCAN algorithm.

You might also like