International audienceThe actual clustering methods of directional data are commonly performed in considering data belonging to the unit radius sphere. In certain situations, assuming that the radius equal to one is not appropriated. In this work we propose to estimate it to be greater than one. We then suggest to apply a normalized EM algorithm and derive different variants. This procedure has shown an important influence on the clustering results of gene expression data
Abstract — In this paper we show that the normalized compression distance can be applied to gene exp...
Subspace clustering is increasingly recognized as a useful and accurate alternative to conventional ...
This work deals with the problem of automatically finding optimal partitions in bioinformatics datas...
Clustering genes into groups that exhibit similar expression patterns is one of the most fundamental...
Normalization before clustering is often needed for proximity indices, such as Euclidian distance, w...
Microarray data clustering represents a basic exploratory tool to find groups of genes exhibiting si...
Motivation: Microarray experiments generate a considerable amount of data, which analyzed properly h...
Abstract: Clustering is the classification of objects into different groups, or more precisely, the ...
Abstract. Motivation: Many clustering algorithms have been proposed for the analysis of gene expr...
Background The search for cluster structure in microarray datasets is a base problem for the so-cal...
Abstract Background Cluster analysis is an integral part of high dimensional data analysis. In the c...
Clustering methods are used to place items in natural patterns or convenient groups. They can be use...
A k-means-type algorithm is proposed for efficiently clustering data constrained to lie on the surfa...
The density-based spatial clustering for applications with noise (DBSCAN) is one of the most popular...
Gene expression data hide vital information required to understand the biological process that takes...
Abstract — In this paper we show that the normalized compression distance can be applied to gene exp...
Subspace clustering is increasingly recognized as a useful and accurate alternative to conventional ...
This work deals with the problem of automatically finding optimal partitions in bioinformatics datas...
Clustering genes into groups that exhibit similar expression patterns is one of the most fundamental...
Normalization before clustering is often needed for proximity indices, such as Euclidian distance, w...
Microarray data clustering represents a basic exploratory tool to find groups of genes exhibiting si...
Motivation: Microarray experiments generate a considerable amount of data, which analyzed properly h...
Abstract: Clustering is the classification of objects into different groups, or more precisely, the ...
Abstract. Motivation: Many clustering algorithms have been proposed for the analysis of gene expr...
Background The search for cluster structure in microarray datasets is a base problem for the so-cal...
Abstract Background Cluster analysis is an integral part of high dimensional data analysis. In the c...
Clustering methods are used to place items in natural patterns or convenient groups. They can be use...
A k-means-type algorithm is proposed for efficiently clustering data constrained to lie on the surfa...
The density-based spatial clustering for applications with noise (DBSCAN) is one of the most popular...
Gene expression data hide vital information required to understand the biological process that takes...
Abstract — In this paper we show that the normalized compression distance can be applied to gene exp...
Subspace clustering is increasingly recognized as a useful and accurate alternative to conventional ...
This work deals with the problem of automatically finding optimal partitions in bioinformatics datas...