org.deeplearning4j.clustering.sptree

Class SpTree

java.lang.Object

org.deeplearning4j.clustering.sptree.SpTree

All Implemented Interfaces:

java.io.Serializable

public class SpTree
extends java.lang.Object
implements java.io.Serializable

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
static int	NODE_RATIO

Constructor Summary

Constructors

Constructor and Description
SpTree(org.nd4j.linalg.api.ndarray.INDArray data)
SpTree(org.nd4j.linalg.api.ndarray.INDArray data, java.util.Set<org.nd4j.linalg.api.ndarray.INDArray> indices)
SpTree(org.nd4j.linalg.api.ndarray.INDArray data, java.util.Set<org.nd4j.linalg.api.ndarray.INDArray> indices, java.lang.String similarityFunction)
SpTree(SpTree parent, org.nd4j.linalg.api.ndarray.INDArray data, org.nd4j.linalg.api.ndarray.INDArray corner, org.nd4j.linalg.api.ndarray.INDArray width, java.util.Set<org.nd4j.linalg.api.ndarray.INDArray> indices)
SpTree(SpTree parent, org.nd4j.linalg.api.ndarray.INDArray data, org.nd4j.linalg.api.ndarray.INDArray corner, org.nd4j.linalg.api.ndarray.INDArray width, java.util.Set<org.nd4j.linalg.api.ndarray.INDArray> indices, java.lang.String similarityFunction)

Method Summary

Modifier and Type	Method and Description
void	computeEdgeForces(org.nd4j.linalg.api.ndarray.INDArray rowP, org.nd4j.linalg.api.ndarray.INDArray colP, org.nd4j.linalg.api.ndarray.INDArray valP, int N, org.nd4j.linalg.api.ndarray.INDArray posF) Compute edge forces using barns hut
void	computeNonEdgeForces(int pointIndex, double theta, org.nd4j.linalg.api.ndarray.INDArray negativeForce, com.google.common.util.concurrent.AtomicDouble sumQ) Compute non edge forces using barnes hut
int	depth() The depth of the node
Cell	getBoundary()
org.nd4j.linalg.api.ndarray.INDArray	getCenterOfMass()
SpTree[]	getChildren()
int	getCumSize()
int	getD()
int[]	getIndex()
int	getNumChildren()
boolean	isCorrect() Verifies the structure of the tree (does bounds checking on each node)
boolean	isLeaf()
void	setCumSize(int cumSize)
void	setNumChildren(int numChildren)
void	subDivide() Subdivide the node in to 4 children

Methods inherited from class java.lang.Object

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

Field Detail

NODE_RATIO

public static final int NODE_RATIO

See Also:

Constant Field Values

Constructor Detail

SpTree

public SpTree(SpTree parent,
              org.nd4j.linalg.api.ndarray.INDArray data,
              org.nd4j.linalg.api.ndarray.INDArray corner,
              org.nd4j.linalg.api.ndarray.INDArray width,
              java.util.Set<org.nd4j.linalg.api.ndarray.INDArray> indices,
              java.lang.String similarityFunction)

SpTree

public SpTree(org.nd4j.linalg.api.ndarray.INDArray data,
              java.util.Set<org.nd4j.linalg.api.ndarray.INDArray> indices,
              java.lang.String similarityFunction)

SpTree

public SpTree(SpTree parent,
              org.nd4j.linalg.api.ndarray.INDArray data,
              org.nd4j.linalg.api.ndarray.INDArray corner,
              org.nd4j.linalg.api.ndarray.INDArray width,
              java.util.Set<org.nd4j.linalg.api.ndarray.INDArray> indices)

SpTree

public SpTree(org.nd4j.linalg.api.ndarray.INDArray data,
              java.util.Set<org.nd4j.linalg.api.ndarray.INDArray> indices)

SpTree

public SpTree(org.nd4j.linalg.api.ndarray.INDArray data)

Method Detail

subDivide

public void subDivide()

Subdivide the node in to 4 children

computeNonEdgeForces

public void computeNonEdgeForces(int pointIndex,
                                 double theta,
                                 org.nd4j.linalg.api.ndarray.INDArray negativeForce,
                                 com.google.common.util.concurrent.AtomicDouble sumQ)

Compute non edge forces using barnes hut

Parameters:

pointIndex -

theta -

negativeForce -

sumQ -

computeEdgeForces

public void computeEdgeForces(org.nd4j.linalg.api.ndarray.INDArray rowP,
                              org.nd4j.linalg.api.ndarray.INDArray colP,
                              org.nd4j.linalg.api.ndarray.INDArray valP,
                              int N,
                              org.nd4j.linalg.api.ndarray.INDArray posF)

Compute edge forces using barns hut

Parameters:

rowP - a vector

colP -

valP -

N - the number of elements

posF - the positive force

isLeaf

public boolean isLeaf()

isCorrect

public boolean isCorrect()

Verifies the structure of the tree (does bounds checking on each node)

Returns:

true if the structure of the tree is correct.

depth

public int depth()

The depth of the node

Returns:

the depth of the node

getChildren

public SpTree[] getChildren()

getD

public int getD()

getCenterOfMass

public org.nd4j.linalg.api.ndarray.INDArray getCenterOfMass()

getBoundary

public Cell getBoundary()

getIndex

public int[] getIndex()

getCumSize

public int getCumSize()

setCumSize

public void setCumSize(int cumSize)

getNumChildren

public int getNumChildren()

setNumChildren

public void setNumChildren(int numChildren)