# -------------------------------------------- # CITATION file created with {cffr} R package # See also: https://docs.ropensci.org/cffr/ # -------------------------------------------- cff-version: 1.2.0 message: 'To cite package "lumbermark" in publications use:' type: software license: AGPL-3.0-only title: 'lumbermark: Resistant Clustering via Chopping Up Mutual Reachability Minimum Spanning Trees' version: 0.9.0.9001 doi: 10.32614/CRAN.package.lumbermark identifiers: - type: url value: https://clustering-benchmarks.gagolewski.com/ abstract: 'Implements a fast and resistant divisive clustering algorithm which identifies a specified number of clusters: ''lumbermark'' iteratively chops off sizeable limbs that are joined by protruding segments of a dataset''s mutual reachability minimum spanning tree (Gagolewski, 2026 ). The use of a mutual reachability distance pulls peripheral points farther away from each other. When combined with the ''deadwood'' package, it can act as an outlier detector. The ''Python'' version of ''lumbermark'' is available via ''PyPI''.' authors: - family-names: Gagolewski given-names: Marek email: marek@gagolewski.com orcid: https://orcid.org/0000-0003-0637-6028 repository: https://gagolews.r-universe.dev repository-code: https://github.com/gagolews/lumbermark commit: cdc096eec0a05c317a4eb2a7312cbab5b5ecc980 url: https://lumbermark.gagolewski.com/ date-released: '2026-04-21' contact: - family-names: Gagolewski given-names: Marek email: marek@gagolewski.com orcid: https://orcid.org/0000-0003-0637-6028