A Comprehensive Comparison of Different Clustering Methods for Reliability Analysis of Microarray Data

In this study, we considered some competitive learning methods including hard competitive learning and soft competitive learning with/without fixed network dimensionality for reliability analysis in microarrays. in order to have a more extensive view, and keeping in mind that competitive learning methods aim at error minimization or entropy maximization (different kinds of function optimization), we decided to investigate the abilities of mixture decomposition schemes. therefore, we assert that this study covers the algorithms based on function optimization with particular insistence on different competitive learning methods. the destination is finding the most powerful method according to a pre‑specified criterion determined with numerical methods and matrix similarity measures. furthermore, we should provide an indication showing the intrinsic ability of the dataset to form clusters before we apply a clustering algorithm. therefore, we proposed hopkins statistic as a method for finding the intrinsic ability of a data to be clustered. the results show the remarkable ability of rayleigh mixture model in comparison with other methods in reliability analysis task.