hex.tree.isoforextended.isolationtree

Class CompressedIsolationTree

java.lang.Object

water.Iced<T>

water.Keyed<CompressedIsolationTree>

hex.tree.isoforextended.isolationtree.CompressedIsolationTree

All Implemented Interfaces:

java.io.Externalizable, java.io.Serializable, java.lang.Cloneable, water.Freezable<CompressedIsolationTree>

public class CompressedIsolationTree
extends water.Keyed<CompressedIsolationTree>

IsolationTree structure with better memory performance. Store only the data that are needed for scoring.

See Also:

Serialized Form

Field Summary

Fields inherited from class water.Keyed

_key

Constructor Summary

Constructors

Constructor and Description
CompressedIsolationTree(int heightLimit)

Method Summary

Modifier and Type	Method and Description
double	computePathLength(double[] row) Implementation of Algorithm 3 (pathLength) from paper.
AbstractCompressedNode[]	getNodes()
byte[]	toBytes() The structure of the bytes is: sizeOfInternalArrays -> size of random slope and intercept (size of both is always equal) nodeNumber -> index of the node in the array, byte arrays always starts with the root and ends with some leaf.

Methods inherited from class water.Keyed

checksum_impl, checksum_impl, checksum, checksum, getKey, makeSchema, readAll_impl, readAll, remove_impl, remove_impl, remove_self_key_impl, remove, remove, remove, remove, remove, remove, removeQuietly, writeAll_impl, writeAll

Methods inherited from class water.Iced

asBytes, clone, copyOver, frozenType, read, readExternal, readJSON, reloadFromBytes, toJsonBytes, toJsonString, write, writeExternal, writeJSON

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

CompressedIsolationTree

public CompressedIsolationTree(int heightLimit)

Method Detail

getNodes

public AbstractCompressedNode[] getNodes()

computePathLength

public double computePathLength(double[] row)

Implementation of Algorithm 3 (pathLength) from paper.

Parameters:

row - a row of the input data

Returns:

how deep the data are in the isolation tree plus estimation in case that heightLimit is hit

toBytes

public byte[] toBytes()

The structure of the bytes is: sizeOfInternalArrays -> size of random slope and intercept (size of both is always equal) nodeNumber -> index of the node in the array, byte arrays always starts with the root and ends with some leaf. Null node is skipped. AbstractCompressedNode -> refer to implementations for the detail of byte array |sizeOfInternalArrays|nodeNumber|CompressedNode|nodeNumber|AbstractCompressedNode|....|nodeNumber|CompressedLeaf|

Returns:

CompressedIsolationTree serialized as array of bytes