Interested to Buy Any Domain ? << Click Here >> for more details...
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
When an algorithm is considered completed?
Tell me how do you choose an algorithm for a classification problem?
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 meant by a * search algorithm?
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 is the uniform cost search algorithm?
list the types of linked list with aid of diagram?
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
Can you list some use cases where classification machine learning algorithms can be used?
Why size of integer depends on the machine architecture then what the best sorting algorithm and why?
What are the disadvantages of depth-first search algorithm?
Sorting algorithms and time complexity of various algorithms.
What is the breadth-first search algorithm?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
What is depth-first search algorithm?
