Direct reading algorithm for hierarchical clustering

Journal article


Murtagh, Fionn and Contreras, Pedro 2016. Direct reading algorithm for hierarchical clustering. Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2016.11.006
AuthorsMurtagh, Fionn and Contreras, Pedro
Abstract

Reading the clusters from a data set such that the overall computational complexity is linear in both data dimensionality and in the number of data elements has been carried out through filtering the data in wavelet transform space. This objective is also carried out after an initial transforming of the data to a canonical order. Including high dimensional, high cardinality data, such a canonical order is provided by row and column permutations of the data matrix. In our recent work, we induce a hierarchical clustering from seriation through unidimensional representation of our observations. This linear time hierarchical classification is directly derived from the use of the Baire metric, which is simultaneously an ultrametric. In our previous work, the linear time construction of a hierarchical clustering is studied from the following viewpoint: representing the hierarchy initially in an m-adic, m =10, tree representation, followed by decreasing m to smaller valued representations that include p-adic representations, where p is prime and m is a non-prime positive integer. This has the advantage of facilitating a more direct visualization and hence interpretation of the hierarchy. In this work we present further case studies and examples of how this approach is very advantageous for such an ultrametric topological data mapping.

KeywordsAnalytics; Hierarchical clustering; Ultrametric topology; Number representation; Linear time computational complexity
Year2016
JournalElectronic Notes in Discrete Mathematics
PublisherElsevier
ISSN15710653
Digital Object Identifier (DOI)https://doi.org/10.1016/j.endm.2016.11.006
Web address (URL)http://hdl.handle.net/10545/621146
hdl:10545/621146
Publication dates01 Dec 2016
Publication process dates
Deposited12 Dec 2016, 09:30
Rights

Archived with thanks to Electronic Notes in Discrete Mathematics

ContributorsUniversity of Derby and Thinking Safe Ltd.
File
File
File Access Level
Open
Permalink -

https://repository.derby.ac.uk/item/9512y/direct-reading-algorithm-for-hierarchical-clustering

Download files

  • 2
    total views
  • 1
    total downloads
  • 0
    views this month
  • 0
    downloads this month

Export as