Interested to Buy Any Domain ? << Click Here >> for more details...
What is Na?ve Bayes Algorithm?
- 2 Answers
- 19090 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / parvendra
this algorithm is used to work on large databases
| Is This Answer Correct ? | 2 Yes | 3 No |
Which search algorithm will use a limited amount of memory in online search?
What’s your favorite algorithm, & can you explain it into me in less than a minute?
What is the depth-first search algorithm?
What is iterative deepening depth-first search algorithm?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.
what is software cycle?give a diagramatic representation
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 are the complexities of sorting algorithms and how can this complexity be calculated?
What is depth-first search algorithm?
What is the uniform cost search algorithm?
-
AI Algorithms (74) - AI Natural Language Processing (96)
- AI Knowledge Representation Reasoning (12)
- AI Robotics (183)
- AI Computer Vision (13)
- AI Neural Networks (66)
- AI Fuzzy Logic (31)
- AI Games (8)
- AI Languages (141)
- AI Tools (11)
- AI Machine Learning (659)
- Data Science (671)
- Data Mining (120)
- AI Deep Learning (111)
- Generative AI (153)
- AI Frameworks Libraries (197)
- AI Ethics Safety (100)
- AI Applications (427)
- AI General (197)
- AI AllOther (6)
