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
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
Explain the concept behind dead lock avoidance, banker's algorithm.
Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.
What is depth-first search algorithm?
1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.
Define Routing Algorithm?
Tell me how do you choose an algorithm for a classification problem?
What is software cycle? Give a diagrammatic representation?
What do you mean by overfitting and underfitting algorithms?
What is the depth-first search algorithm?
Sorting algorithms and time complexity of various algorithms.
What is the uniform cost search algorithm?
Why size of integer depends on the machine architecture then what the best sorting algorithm and why?
Which is the most straight forward approach for planning algorithms?
What’s your favorite algorithm, & can you explain it into me in less than a minute?
