What is Na?ve Bayes Algorithm?

Answers were Sorted based on User's Feedback

What is Na?ve Bayes Algorithm?..

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

What is Na?ve Bayes Algorithm?..

this algorithm is used to work on large databases

 Is This Answer Correct ? 2 Yes 3 No

More AI Algorithms Interview Questions

There are numbers from 1 to n, which are inverted such that it results in numbers from n to 1. If only two consecutive numbers are stampled at a time and are inverted, how many moves are required?

Draw a flowchart to find the average of four number?

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.

can anyone help me with some suggestions and improvemnts for sage line 50?

what is software cycle?give a diagramatic representation

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.

What is Na?ve Bayes Algorithm?

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?

list the types of linked list with aid of diagram?

What is Back propagation in Neural Networks?

what are the minimum requirements for statr testing?

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.

Categories
• AI Algorithms (14)
• AI Language Processing (11)
• AI Knowledge Representation (12)
• AI Robotics (97)
• AI Recognition (11)
• AI Neural Networks (22)
• AI Fuzzy Logic (21)
• AI Games (4)
• AI Languages (139)
• AI Tools (5)
• AI Machine Learning (0)
• AI General (18)
• AI AllOther (6)