Multi-scale clustering by building a robust and self correcting ultrametric topology on data points.
The advent of high-throughput technologies and the concurrent advances in information sciences have led to an explosion in size and complexity of the data sets collected in biological sciences. The biggest challenge today is to assimilate this wealth of information into a conceptual framework that w...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2013-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC3570468?pdf=render |
id |
doaj-7b04a71ed1134f17a47100e1b28d49e4 |
---|---|
record_format |
Article |
spelling |
doaj-7b04a71ed1134f17a47100e1b28d49e42020-11-25T01:59:16ZengPublic Library of Science (PLoS)PLoS ONE1932-62032013-01-0182e5625910.1371/journal.pone.0056259Multi-scale clustering by building a robust and self correcting ultrametric topology on data points.Hsieh FushingHui WangKimberly VanderwaalBrenda McCowanPatrice KoehlThe advent of high-throughput technologies and the concurrent advances in information sciences have led to an explosion in size and complexity of the data sets collected in biological sciences. The biggest challenge today is to assimilate this wealth of information into a conceptual framework that will help us decipher biological functions. A large and complex collection of data, usually called a data cloud, naturally embeds multi-scale characteristics and features, generically termed geometry. Understanding this geometry is the foundation for extracting knowledge from data. We have developed a new methodology, called data cloud geometry-tree (DCG-tree), to resolve this challenge. This new procedure has two main features that are keys to its success. Firstly, it derives from the empirical similarity measurements a hierarchy of clustering configurations that captures the geometric structure of the data. This hierarchy is then transformed into an ultrametric space, which is then represented via an ultrametric tree or a Parisi matrix. Secondly, it has a built-in mechanism for self-correcting clustering membership across different tree levels. We have compared the trees generated with this new algorithm to equivalent trees derived with the standard Hierarchical Clustering method on simulated as well as real data clouds from fMRI brain connectivity studies, cancer genomics, giraffe social networks, and Lewis Carroll's Doublets network. In each of these cases, we have shown that the DCG trees are more robust and less sensitive to measurement errors, and that they provide a better quantification of the multi-scale geometric structures of the data. As such, DCG-tree is an effective tool for analyzing complex biological data sets.http://europepmc.org/articles/PMC3570468?pdf=render |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hsieh Fushing Hui Wang Kimberly Vanderwaal Brenda McCowan Patrice Koehl |
spellingShingle |
Hsieh Fushing Hui Wang Kimberly Vanderwaal Brenda McCowan Patrice Koehl Multi-scale clustering by building a robust and self correcting ultrametric topology on data points. PLoS ONE |
author_facet |
Hsieh Fushing Hui Wang Kimberly Vanderwaal Brenda McCowan Patrice Koehl |
author_sort |
Hsieh Fushing |
title |
Multi-scale clustering by building a robust and self correcting ultrametric topology on data points. |
title_short |
Multi-scale clustering by building a robust and self correcting ultrametric topology on data points. |
title_full |
Multi-scale clustering by building a robust and self correcting ultrametric topology on data points. |
title_fullStr |
Multi-scale clustering by building a robust and self correcting ultrametric topology on data points. |
title_full_unstemmed |
Multi-scale clustering by building a robust and self correcting ultrametric topology on data points. |
title_sort |
multi-scale clustering by building a robust and self correcting ultrametric topology on data points. |
publisher |
Public Library of Science (PLoS) |
series |
PLoS ONE |
issn |
1932-6203 |
publishDate |
2013-01-01 |
description |
The advent of high-throughput technologies and the concurrent advances in information sciences have led to an explosion in size and complexity of the data sets collected in biological sciences. The biggest challenge today is to assimilate this wealth of information into a conceptual framework that will help us decipher biological functions. A large and complex collection of data, usually called a data cloud, naturally embeds multi-scale characteristics and features, generically termed geometry. Understanding this geometry is the foundation for extracting knowledge from data. We have developed a new methodology, called data cloud geometry-tree (DCG-tree), to resolve this challenge. This new procedure has two main features that are keys to its success. Firstly, it derives from the empirical similarity measurements a hierarchy of clustering configurations that captures the geometric structure of the data. This hierarchy is then transformed into an ultrametric space, which is then represented via an ultrametric tree or a Parisi matrix. Secondly, it has a built-in mechanism for self-correcting clustering membership across different tree levels. We have compared the trees generated with this new algorithm to equivalent trees derived with the standard Hierarchical Clustering method on simulated as well as real data clouds from fMRI brain connectivity studies, cancer genomics, giraffe social networks, and Lewis Carroll's Doublets network. In each of these cases, we have shown that the DCG trees are more robust and less sensitive to measurement errors, and that they provide a better quantification of the multi-scale geometric structures of the data. As such, DCG-tree is an effective tool for analyzing complex biological data sets. |
url |
http://europepmc.org/articles/PMC3570468?pdf=render |
work_keys_str_mv |
AT hsiehfushing multiscaleclusteringbybuildingarobustandselfcorrectingultrametrictopologyondatapoints AT huiwang multiscaleclusteringbybuildingarobustandselfcorrectingultrametrictopologyondatapoints AT kimberlyvanderwaal multiscaleclusteringbybuildingarobustandselfcorrectingultrametrictopologyondatapoints AT brendamccowan multiscaleclusteringbybuildingarobustandselfcorrectingultrametrictopologyondatapoints AT patricekoehl multiscaleclusteringbybuildingarobustandselfcorrectingultrametrictopologyondatapoints |
_version_ |
1724965498447200256 |