Version 0.9.5 of libagf
Release Notes: The k-nearest-neighbours routine is now based on a quicksort instead of a binary tree, and a weights calculation routine implemented that solves for the filter variance using the same root-finding algorithm (supernewton) as the class borders algorithm. To accommodate these changes, several options have been changed/added.
Other releases
Release Notes: This release has a new command for generating the Relative Operation Characteristic (ROC) function. There is also a shell script for validating probability density function estimates. Many bugs have been found and corrected.
Release Notes: The k-nearest-neighbours routine is now based on a quicksort instead of a binary tree, and a weights calculation routine implemented that solves for the filter variance using the same root-finding algorithm (supernewton) as the class borders algorithm. To accommodate these changes, several options have been changed/added.
Release Notes: Everything except the I/O routines has been templated. With the exception of those used in external routines, variable types in the main routines are now controlled with global typedefs, with each class of variable having a different type. Different metrics are now only supported in the routines where they make sense: KNN classification and KNN interpolation. The functions now require a pointer to the desired metric. The nfold routine now supports interpolation. Note that this is still not well tested (if at all).
Release Notes: This release includes a basic quickstart guide to get new users up and running as well as a more in depth discussion of the theory. Classification algorithms are stable and run very well.
