Recent activity in Artificial Intelligence

1.2k
views
1 answers
0 votes
Let $h_{1}$ and $h_{2}$ be two admissible heuristics used in $A^{*}$ search.Which ONE of the following expressions is always an admissible heuristic?$h_{1}+h_{2}$h_{1} ... 1} / h_{2},\left(h_{2} \neq 0\right)$\left|h_{1}-h_{2}\right|$
3.3k
views
1 answers
2 votes
Consider the game tree given below:Here $\bigcirc$ and $\Box$ represents MIN and MAX nodes respectively. The value of the root node of the game tree is$4$7$11$12$
255
views
0 answers
0 votes
Consider two admissible heuristic functions, \(h_1\) and \(h_2\). Determine which of the following combinations are admissible:\(\frac{h_1}{h_2}\) \(\left(h_2 > 0\right)\) \\\(h_1 ... {h}_2\) \\\(\left| h_1 - h_2 \right|\) \\\(h_1 + h_2\)
205
views
0 answers
0 votes
You are provided with three images, each depicting a different face of a six-sided dice. Based on these images, determine the correct option.
13.3k
views
2 answers
0 votes
Back propagation is a learning technique that adjusts weights in the neutral network by propagating weight changes.Forward from source to sinkBackward from sink to sourceForward from source to hidden nodesBackward from sink to hidden nodes
361
views
2 answers
0 votes
Suppose you have picked the parameter \( \theta \) for a model using 10-fold cross-validation. The best way to pick a final model to use and estimate its error ... the \( \theta \) you found; use the average CV error as its error estimate
1.9k
views
1 answers
0 votes
HiI need some useful resources of AI for upcoming UGC NET exam.Currently, I am reading from Rich and Knight, Is it enough?Please let me know about any good quality books or video lectures.
6.7k
views
2 answers
1 votes
Consider the following:EvolutionSelectionReproductionMutationWhich of the following are found in genetic algorithms?b, c and d onlyb and d onlya, b, c and da, b and d only
729
views
2 answers
2 votes
What is the State $\mathrm{X}$ called for the following machine learning model?
4.5k
views
3 answers
3 votes
Which of the following is an unsupervised neural network?RBSHopfieldBack propagationKohonen
592
views
1 answers
0 votes
Suppose you have a three-class problem where class label \( y \in \{0, 1, 2\} \), and each training example \( \mathbf{X} \) has 3 binary attributes \( X_1, ... an example using the Naive Bayes classifier?(a) 5b) 9(c) 11(d) 13(e) 23
366
views
1 answers
0 votes
In fitting some data using radial basis functions with kernel width $σ$, we compute training error of $345$ and a testing error of $390$.(a) increasing ... error(C) not enough information is provided to determine how $σ$ should be changed
366
views
1 answers
0 votes
After applying a regularization penalty in linear regression, you find that some of the coefficients of $w$ are zeroed out. Which of the following penalties might have been used?(a) ... (c) L2 norm(d) either (A) or (B)(e) any of the above
381
views
1 answers
0 votes
Given the following table of observations, calculate the information gain $IG(Y |X)$ that would result from learning the value of $X$. XYRedTrueGreenFalseBrownFalseBrownFalse (a) 1/2(b) 1(c) 3/2(d) 2(e) none of the above
439
views
1 answers
0 votes
Given a tree with a branching factor of 3 and a depth of 4, calculate the maximum number of nodes expanded during a breadth-first search.
471
views
1 answers
0 votes
Imagine you are guiding a robot through a grid-based maze using the A* algorithm. The robot is currently at node A (start) and wants to reach node B (goal). ... A* calculation? A) Node CB) Node DC) Node ED) Not enough information to decide
327
views
1 answers
0 votes
When choosing one feature from \(X_1, \ldots, X_n\) while building a Decision Tree, which of the following criteria is the most appropriate to maximize? (Here, \(H()\) means entropy, and \(P( ... X_j)\)(d) \(H(Y | X_j)\)(e) \(H(Y) - P(Y)\)
351
views
1 answers
0 votes
$True$ or $False?$ If decision trees such as the ones we built in class are allowed to have decision nodes based on questions that can have many ... tend to add the multiple answer questions to the tree before adding the binary questions
297
views
1 answers
0 votes
P1: In the limit of infinite training and test data, consistent estimators always give at least as low a test error as biased estimators. P2: Leave-one out cross ... ?Only P1 is TrueOnly P2 is TrueP1 is True and P2 is FalseBoth are False
183
views
0 answers
0 votes
Using the same data as above \( \mathbf{X} = [-3, 5, 4] \) and \( \mathbf{Y} = [-10, 20, 20] \), assuming a ridge penalty \( \lambda = 50 \), what ratio versus the MLE ... \mathbf{w}}_{\text{ridge}} \) will be?(a)] 2b)] 1(c)] 0.666(d)] 0.5
220
views
1 answers
0 votes
Consider the statements:$P1:$ It is generally more important to use consistent estimators when one has smaller numbers of training examples.$P2:$ It is generally more important to ... C) Only $P2$ is True(D) Both $P1$ and $P2$ are False
267
views
1 answers
0 votes
Suppose we have a regularized linear regression model: \[ \text{argmin}_{\mathbf{w}} \left||\mathbf{Y} - \mathbf{Xw} \right||^2 + k \|\ ... bias, increases variance(d)] Decreases bias, decreases variance(e)] Not enough information to tell
181
views
1 answers
0 votes
Suppose we have a regularized linear regression model: \[ \text{argmin}_{\mathbf{w}} \left||\mathbf{Y} - \mathbf{Xw} \right||^2 + \lambda \ ... , increases variance(d)] Decreases bias, decreases variance(e)] Not enough information to tell
224
views
1 answers
0 votes
Suppose we want to compute $10-Fold$ Cross-Validation error on $100$ training examples. We need to compute error $N1$ times, and the Cross-Validation error is the average of the errors. ... $N1 = 10, N2 = 100, N3 = 10$
2.8k
views
3 answers
3 votes
ln neural network, the network capacity is defined as:The traffic (tarry capacity of the networkThe total number of nodes in the networkThe number of patterns that can be stored and recalled in a networkNone of the above
1.5k
views
2 answers
0 votes
Which of the following is NOT true in problem solving in artificial intelligence?Implements heuristic search techniqueSolution steps are not explicitKnowledge is impreciseIt works on or implements repetition mechanism
4.5k
views
2 answers
1 votes
$A^*$ algorithm uses $f'=g+h'$ to estimate the cost of getting from the initial state to the goal state, where $g$ is a measure of cost getting from initial state to ... $g=0$h'=0$h'=1$
5.3k
views
2 answers
3 votes
In Delta Rule for error minimizationweights are adjusted w.r.to change in the outputweights are adjusted w.r.to difference between desired output and actual ... are adjusted w.r.to difference between output and outputnone of the above
5.8k
views
2 answers
3 votes
Forward chaining systems are ____ where as backward chaining systems are ____Data driven, Data drivenGoal driven, Data drivenData driven, Goal drivenGoal driven, Goal driven
To see more, click for all the questions in this category.