EuclideanRPSplit

Given a set of indices for data points from data, create a random hyperplane to split the data, returning two arrays indices that fall on either side of the hyperplane. This is the basis for a random projection tree, which simply uses this splitting recursively. This particular split uses euclidean distance to determine the hyperplane and which side each data sample falls on.

data: The original data to be split
indices: The indices of the elements in the data array that are to be split in the current operation.

Linear Supertypes

Product, Equals, RPSplit, Serializable, Serializable, AnyRef, Any

Instance Constructors

new EuclideanRPSplit(data: Array[Array[Double]], indices: ArrayBuffer[Int], rngState: Array[Long] = Array(2, 1, 1))

data
The original data to be split
indices
The indices of the elements in the data array that are to be split in the current operation.

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
val data: Array[Array[Double]]

The original data to be split
The original data to be split

Definition Classes
EuclideanRPSplit → RPSplit
def describe(): Unit

Definition Classes
EuclideanRPSplit → RPSplit
final val dim: Int

Definition Classes
RPSplit
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
val hyperplane: DenseVector[Double]

Definition Classes
RPSplit
val indices: ArrayBuffer[Int]

The indices of the elements in the data array that are to be split in the current operation.
The indices of the elements in the data array that are to be split in the current operation.

Definition Classes
EuclideanRPSplit → RPSplit
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val leftIndices: ArrayBuffer[Int]

Definition Classes
RPSplit
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
var offset: Double
val rand: Random

Definition Classes
RPSplit
val rightIndices: ArrayBuffer[Int]

Definition Classes
RPSplit
val rngState: Array[Long]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Doc: package umap

final case class EuclideanRPSplit(data: Array[Array[Double]], indices: ArrayBuffer[Int], rngState: Array[Long] = Array(2, 1, 1)) extends RPSplit with Product with Serializable

Instance Constructors

new EuclideanRPSplit(data: Array[Array[Double]], indices: ArrayBuffer[Int], rngState: Array[Long] = Array(2, 1, 1))

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val data: Array[Array[Double]]

def describe(): Unit

final val dim: Int

final def eq(arg0: AnyRef): Boolean

final def getClass(): Class[_]

val hyperplane: DenseVector[Double]

val indices: ArrayBuffer[Int]

final def isInstanceOf[T0]: Boolean

val leftIndices: ArrayBuffer[Int]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

var offset: Double

val rand: Random

val rightIndices: ArrayBuffer[Int]

val rngState: Array[Long]

final def synchronized[T0](arg0: ⇒ T0): T0

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

Deprecated Value Members

def finalize(): Unit

Inherited from Product

Inherited from Equals

Inherited from RPSplit

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped