Constructing hierarchical set systems (Q1764476)

From MaRDI portal
Revision as of 02:23, 15 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q94696471, #quickstatements; #temporary_batch_1726359655382)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Constructing hierarchical set systems
scientific article

    Statements

    Constructing hierarchical set systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 February 2005
    0 references
    This paper introduces a new algorithm to achieve data clusters. The procedure works with dissimilarity data. It starts with the so-called Apresjan hierarchy and while the needed calculations are easy and fast, the resulting nested clusters give a very good understanding of the data.
    0 references
    set systems
    0 references
    hierarchies
    0 references
    Farris transform
    0 references
    ranking procedure
    0 references
    ranking statistics
    0 references
    diversity optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references