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 software cycle?give a diagramatic representation
What is meant by a * search algorithm?
What is breath-first search algorithm?
Tell us how will you know which machine learning algorithm to choose for your classification problem?
Which is the most straight forward approach for planning algorithm?
what is software cycle?give a diagramatic representation
What are the complexities of sorting algorithms and how can this complexity be calculated?
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.
When an algorithm is considered completed?
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’s your favorite algorithm, & can you explain it into me in less than a minute?
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).
Draw a flowchart to find the average of four number?
What is the uniform cost search algorithm?
What is software cycle? Give a diagrammatic representation?
