Sciweavers

1013 search results - page 81 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
GFKL
2005
Springer
141views Data Mining» more  GFKL 2005»
15 years 11 months ago
On External Indices for Mixtures: Validating Mixtures of Genes
Mixture models represent results of gene expression cluster analysis in a more natural way than ’hard’ partitions. This is also true for the representation of gene labels, such...
Ivan G. Costa, Alexander Schliep
AP2PC
2003
Springer
15 years 11 months ago
Group Formation Among Peer-to-Peer Agents: Learning Group Characteristics
This paper examines the decentralized formation of groups within a peer-to-peer multi-agent system. More specifically, it frames group formation as a clustering problem, and exami...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...
BIOCOMP
2008
15 years 7 months ago
Identifying Protein Flexibility by NMA
- Here proposed apriori method for identification of protein flexibility relies on one end-state conformation of the protein. This method has comparative advantage over many others...
Kresimir Sikic, Branko Jeren, Sanja Tomic
KAIS
2006
126views more  KAIS 2006»
15 years 6 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
BCB
2010
138views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Comparative analysis of biclustering algorithms
Biclustering is a very popular method to identify hidden co-regulation patterns among genes. There are numerous biclustering algorithms designed to undertake this challenging task...
Doruk Bozdag, Ashwin S. Kumar, Ümit V. &Ccedi...