The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
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[@]metanet.ch.
K Quantiles Medoids (KQM) clustering applies quantiles to divide data of each dimension into K mean intervals. Combining quantiles of all the dimensions of the data and fully permuting quantiles on each dimension is the strategy to determine a pool of candidate initial cluster centers. To find the best initial cluster centers from the pool of candidate initial cluster centers, two methods based on quantile strategy and PAM strategy respectively are proposed. During a clustering process, medoids of clusters are used to update cluster centers in each iteration. Comparison between KQM and the method of randomly selecting initial cluster centers shows that KQM is almost always getting clustering results with smaller total sum squares of distances.
Version: | 1.1.1 |
Depends: | methods, MASS, gtools, cluster |
Published: | 2025-10-16 |
DOI: | 10.32614/CRAN.package.KQM |
Author: | Yarong Yang [aut, cre], Nader Ebrahimi [ctb], Yoram Rubin [ctb], Jacob Zhang [ctb] |
Maintainer: | Yarong Yang <Yi.YA_yaya at hotmail.com> |
License: | GPL-2 |
NeedsCompilation: | no |
CRAN checks: | KQM results |
Reference manual: | KQM.html , KQM.pdf |
Package source: | KQM_1.1.1.tar.gz |
Windows binaries: | r-devel: KQM_1.1.1.zip, r-release: KQM_1.1.1.zip, r-oldrel: KQM_1.1.1.zip |
macOS binaries: | r-release (arm64): KQM_1.1.1.tgz, r-oldrel (arm64): KQM_1.1.1.tgz, r-release (x86_64): KQM_1.1.1.tgz, r-oldrel (x86_64): KQM_1.1.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=KQM to link to this page.
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.