public class BallTree extends Object
| 限定符和类型 | 字段 | 说明 |
|---|---|---|
static int |
numSkipped |
| 限定符 | 构造器 | 说明 |
|---|---|---|
protected |
BallTree(List<Event> data,
int minParent) |
Creates a Ball Tree (k-d tree) for the data to reduce the speed of the log probability computation.
|
| 限定符和类型 | 方法 | 说明 |
|---|---|---|
protected static double |
computeLogKernel(double[] y,
double[] s,
double h) |
|
protected static double |
computeLogKernel(double[] y,
double[] s,
double hMax,
double hMin) |
The actual math for computing the log probability contribution for point y from point s.
|
protected static List<Double> |
computeLogKernel(double[] y,
List<Event> samples) |
|
protected List<Double> |
logPdfRecurse(Event e) |
Computing the log probability in a recursive way on the tree.
|
protected BallTree(List<Event> data, int minParent)
data - - The data to create the BallTree forminParent - - Minimum number of nodes in the area to split to split a region to sub regions.protected List<Double> logPdfRecurse(Event e)
e - - Event to estimate the log probability forprotected static double computeLogKernel(double[] y,
double[] s,
double h)
protected static double computeLogKernel(double[] y,
double[] s,
double hMax,
double hMin)
y - - The point we estimate for.s - - Observed point in the modelhMax - - The maximum bandwidth in this regionhMin - - The minimum bandwidth in this regionCopyright © 2019. All rights reserved.