766 search results - page 66 / 154 » Clustering high dimensional data using subspace and projecte... |
SDM
2011
SIAM
12 years 11 months ago
2011
SIAM
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
CCECE
2009
IEEE
14 years 1 months ago
2009
IEEE
The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the...
BMCBI
2002
13 years 8 months ago
2002
Background: A method to evaluate and analyze the massive data generated by series of microarray experiments is of utmost importance to reveal the hidden patterns of gene expressio...
ISPA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. There exist numerous algorithms that cluster data-points from largescale genomic experiments such as sequencing, gene-expression and proteomics. Such algorithms may emplo...