org.deeplearning4j.clustering.quadtree

Class QuadTree

java.lang.Object

org.deeplearning4j.clustering.quadtree.QuadTree

All Implemented Interfaces:

java.io.Serializable

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

QuadTree: http://en.wikipedia.org/wiki/Quadtree Reference impl based on the paper by: http://arxiv.org/pdf/1301.3342v2.pdf Primarily focused on 2 dimensions, may expand later if there's a reason.

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
QuadTree(Cell boundary)
QuadTree(org.nd4j.linalg.api.ndarray.INDArray data) Pass in a matrix
QuadTree(QuadTree parent, org.nd4j.linalg.api.ndarray.INDArray data, Cell boundary)

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)
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
protected QuadTree	findIndex(org.nd4j.linalg.api.ndarray.INDArray coordinates) Returns the cell of this element
Cell	getBoundary()
org.nd4j.linalg.api.ndarray.INDArray	getCenterOfMass()
int	getCumSize()
QuadTree	getNorthEast()
QuadTree	getNorthWest()
QuadTree	getParent()
int	getSize()
QuadTree	getSouthEast()
QuadTree	getSouthWest()
boolean	insert(int newIndex) Insert an index of the data in to the tree
boolean	isCorrect() Returns whether the tree is consistent or not
boolean	isLeaf()
void	setBoundary(Cell boundary)
void	setCenterOfMass(org.nd4j.linalg.api.ndarray.INDArray centerOfMass)
void	setCumSize(int cumSize)
void	setLeaf(boolean isLeaf)
void	setNorthEast(QuadTree northEast)
void	setNorthWest(QuadTree northWest)
void	setParent(QuadTree parent)
void	setSize(int size)
void	setSouthEast(QuadTree southEast)
void	setSouthWest(QuadTree southWest)
void	subDivide() Create four children which fully divide this cell into four quads of equal area

Methods inherited from class java.lang.Object

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

Constructor Detail

QuadTree

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

Pass in a matrix

Parameters:

data -

QuadTree

public QuadTree(QuadTree parent,
                org.nd4j.linalg.api.ndarray.INDArray data,
                Cell boundary)

QuadTree

public QuadTree(Cell boundary)

Method Detail

findIndex

protected QuadTree findIndex(org.nd4j.linalg.api.ndarray.INDArray coordinates)

Returns the cell of this element

Parameters:

coordinates -

Returns:

insert

public boolean insert(int newIndex)

Insert an index of the data in to the tree

Parameters:

newIndex - the index to insert in to the tree

Returns:

whether the index was inserted or not

isCorrect

public boolean isCorrect()

Returns whether the tree is consistent or not

Returns:

whether the tree is consistent or not

subDivide

public void subDivide()

Create four children which fully divide this cell into four quads of equal area

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)

Parameters:

rowP - a vector

colP -

valP -

N -

posF -

depth

public int depth()

The depth of the node

Returns:

the depth of the node

getCenterOfMass

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

setCenterOfMass

public void setCenterOfMass(org.nd4j.linalg.api.ndarray.INDArray centerOfMass)

getParent

public QuadTree getParent()

setParent

public void setParent(QuadTree parent)

getNorthWest

public QuadTree getNorthWest()

setNorthWest

public void setNorthWest(QuadTree northWest)

getNorthEast

public QuadTree getNorthEast()

setNorthEast

public void setNorthEast(QuadTree northEast)

getSouthWest

public QuadTree getSouthWest()

setSouthWest

public void setSouthWest(QuadTree southWest)

getSouthEast

public QuadTree getSouthEast()

setSouthEast

public void setSouthEast(QuadTree southEast)

isLeaf

public boolean isLeaf()

setLeaf

public void setLeaf(boolean isLeaf)

getSize

public int getSize()

setSize

public void setSize(int size)

getCumSize

public int getCumSize()

setCumSize

public void setCumSize(int cumSize)

getBoundary

public Cell getBoundary()

setBoundary

public void setBoundary(Cell boundary)