# ------------------------------------------------ # CITATION.cff file created with {cffr} R package # See also: https://docs.ropensci.org/cffr/ # ------------------------------------------------ cff-version: 1.2.0 message: 'To cite package "FCPS" in publications use:' type: software license: GPL-3.0-only title: 'FCPS: Fundamental Clustering Problems Suite' version: 1.4.1 doi: 10.1016/j.softx.2020.100642 identifiers: - type: doi value: 10.32614/CRAN.package.FCPS - type: doi value: 10.3390/pr9101697 abstract: 'Over sixty clustering algorithms are provided in this package with consistent input and output, which enables the user to try out algorithms swiftly. Additionally, 26 statistical approaches for the estimation of the number of clusters as well as the mirrored density plot (MD-plot) of clusterability are implemented. The packages is published in Thrun, M.C., Stier Q.: "Fundamental Clustering Algorithms Suite" (2021), SoftwareX, . Moreover, the fundamental clustering problems suite (FCPS) offers a variety of clustering challenges any algorithm should handle when facing real world data, see Thrun, M.C., Ultsch A.: "Clustering Benchmark Datasets Exploiting the Fundamental Clustering Problems" (2020), Data in Brief, .' authors: - family-names: Thrun given-names: Michael email: m.thrun@gmx.net orcid: https://orcid.org/0000-0001-9542-5543 preferred-citation: type: article title: Fundamental clustering algorithms suite authors: - name: Michael Christoph - family-names: Stier given-names: Quirin publisher: name: Elsevier journal: SoftwareX volume: '13' year: '2021' issn: 2352-7110 doi: 10.1016/j.softx.2020.100642 url: https://doi.org/10.3390/pr9101697 start: '100642' identifiers: - type: doi value: 10.3390/pr9101697 repository: https://mthrun.r-universe.dev repository-code: https://github.com/Mthrun/FCPS commit: 7aa98746af43d4d1c4f75cc69fc14f55f89f847c url: https://www.deepbionics.org/ date-released: '2026-07-23' contact: - family-names: Thrun given-names: Michael email: m.thrun@gmx.net orcid: https://orcid.org/0000-0001-9542-5543