Clustering is a very useful technique which helps to enrich the semantics of the data by revealing patterns in large collections of poly-dimensional data. Moreover the fuzzy approach in clustering provides flexibility and enhanced modeling capability, as the results are expressed in soft clusters, allowing partial memberships of data points in the clusters. During the last decade, the digitaliz...

Many attempts have been made to effectively improve a prosthetic system controlled by the classification of surface electromyographic (SEMG) signals. Recently, the development of methodologies to extract the effective features still remains a primary challenge. Previous studies have demonstrated that the SEMG signals have nonlinear characteristics. In this study, by combining the nonlinear time...

The segmentation performance of any clustering algorithm is very sensitive to the features in an image, which ultimately restricts their generalisation capability. This limitation was the primary motivation in our investigation into using shape information to improve the generality of these algorithms. Fuzzy shape-based clustering techniques already consider ring and elliptical profiles in segm...

In this study, we present a comprehensive comparative analysis of kernel-based fuzzy clustering and fuzzy clustering. Kernel based clustering has emerged as an interesting and quite visible alternative in fuzzy clustering, however, the effectiveness of this extension vis-à-vis some generic methods of fuzzy clustering has neither been discussed in a complete manner nor the performance of cluster...

The paper presents a simple derivation of the Gustafson-Barsis law from the Amdahl's law. In the computer literature these two laws describing the speedup limits of parallel applications are derived separately. It is shown, that treating the time of the execution of the sequential part of the application as a constant, in few lines the Gustafson-Barsis law can be obtained from the Amdahl's law ...

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...