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.
- Version0.0.1
- R versionunknown
- LicenseLGPL (≥ 3)
- Needs compilation?Yes
- Last release04/27/2022
Documentation
Team
Joe Song
Yinong Chen
Tathagata Debnath
Andrew Cai
Show author detailsRolesAuthor
Insights
Last 30 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports3 packages
- Suggests5 packages
- Linking To1 package
- Reverse Depends1 package