Sciweavers

2034 search results - page 13 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
ICPR
2008
IEEE
14 years 9 months ago
Time-series clustering by approximate prototypes
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
Pasi Fränti, Pekka Nykänen, Ville Hautam...
PRL
2010
188views more  PRL 2010»
13 years 2 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
APBC
2003
13 years 9 months ago
Microarray Image Processing Based on Clustering and Morphological Analysis
Microarrays allow the monitoring of expressions for tens of thousands of genes simultaneously. Image analysis is an important aspect for microarray experiments that can affect sub...
Shuanhu Wu, Hong Yan
BMCBI
2007
237views more  BMCBI 2007»
13 years 7 months ago
FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data
Background: Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing cluster...
Limin Fu, Enzo Medico
ICTAI
2006
IEEE
14 years 1 months ago
Minimum Spanning Tree Based Clustering Algorithms
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
Oleksandr Grygorash, Yan Zhou, Zach Jorgensen