Complexity (Jan 2018)
Stroke Subtype Clustering by Multifractal Bayesian Denoising with Fuzzy C Means and K-Means Algorithms
Abstract
Multifractal denoising techniques capture interest in biomedicine, economy, and signal and image processing. Regarding stroke data there are subtle details not easily detectable by eye physicians. For the stroke subtypes diagnosis, details are important due to including hidden information concerning the possible existence of medical history, laboratory results, and treatment details. Recently, K-means and fuzzy C means (FCM) algorithms have been applied in literature with many datasets. We present efficient clustering algorithms to eliminate irregularities for a given set of stroke dataset using 2D multifractal denoising techniques (Bayesian (mBd), Nonlinear (mNold), and Pumping (mPumpD)). Contrary to previous methods, our method embraces the following assets: (a) not applying the reduction of the stroke datasets’ attributes, leading to an efficient clustering comparison of stroke subtypes with the resulting attributes; (b) detecting attributes that eliminate “insignificant” irregularities while keeping “meaningful” singularities; (c) yielding successful clustering accuracy performance for enhancing stroke data qualities. Therefore, our study is a comprehensive comparative study with stroke datasets obtained from 2D multifractal denoised techniques applied for K-means and FCM clustering algorithms. Having been done for the first time in literature, 2D mBd technique, as revealed by results, is the most successful feature descriptor in each stroke subtype dataset regarding the mentioned algorithms’ accuracy rates.