The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]dogado.de.
Version: 0.2.0
Date: 2022-04-11
Author: David Charles Howe
kmodR@edgecondition.com
An implementation of the ‘k-means–’ algorithm proposed by Chawla and
Gionis, 2013 in their paper, “k-means– : A unified approach to
clustering and outlier detection. SIAM International Conference on Data
Mining (SDM13)”, and using ‘ordering’ described by Howe, 2013 in the
thesis, “Clustering and anomaly detection in tropical cyclones”.
Useful for creating (potentially) tighter clusters than standard k-means
and simultaneously finding outliers inexpensively in multidimensional
space.
kmod(X, k = 3, l = 5)
use ?kmod for more details
X – matrix of numeric data or an object that can be coerced to such a
matrix (such as a data frame with numeric columns only)
k – the number of clusters to find (default = 5)
l – the number of outliers to find (default = 0)
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.
Health stats visible at Monitor.