Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Yinong Chen [aut] (<https://orcid.org/0000-0003-1641-1712>), Tathagata Debnath [aut] (<https://orcid.org/0000-0001-6445-275X>), Andrew Cai [aut], Joe Song [aut, cre] (<https://orcid.org/0000-0002-6883-6547>) |
| Maintainer | Joe Song <joemsong@cs.nmsu.edu> |
| License | LGPL (>= 3) |
| Version | 0.0.1 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the CircularSilhouette package in your browser
Any scripts or data that you put into this service are public.
