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 informed (heuristic) search strategies algorithm?
What are the disadvantages of depth-first search algorithm?
Which is the most straight forward approach for planning algorithms?
Given a series of positive integers. Design an efficient algorithm that can detect pairs whose sum is equal to K such that K = ei + ej, and (i not equal to j).
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 software cycle? Give a diagrammatic representation?
What is the breadth-first search algorithm?
What is bidirectional search algorithm?
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
What are disadvantages uniform cost search algorithm?
Tell briefly about the Banker's algorithm and what is it used for?
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 is greedy best first search algorithm?
Name search algorithm technology?
What are the disadvantages of breadth-first search algorithm?
