nn

Type Members

1. case class BallTree[V](keys: IndexedSeq[DenseVector[Double]], values: IndexedSeq[V], leafSize: Int = 50) extends Serializable with BallTreeBase[V] with Product with Serializable

   

   Performs fast lookups of nearest neighbors using the Ball Tree algorithm for space partitioning

   Performs fast lookups of nearest neighbors using the Ball Tree algorithm for space partitioning

   Note that this code borrows heavily from https://github.com/felixmaximilian/mips

2. trait BallTreeBase[V] extends AnyRef

   

3. case class BestMatch(index: Int, distance: Double) extends Serializable with Product with Serializable

   

4. class BoundedPriorityQueue[A] extends Iterable[A] with Growable[A] with Serializable

   

   Bounded priority queue.

   Bounded priority queue. This class wraps the original PriorityQueue class and modifies it such that only the top K elements are retained. The top K elements are defined by an implicit Ordering[A].

5. case class ConditionalBallTree[L, V](keys: IndexedSeq[DenseVector[Double]], values: IndexedSeq[V], labels: IndexedSeq[L], leafSize: Int = 50) extends Serializable with BallTreeBase[V] with Product with Serializable

   

6. class ConditionalKNN extends Estimator[ConditionalKNNModel] with ConditionalKNNParams with DefaultParamsWritable with OptimizedCKNNFitting

   

7. class ConditionalKNNModel extends Model[ConditionalKNNModel] with ComplexParamsWritable with ConditionalKNNParams

   

8. trait ConditionalKNNParams extends KNNParams with HasLabelCol

   

9. class KNN extends Estimator[KNNModel] with KNNParams with DefaultParamsWritable with OptimizedKNNFitting

   

10. class KNNModel extends Model[KNNModel] with ComplexParamsWritable with KNNParams

    

11. trait KNNParams extends HasFeaturesCol with Wrappable with HasOutputCol

    

12. class ReverseIndex[L] extends Serializable