A Simpler and More Accurate AUTO-HDS Framework for Clustering and Visualization of Biological Data

Authors:
Ricardo J. G. B. Campello;Davoud Moulavi;Joerg Sander
Affiliations:
University of Alberta, Edmonton and University of Sao Paulo at Sao Carlos;University of Alberta, Edmonton;University of Alberta, Edmonton
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2012

Citing 8
Cited 0

Algorithms for clustering data

Algorithms for clustering data
OPTICS: ordering points to identify the clustering structure

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Hierarchical Density Shaving: A clustering and visualization framework for large biological datasets

ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
DECODE: a new method for discovering clusters of different densities in spatial data

Data Mining and Knowledge Discovery
Semi-supervised Density-Based Clustering

ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
Automatic extraction of clusters from hierarchical clustering representations

PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Automated Hierarchical Density Shaving: A Robust Automated Clustering and Visualization Framework for Large Biological Data Sets

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration

ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [CHECK END OF SENTENCE], the authors proposed a framework for automated clustering and visualization of biological data sets named AUTO-HDS. This letter is intended to complement that framework by showing that it is possible to get rid of a user-defined parameter in a way that the clustering stage can be implemented more accurately while having reduced computational complexity