adjclust (Q39716): Difference between revisions
From MaRDI portal
Created claim: source code repository (P339): https://github.com/cran/adjclust, #quickstatements; #temporary_batch_1711027662947 |
Swh import (talk | contribs) SWHID from Software Heritage |
||||||||||||||
Property / Software Heritage ID | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:eb22ac196b30d94b6435c49a8b2c41e9778a489a / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:eb22ac196b30d94b6435c49a8b2c41e9778a489a / qualifier | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:eb22ac196b30d94b6435c49a8b2c41e9778a489a / qualifier | |||||||||||||||
point in time: 24 February 2024
|
Latest revision as of 22:14, 21 March 2024
Adjacency-Constrained Clustering of a Block-Diagonal Similarity Matrix
Language | Label | Description | Also known as |
---|---|---|---|
English | adjclust |
Adjacency-Constrained Clustering of a Block-Diagonal Similarity Matrix |
Statements
8 February 2024
0 references
Implements a constrained version of hierarchical agglomerative clustering, in which each observation is associated to a position, and only adjacent clusters can be merged. Typical application fields in bioinformatics include Genome-Wide Association Studies or Hi-C data analysis, where the similarity between items is a decreasing function of their genomic distance. Taking advantage of this feature, the implemented algorithm is time and memory efficient. This algorithm is described in Ambroise et al (2019) <doi:10.1186/s13015-019-0157-4>.
0 references