Scribd
Upload
6 views2 pages

AI Question Answers

The document provides definitions and explanations of key concepts in artificial intelligence and machine learning, including inference, Bayesian networks, and various types of learning. It details supervised learning, the decision tree algorithm, Bayes' theorem, and the differences between top-down and bottom-up parsing. Additionally, it covers inductive logic programming and instance-based learning with examples.

Uploaded by

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

AI Question Answers

The document provides definitions and explanations of key concepts in artificial intelligence and machine learning, including inference, Bayesian networks, and various types of learning. It details supervised learning, the decision tree algorithm, Bayes' theorem, and the differences between top-down and bottom-up parsing. Additionally, it covers inductive logic programming and instance-based learning with examples.

Uploaded by

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

Answers to the Questions

1(a) What is inference?


Inference is the process of drawing conclusions from available evidence or knowledge
using logical reasoning or statistical methods.

1(b) What are Bayesian networks? Give an example.


A Bayesian network is a probabilistic graphical model that represents a set of variables
and their conditional dependencies via a directed acyclic graph (DAG).
Example: Diagnosing diseases based on symptoms — a network where nodes represent
diseases and symptoms, and edges represent dependencies between them.

1(c) Define Artificial Intelligence.


Artificial Intelligence (AI) is the branch of computer science that aims to create
systems capable of performing tasks that require human intelligence, such as problem-
solving, learning, perception, and language understanding.

1(d) What is learning? What are its types?


Learning is the process by which a system improves its performance from experience.
Types of learning:
- Supervised Learning
- Unsupervised Learning
- Reinforcement Learning
- Semi-supervised Learning

1(e) Define generalization.


Generalization is the ability of a learning algorithm to perform well on unseen data or
examples that were not part of the training data.

1(f) What is Statistical Learning?


Statistical learning is a framework for understanding and modeling the relationship
between variables through statistical techniques, often used for prediction and
inference.

2(a) Explain Supervised Learning.


Supervised learning is a type of machine learning where the model is trained on
labeled data. The algorithm learns to map inputs to the correct output using a dataset
that contains input-output pairs.
Examples: Linear regression, Support Vector Machines (SVM), Decision Trees.

2(b) Write the decision tree learning algorithm.


Decision Tree Algorithm (ID3-like):
1. Start with the entire dataset.
2. Choose the attribute that best splits the data (using entropy/information gain).
3. Split the dataset based on the selected attribute.
4. Recursively repeat steps 2 and 3 on each subset.
5. Stop when:
- All samples in a subset belong to the same class.
- There are no remaining attributes.

3(a) Describe Bayes’ theorem.


Bayes’ Theorem is used to calculate the probability of a hypothesis given prior
knowledge.
Formula:
P(H|E) = [P(E|H) * P(H)] / P(E)
Where:
- P(H|E) = Posterior probability
- P(E|H) = Likelihood
- P(H) = Prior probability
- P(E) = Evidence

3(b) Differentiate – Top-down & Bottom-up parsing.


Feature | Top-Down Parsing | Bottom-Up Parsing
----------------------|------------------------------|------------
-------------------
Start | Begins from the start symbol | Begins from the input symbols
Direction | Left to right | Right to left (typically)
Usage | LL parsers | LR parsers
Recursion | Recursive descent | Shift-reduce parsing

4(a) Explain Inductive Logic Programming (ILP).


ILP is a subfield of machine learning that uses logic programming (like Prolog) to
represent data and hypotheses. It learns logical rules from examples and background
knowledge, allowing systems to generalize from specific instances.

4(b) Explain instance-based learning with an example.


Instance-based learning is a method where the model stores training instances and
uses them to predict new instances without explicitly learning a general model.
Example: k-Nearest Neighbors (k-NN) — classifies a new data point based on the
majority class among its nearest neighbors.

You might also like