Register

UGC NET CSE | June 2012 | Part 3 | Question: 2

• recategorized by
5,273 views
3 votes
3 votes

In Delta Rule for error minimization

  1. weights are adjusted w.r.to change in the output
  2. weights are adjusted w.r.to difference between desired output and actual output
  3. weights are adjusted w.r.to difference between output and output
  4. none of the above
• recategorized by
User Avatar

2 Answers

0 votes
0 votes

In the Delta Rule for error minimization, weights are adjusted w.r.to difference between desired output and actual output.

So, the correct option is:

weights are adjusted w.r.to difference between desired output and actual output

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4.5k
views
2 answers
1 votes
go_editor asked Jul 7, 2016
4,506 views
UGC NET CSE | June 2012 | Part 3 | Question: 21
$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$
User Avatar
1.3k
views
1 answers
3 votes
go_editor asked Jul 7, 2016
1,263 views
UGC NET CSE | June 2012 | Part 3 | Question: 23
Which of the following prolog programs correctly implement if G succeeds then execute goal P else execute goal $\theta$ ?if-else (G, P, $\theta$):-!,call(G), call(P). if- ... , !. if-else (G,P, $\theta$) :- call($\theta$).All of the above
User Avatar
4.8k
views
1 answers
3 votes
makhdoom ghaya asked Aug 2, 2016
4,826 views
UGC NET CSE | December 2014 | Part 3 | Question: 72
Match the following learning modes $w.r.t$. characteristics of available information for learning : a. Supervisedi. Instructive information on desired responses, explicitly specified by a teacher. b. ... iii iii iv i
User Avatar
471
views
1 answers
0 votes
rajveer43 asked Jan 16
471 views
AI Sample Question for DS-AI
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
User Avatar
Link Copied!