Technique for Kernel Matching Pursuit Based on Intuitionistic Fuzzy c-Means Clustering

Abstract

Kernel matching pursuit (KMP) requires every step of the searching process to be global optimal searching in the redundant dictionary of functions in order to select the best matching signal structure. Namely, the dictionary learning time of KMP is too long. To solve the above drawbacks, a rough dataset was divided into some small-sized dictionaries to substitute local searching for global searching by using the property superiority of dynamic clustering performance, which is also superior in the intuitionistic fuzzy c-means (IFCM) algorithm. Then, we proposed a novel technique for KMP based on IFCM (IFCM-KMP). Subsequently, three tests including classification, effectiveness, and time complexity were carried out on four practical sample datasets, the conclusions of which fully demonstrate that the IFCM-KMP algorithm is superior to FCM and KMP.