Register

UGC NET CSE | September 2013 | Part 3 | Question: 13

• edited by
1,567 views

1 Answer

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

Related questions

1 votes
1 votes
1 answer
2
go_editor asked Jul 22, 2016
4,374 views
UGC NET CSE | September 2013 | Part 3 | Question: 5
The Blocks World Problem in Artificial Intelligence is normally discussed to explain a Search technique Planning system Constraint satisfaction system Knowledge base system
The Blocks World Problem in Artificial Intelligence is normally discussed to explain aSearch techniquePlanning systemConstraint satisfaction systemKnowledge base system
User Avatar
0 votes
0 votes
1 answer
3
go_editor asked Jul 24, 2016
3,183 views
UGC NET CSE | September 2013 | Part 3 | Question: 28
In a single perceptron, the updation rule of weight vector is given by $w(n+1) = w(n) + \eta [d(n)-y(n)]$ $w(n+1) = w(n) - \eta [d(n)-y(n)]$ $w(n+1) = w(n) + \eta [d(n)-y(n)]*x(n)$ $w(n+1) = w(n) - \eta [d(n)-y(n)]*x(n)$
In a single perceptron, the updation rule of weight vector is given by$w(n+1) = w(n) + \eta [d(n)-y(n)]$$w(n+1) = w(n) - \eta [d(n)-y(n)]$$w(n+1) = w(n) + \eta [d(n)-y(n)...
User Avatar
Link Copied!