CircularSilhouette: Fast Silhouette on Circular or Linear Data Clusters
Calculating silhouette information for clusters on
circular or linear data using fast algorithms. These algorithms run in
linear time on sorted data, in contrast to quadratic time by the
definition of silhouette. When used together with the fast and optimal
circular clustering method FOCC (Debnath & Song 2021)
<doi:10.1109/TCBB.2021.3077573> implemented in R package 'OptCirClust',
circular silhouette can be maximized to find the optimal number of
circular clusters; it can also be used to estimate the period of noisy
periodical data.
Version: |
0.0.1 |
Imports: |
OptCirClust, Rcpp (≥ 1.0.7), Rdpack |
LinkingTo: |
Rcpp |
Suggests: |
cluster, ggplot2, knitr, rmarkdown, testthat (≥ 3.0.0), graphics |
Published: |
2022-04-27 |
Author: |
Yinong Chen [aut],
Tathagata Debnath
[aut],
Andrew Cai [aut],
Joe Song [aut,
cre] |
Maintainer: |
Joe Song <joemsong at cs.nmsu.edu> |
License: |
LGPL (≥ 3) |
NeedsCompilation: |
yes |
Materials: |
NEWS |
CRAN checks: |
CircularSilhouette results |
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=CircularSilhouette
to link to this page.