Changeset 15207 for trunk/sources/HeuristicLab.Algorithms.DataAnalysis/3.4/TSNE/VantagePointTree.cs

Timestamp:

07/12/17 15:17:41 (7 years ago)

Author:

bwerth

Message:

#2700 worked on TSNE (mostly removing unused code)

File:

• trunk/sources/HeuristicLab.Algorithms.DataAnalysis/3.4/TSNE/VantagePointTree.cs (modified) (3 diffs)

trunk/sources/HeuristicLab.Algorithms.DataAnalysis/3.4/TSNE/VantagePointTree.cs

@@ -68 +68 @@
   /// </summary>
   /// <typeparam name="T"></typeparam>
-  public class VantagePointTree<T> : IVantagePointTree<T> {
-    #region properties
+  public class VantagePointTree<T> {
     private readonly List<T> items;
     private readonly Node root;
     private readonly IDistance<T> distance;
-    #endregion
 
     public VantagePointTree(IDistance<T> distance, IEnumerable<T> items) : base() {
@@ -82 +80 @@
     }
 
+    /// <summary>
+    /// provides the k-nearest neighbours to a certain target element
+    /// </summary>
+    /// <param name="target">The target element</param>
+    /// <param name="k">How many neighbours</param>
+    /// <param name="results">The nearest neighbouring elements</param>
+    /// <param name="distances">The distances form the target corresponding to the neighbouring elements</param>
     public void Search(T target, int k, out IList<T> results, out IList<double> distances) {
       var heap = new PriorityQueue<double, IndexedItem<double>>(double.MaxValue, double.MinValue, k);
-      double tau = double.MaxValue;
+      var tau = double.MaxValue;
       Search(root, target, k, heap, ref tau);
       var res = new List<T>();
       var dist = new List<double>();
       while (heap.Size > 0) {
-        res.Add(items[heap.PeekMinValue().Index]);          // actually max distance
+        res.Add(items[heap.PeekMinValue().Index]);// actually max distance
         dist.Add(heap.PeekMinValue().Value);
         heap.RemoveMin();
       }
-      res.Reverse();  
+      res.Reverse();
       dist.Reverse();
       results = res;
@@ -104 +109 @@
       if (dist < tau) {
         if (heap.Size == k) heap.RemoveMin();   // remove furthest node from result list (if we already have k results) 
-        heap.Insert(-dist, new IndexedItem<double>(node.index, dist));      
+        heap.Insert(-dist, new IndexedItem<double>(node.index, dist));
         if (heap.Size == k) tau = heap.PeekMinValue().Value;
       }