Sciweavers

Share
PR
2006

Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data

8 years 8 months ago
Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the central partitional techniques and the Agglomerative Hierarchical Clustering techniques and their derivatives. These methods are well studied and well established. However, both categories have some drawbacks related to data dimensionality (for partitional algorithms) and to the bottom-up structure (for hierarchical agglomerative algorithms). To overcome these limitations, motivated by the problem of gene expression analysis with DNA microarrays, we present a hierarchical clustering algorithm based on a completely different principle, which is the analysis of shared farthest neighbors. We present a framework for clustering using ranks and indexes, and introduce the Shared Farthest Neighbors clustering criterion. We illustrate the properties of the method and present experimental results on different data sets...
Stefano Rovetta, Francesco Masulli
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2006
Where PR
Authors Stefano Rovetta, Francesco Masulli
Comments (0)
books