object MultiDimClusteringFunctions
Functions for multi-dimensional clustering of the data
- Alphabetic
- By Inheritance
- MultiDimClusteringFunctions
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hilbert_index(numBits: Int, cols: Column*): Column
Transforms the provided integer columns into their corresponding position in the hilbert curve for the given dimension.
Transforms the provided integer columns into their corresponding position in the hilbert curve for the given dimension.
- numBits
The number of bits to consider in each column.
- cols
The integer columns to map to the curve.
- See also
https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=bfd6d94c98627756989b0147a68b7ab1f881a0d6
https://en.wikipedia.org/wiki/Hilbert_curve
-
def
interleave_bits(cols: Column*): Column
Interleaves the bits of its input data in a round-robin fashion.
Interleaves the bits of its input data in a round-robin fashion.
If the input data is seen as a series of multidimensional points, this function computes the corresponding Z-values, in a way that's preserving data locality: input points that are close in the multidimensional space will be mapped to points that are close on the Z-order curve.
The returned value is a byte array where the size of the array is 4 * num of input columns.
- Note
Only supports input expressions of type Int for now.
- See also
https://en.wikipedia.org/wiki/Z-order_curve
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
range_partition_id(col: Column, numPartitions: Int): Column
Conceptually range-partitions the domain of values of the given column into
numPartitionspartitions and computes the partition number that every value of that column corresponds to.Conceptually range-partitions the domain of values of the given column into
numPartitionspartitions and computes the partition number that every value of that column corresponds to. One can think of this as an approximate rank() function.Ex. For a column with values (0, 1, 3, 15, 36, 99) and numPartitions = 3 returns partition range ids as (0, 0, 1, 1, 2, 2).
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()