Databases
StackOverflow2013
Postsdbo
POImplement Gaussian Naive Bayes
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POImplement Gaussian Naive Bayes
    primarykey
    data
    text
    <p>I'm trying to implement Gaussian Naive Bayes in C# for classification of points. I have implemented first part ( <a href="http://www.statsoft.com/textbook/naive-bayes-classifier/" rel="noreferrer">http://www.statsoft.com/textbook/naive-bayes-classifier/</a> ) probability part, but i don't understand how to implement Gaussian Naive Bayes algorithm normal model. This is my code:</p> <pre><code>class NaiveBayesClassifier { private List&lt;Point&gt; listTrainPoints = new List&lt;Point&gt;(); private int totalPoints = 0; public NaiveBayesClassifier(List&lt;Point&gt; listTrainPoints) { this.listTrainPoints = listTrainPoints; this.totalPoints = this.listTrainPoints.Count; } private List&lt;Point&gt; vecinityPoints(Point p, double maxDist) { List&lt;Point&gt; listVecinityPoints = new List&lt;Point&gt;(); for (int i = 0; i &lt; listTrainPoints.Count; i++) { if (p.distance(listTrainPoints[i]) &lt;= maxDist) { listVecinityPoints.Add(listTrainPoints[i]); } } return listVecinityPoints; } public double priorProbabilityFor(double currentType) { double countCurrentType = 0; for (int i = 0; i &lt; this.listTrainPoints.Count; i++) { if (this.listTrainPoints[i].Type == currentType) { countCurrentType++; } } return (countCurrentType / this.totalPoints); } public double likelihoodOfXGiven(double currentType, List&lt;Point&gt; listVecinityPoints) { double countCurrentType = 0; for (int i = 0; i &lt; listVecinityPoints.Count; i++) { if (listVecinityPoints[i].Type == currentType) { countCurrentType++; } } return (countCurrentType / this.totalPoints); } public double posteriorProbabilityXBeing(double priorProbabilityFor, double likelihoodOfXGiven) { return (priorProbabilityFor * likelihoodOfXGiven); } public int allegedClass(Point p, double maxDist) { int type1 = 1, type2 = 2; List&lt;Point&gt; listVecinityPoints = this.vecinityPoints(p, maxDist); double priorProbabilityForType1 = this.priorProbabilityFor(type1); double priorProbabilityForType2 = this.priorProbabilityFor(type2); double likelihoodOfXGivenType1 = likelihoodOfXGiven(type1, listVecinityPoints); double likelihoodOfXGivenType2 = likelihoodOfXGiven(type2, listVecinityPoints); double posteriorProbabilityXBeingType1 = posteriorProbabilityXBeing(priorProbabilityForType1, likelihoodOfXGivenType1); double posteriorProbabilityXBeingType2 = posteriorProbabilityXBeing(priorProbabilityForType2, likelihoodOfXGivenType2); if (posteriorProbabilityXBeingType1 &gt; posteriorProbabilityXBeingType2) return type1; else return type2; } } </code></pre> <p>In this pdf file (Problem 5) is the description of what i need to do ( <a href="http://romanager.ro/s.10-701.hw1.sol.pdf" rel="noreferrer">http://romanager.ro/s.10-701.hw1.sol.pdf</a> ). My work is to implement Gaussina Naive Bayes and kNN algorithms and compare the result on a set of data. Please teach me where and how to implement Gaussian Naive Bayes algorithm.</p> <p>Thanks!</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USSirko
    1. USUrmelinho
    plurals
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POImplement Gaussian Naive Bayes
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POImplement Gaussian Naive Bayes
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POImplement Gaussian Naive Bayes
      1. This table or related slice is empty.
      1. VTUpMod
    1. COno one can help me? :(
      singulars
      1. POImplement Gaussian Naive Bayes
      1. USUrmelinho
    2. COUrmelinho: Offer a bounty and someone might help :-)
      singulars
      1. POImplement Gaussian Naive Bayes
      1. USAshwin Nanjappa
    3. COfor some ideas i don't think that someone want bounty from me ... for this part of algorithm i am completely out. You may consider that my thanks will be your rewards for the solution. I will consider any advice as a solution :D
      singulars
      1. POImplement Gaussian Naive Bayes
      1. USUrmelinho
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload