Answer Posted / 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.
| Is This Answer Correct ? | 2 Yes | 2 No |
Post New Answer View All Answers
What is meant by uniform cost search algorithm?
Tell me how do you choose an algorithm for a classification problem?
What is informed (heuristic) search strategies algorithm?
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
When an algorithm is considered completed?
What is depth-first search algorithm?
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?
What is greedy best first search algorithm?
What are disadvantages uniform cost search algorithm?
How does deep learning contrast with other machine learning algorithms?
What is breadth-first search 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.
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?
What are the complexities of sorting algorithms and how can this complexity be calculated?
