Answer / john martin

The Microsoft Naive Bayes algorithm is a classification
algorithm provided by Microsoft SQL Server Analysis Services
for use in predictive modeling. The name Naive Bayes derives
from the fact that the algorithm uses Bayes theorem but does
not take into account dependencies that may exist, and
therefore its assumptions are said to be naive.

This algorithm is less computationally intense than other
Microsoft algorithms, and therefore is useful for quickly
generating mining models to discover relationships between
input columns and predictable columns. You can use this
algorithm to do initial explorations of data, and then later
you can apply the results to create additional mining models
with other algorithms that are more computationally intense
and more accurate.

Answer / parvendra

this algorithm is used to work on large databases

What is software cycle? Give a diagrammatic representation?

0 Answers  

---

What is informed (heuristic) search strategies algorithm?

0 Answers  

---

What is bidirectional search algorithm?

0 Answers  

---

Which is the most straight forward approach for planning algorithm?

0 Answers  

---

What is the iterative deepening depth-first search algorithm?

0 Answers  

---

Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?

0 Answers  

---

What are the disadvantages of breadth-first search algorithm?

0 Answers  

---

What is Back propagation in Neural Networks?

1 Answers  

---

What is the bidirectional search algorithm?

0 Answers  

---

Tell me how do you choose an algorithm for a classification problem?

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

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.

0 Answers  

---