K Quantiles Medoids (KQM) Clustering
Overview
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.
Install
Health
- OK13 OK2026-08-05
- NOTE12 OK, 1 NOTE2026-08-01
- OK14 OK2026-03-10
Documentation
- Help pages
- 5includes a package overview page
- Examples that run
- 100%5 run in a plain check
- Exported functions with examples
- 100%
- Documented parameters
- 100%
- Return-value docs
- 100%
- Help pages citing references
- 60%
Downloads
Dependencies
Code & Tests
People & History
- RR 4.6.0 released · 2026-04-24
- 1.1.1Latest2025-10-16 · current release
- RR 4.5.0 released · 2025-04-11
Package metadata
- First published
- 2025-10-16
- Total releases
- 1 / 1 yrs
- License
- GPL-2 OSI
- Download size
- 5.3 KB
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("KQM")This package has no citation file, so citation() returns this entry built from DESCRIPTION.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-22, which the citation names so these numbers can be found later. More on citing and the projects behind them.