Changeset 14858

Timestamp:

04/13/17 13:36:36 (8 years ago)

Author:

gkronber

Message:

#2700 fixed another bug in the bh-tsne implementation

Location:

branches/TSNE/HeuristicLab.Algorithms.DataAnalysis/3.4/TSNE

Files:

• SpacePartitioningTree.cs (modified) (1 diff)
• TSNEStatic.cs (modified) (3 diffs)

branches/TSNE/HeuristicLab.Algorithms.DataAnalysis/3.4/TSNE/SpacePartitioningTree.cs

@@ -250 +250 @@
     }
 
+    // does not use the tree
     public void ComputeEdgeForces(int[] rowP, int[] colP, double[] valP, int n, double[,] posF) {
       // Loop over all edges in the graph

branches/TSNE/HeuristicLab.Algorithms.DataAnalysis/3.4/TSNE/TSNEStatic.cs

@@ -202 +202 @@
 
         //Calculate Similarities
-        if(exact) p = CalculateExactSimilarites(data, distance, perplexity);
+        if (exact) p = CalculateExactSimilarites(data, distance, perplexity);
         else CalculateApproximateSimilarities(data, distance, perplexity, out rowP, out colP, out valP);
 
@@ -618 +618 @@
 
 
+
     private static void ComputeApproximateGradient(int[] rowP, int[] colP, double[] valP, double[,] y, int n, int d, double[,] dC, double theta) {
       var tree = new SpacePartitioningTree(y);
@@ -626 +627 @@
       var row = new double[d];
       for(var n1 = 0; n1 < n; n1++) {
+        Array.Clear(row,0,row.Length);
         tree.ComputeNonEdgeForces(n1, theta, row, ref sumQ);
         Buffer.BlockCopy(row, 0, negF, (sizeof(double) * n1 * d), d*sizeof(double));