Scribd
Upload
25 views

AIML 2m

Bidirectional search is an algorithm that searches a problem space from two starting points and combines the results to find a solution. Uninformed search strategies do not use knowledge to guide search and include breadth-first, depth-first, and iterative deepening searches. Defining a problem requires specifying the initial state, goal state, legal moves, and cost of each move.

Uploaded by

sonasinghmaurya0527
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
25 views

AIML 2m

Bidirectional search is an algorithm that searches a problem space from two starting points and combines the results to find a solution. Uninformed search strategies do not use knowledge to guide search and include breadth-first, depth-first, and iterative deepening searches. Defining a problem requires specifying the initial state, goal state, legal moves, and cost of each move.

Uploaded by

sonasinghmaurya0527
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/ 2

1. Define bidirectional search.

Bidirectional search is a search algorithm that


searches a problem space from two different starting points and then
combines the results of the two searches to find a solution.
2. Define uninformed search strategies& list of them. Uninformed search
strategies are search algorithms that do not use any knowledge about the
problem space to guide their search. Some examples of uninformed search
strategies include breadth-first search, depth-first search, and iterative
deepening search.
3. What are the four components of define problem? The four components of
defining a problem are:
o The initial state
o The goal state
o The legal moves
o The cost of each move
4. Define uncertainty. Uncertainty is the state of not knowing something with
certainty. In machine learning, uncertainty can be caused by noise in the data,
incomplete data, or the inherent randomness of the problem being modeled.
5. What do you mean by hybrid Bayesian network? A hybrid Bayesian network is
a Bayesian network that combines two or more different types of nodes, such
as continuous nodes and discrete nodes.
6. Define prior probability. Prior probability is the probability of an event
occurring before any evidence is observed.
7. State types of approximation methods. There are two main types of
approximation methods:
o Heuristic methods
o Metaheuristic methods
8. What is the goal of logistic regression? The goal of logistic regression is to
predict the probability of an event occurring, given a set of features.
9. Define Machine Learning. Machine learning is a field of computer science that
gives computers the ability to learn without being explicitly programmed.
10. Describe issue in machine learning. Some of the issues in machine learning
include:
o Overfitting
o Underfitting
o Bias-variance trade-off
o Data scarcity
o Data noise
11. What do you mean by least square method? The least squares method is a
method for finding the best fit line or curve to a set of data points.
12. What is bagging? Bagging, also known as bootstrap aggregating, is an
ensemble learning method that creates multiple models from bootstrapped
samples of the training data. The predictions from these models are then
averaged to produce a final prediction.
13. List the properties of K-means algorithm. The K-means algorithm is a
clustering algorithm that groups data points into K clusters, where K is a user-
specified number. The algorithm works by iteratively assigning data points to
the cluster with the closest mean, until the clusters no longer change.
14. What is Stacking? Stacking is an ensemble learning method that combines
the predictions of multiple models to produce a final prediction. The
predictions from the individual models are first ranked, and then the top-
ranked models are used to create a final prediction.
15. What are the advantages of deep learning? Some of the advantages of deep
learning include:
o The ability to learn complex patterns from data
o The ability to generalize to new data
o The ability to learn from noisy data
16. Explain back propagation Backpropagation is a method for training neural
networks. It works by iteratively adjusting the weights of the neural network to
minimize the error between the network's predictions and the desired outputs.
17. Explain Multilayer perceptron. A multilayer perceptron is a type of neural
network that has multiple layers of neurons. The neurons in each layer are
connected to the neurons in the next layer, and the weights of these
connections are adjusted during training.
18. Define Normalization. Normalization is a technique for scaling data so that it
has a mean of 0 and a standard deviation of 1. This can be helpful for
improving the performance of machine learning algorithms.

You might also like