Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / rasmi ranjan das
A back-propagation neural network is only practical in
certain situations. Following are some guidelines on when
you should use another approach:
Can you write down a flow chart or a formula that
accurately describes the problem? If so, then stick with a
traditional programming method.
Is there a simple piece of hardware or software that
already does what you want? If so, then the development
time for a NN might not be worth it.
Do you want the functionality to "evolve" in a direction
that is not pre-defined? If so, then consider using a
Genetic Algorithm (that's another topic!).
Do you have an easy way to generate a significant number of
input/output examples of the desired behavior? If not, then
you won't be able to train your NN to do anything.
Is the problem is very "discrete"? Can the correct answer
can be found in a look-up table of reasonable size? A look-
up table is much simpler and more accurate.
Are precise numeric output values required? NN's are not
good at giving precise numeric answers.
Conversely, here are some situations where a BP NN might be
a good idea:
A large amount of input/output data is available, but
you're not sure how to relate it to the output.
The problem appears to have overwhelming complexity, but
there is clearly a solution.
It is easy to create a number of examples of the correct
behavior.
The solution to the problem may change over time, within
the bounds of the given input and output parameters (i.e.,
today 2+2=4, but in the future we may find that 2+2=3.8).
Outputs can be "fuzzy", or non-numeric.
| Is This Answer Correct ? | 6 Yes | 4 No |
Post New Answer View All Answers
Given a sorted array of n integers that has been rotated i(unknown) number of times, give a (log n) algorithm that finds an element in the array.
What is meant by a * search algorithm?
What is the bidirectional search algorithm?
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.
What is the most efficient way to store 1 million phone numbers memory-wise?
What is informed (heuristic) search strategies algorithm?
Tell me how do you choose an algorithm for a classification problem?
Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?
Name search algorithm technology?
can anyone help me with some suggestions and improvemnts for sage line 50?
Which language is used for artificial intelligence?
Draw a flowchart to find the average of four number?
Which search algorithm will use a limited amount of memory in an online search?
When an algorithm is considered completed?
