MOA 12.03
Real Time Analytics for Data Streams
moa.clusterers.streamkm.TreeCoreset Class Reference

List of all members.

Classes

class  treeNode
 datastructure representing a node within a tree More...

Package Functions

double treeNodeSplitCost (treeNode node, Point centreA, Point centreB)
 computes the hypothetical cost if the node would be split with new centers centreA, centreB
double treeNodeCostOfPoint (treeNode node, Point p)
 computes the cost of point p with the centre of treenode node
boolean isLeaf (treeNode node)
 tests if a node is a leaf
treeNode selectNode (treeNode root, MTRandom clustererRandom)
 selects a leaf node (using the kMeans++ distribution)
Point chooseCentre (treeNode node, MTRandom clustererRandom)
 selects a new centre from the treenode (using the kMeans++ distribution)
Point determineClosestCentre (Point p, Point centreA, Point centreB)
 returns the next centre
void split (treeNode parent, Point newCentre, int newCentreIndex)
 splits the parent node and creates two child nodes (one with the old centre and one with the new one)
boolean treeFinished (treeNode root)
 Checks if the storage is completly freed.
void freeTree (treeNode root)
 frees a tree of its storage
void unionTreeCoreset (int k, int n_1, int n_2, int d, Point[] setA, Point[] setB, Point[] centres, MTRandom clustererRandom)
 Constructs a coreset of size k from the union of setA and setB.

Detailed Description

Author:
Marcel R. Ackermann, Christiane Lammersen, Marcus Maertens, Christoph Raupach, Christian Sohler, Kamil Swierkot

Definition at line 8 of file TreeCoreset.java.


Member Function Documentation

Point moa.clusterers.streamkm.TreeCoreset.chooseCentre ( treeNode  node,
MTRandom  clustererRandom 
) [package]

selects a new centre from the treenode (using the kMeans++ distribution)

Definition at line 298 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.TreeCoreset.unionTreeCoreset().

Here is the call graph for this function:

Here is the caller graph for this function:

Point moa.clusterers.streamkm.TreeCoreset.determineClosestCentre ( Point  p,
Point  centreA,
Point  centreB 
) [package]

returns the next centre

Definition at line 344 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.TreeCoreset.split().

Here is the caller graph for this function:

void moa.clusterers.streamkm.TreeCoreset.freeTree ( treeNode  root) [package]

frees a tree of its storage

Definition at line 496 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.TreeCoreset.unionTreeCoreset().

Here is the call graph for this function:

Here is the caller graph for this function:

boolean moa.clusterers.streamkm.TreeCoreset.isLeaf ( treeNode  node) [package]

tests if a node is a leaf

Definition at line 249 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.TreeCoreset.freeTree(), and moa.clusterers.streamkm.TreeCoreset.selectNode().

Here is the caller graph for this function:

treeNode moa.clusterers.streamkm.TreeCoreset.selectNode ( treeNode  root,
MTRandom  clustererRandom 
) [package]

selects a leaf node (using the kMeans++ distribution)

Definition at line 262 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.TreeCoreset.unionTreeCoreset().

Here is the call graph for this function:

Here is the caller graph for this function:

void moa.clusterers.streamkm.TreeCoreset.split ( treeNode  parent,
Point  newCentre,
int  newCentreIndex 
) [package]

splits the parent node and creates two child nodes (one with the old centre and one with the new one)

Definition at line 406 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.TreeCoreset.unionTreeCoreset().

Here is the call graph for this function:

Here is the caller graph for this function:

boolean moa.clusterers.streamkm.TreeCoreset.treeFinished ( treeNode  root) [package]

Checks if the storage is completly freed.

Definition at line 489 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.TreeCoreset.freeTree().

Here is the caller graph for this function:

double moa.clusterers.streamkm.TreeCoreset.treeNodeCostOfPoint ( treeNode  node,
Point  p 
) [package]

computes the cost of point p with the centre of treenode node

Definition at line 213 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.TreeCoreset.chooseCentre().

Here is the caller graph for this function:

double moa.clusterers.streamkm.TreeCoreset.treeNodeSplitCost ( treeNode  node,
Point  centreA,
Point  centreB 
) [package]

computes the hypothetical cost if the node would be split with new centers centreA, centreB

Definition at line 138 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.TreeCoreset.chooseCentre().

Here is the caller graph for this function:

void moa.clusterers.streamkm.TreeCoreset.unionTreeCoreset ( int  k,
int  n_1,
int  n_2,
int  d,
Point[]  setA,
Point[]  setB,
Point[]  centres,
MTRandom  clustererRandom 
) [package]

Constructs a coreset of size k from the union of setA and setB.

Definition at line 527 of file TreeCoreset.java.

Referenced by moa.clusterers.streamkm.BucketManager.getCoresetFromManager(), and moa.clusterers.streamkm.BucketManager.insertPoint().

Here is the call graph for this function:

Here is the caller graph for this function:


The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Enumerations