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
What is the breadth-first search algorithm?
Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?
What is greedy best first search algorithm?
what is software cycle?give a diagramatic representation
Which algorithm is used for solving temporal probabilistic reasoning?
can anyone help me with some suggestions and improvemnts for sage line 50?
What do you mean by overfitting and underfitting algorithms?
What is breath-first search algorithm?
What is the bidirectional search algorithm?
What is informed (heuristic) search strategies algorithm?
What are the disadvantages of depth-first search algorithm?
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
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 are the complexities of sorting algorithms and how can this complexity be calculated?
Which algorithm inverts a complete resolution strategy?
