Go to the source code of this file.
|
module | pm_clusDensity |
| This module contains procedures and routines for finding the minimum-volume bounding ellipsoid partitioning of a given set of points by minimizing the volumes of the ellipsoids and comparing them against their parents. Monday 2:37 am, March 28, 2021, Dallas, TX Saturday 00:37 am, March 13, 2021, Dallas, TX Saturday 02:37 am, May 31, 2021, Dallas, TX Tuesday 2:13 am, March 10, 2021, Dallas, TX.
|
|
|
function | pm_clusDensity::partition_typer (Point, nc, nt, nsim, nemax, minSize, stanEnabled, trimEnabled, kmeansRelTol, logExpansion, logShrinkage if MINVOL_ENABLED |
| This function can serve as the constructor for partition_type while also performing the partitioning for the first time. Construct a hierarchical partitioning of the input Point using a combination of Kmeans, Kvolume, and density maximization algorithms. More...
|
|
subroutine | pm_clusDensity::runPartition (Partition, Point, parentLogVolNormed) |
| This procedure is a method of the class partition_type. Perform recursive clustering of the input Point(nd,np) . More...
|
|
PURE real(RK) function | pm_clusDensity::getLogLikeFitness (count, logVolRatio) |
|
real(RK) function, dimension(npmin:npmax) | pm_clusDensity::getBiasCorrectionScaleFactorSq (nd, npmin, npmax) |
|
subroutine | pm_clusDensity::writePartition (Partition, fileUnit, Point) |
|