The well known fuzzy partition clustering algorithms are most based on Euclidean distance function, which can only be used to detect spherical structural clusters. Gustafson-Kessel (GK) clustering algorithm and Gath-Geva (GG) clustering algorithm, were developed to detect non-spherical structural clusters, but both of them based on semi-supervised Mahalanobis distance needed additional prior in...

In molecular biology, the issue of quantifying the similarity between two biological sequences is very important. Past research has shown that word-based search tools are computationally efficient and can find some new functional similarities or dissimilarities invisible to other algorithms like FASTA. Recently, under the independent model of base composition, Wu, Burke, and Davison (1997, Biom...

Article history: Received 7 October 2007 Received in revised form 27 February 2008 Accepted 16 May 2008

Some of the well-known fuzzy clustering algorithms are based on Euclidean distance function, which can only be used to detect spherical structural clusters. Gustafson-Kessel clustering algorithm and Gath-Geva clustering algorithm were developed to detect non-spherical structural clusters. However, the former needs added constraint of fuzzy covariance matrix, the later can only be used for the d...

This paper discusses the application of the newly developed Mahalanobis distance-based ARTMAP (MART) network to the predication of sickle cell anemia patients’ response to Hydroxyurea treatment. Mahalanobis distance-based ARTMAP is a modified version of the Fuzzy ARTMAP networks where the activation and choice function are the same and equal to the Mahalanobis distance between the pattern and t...