Yunping Zhao¹, Weixuan Liang¹, Jianzhuang Lu^1,*, Xiaowen Chen¹, Nijiwa Kong²

CMC-Computers, Materials & Continua, Vol.66, No.3, pp. 2709-2722, 2021, DOI:10.32604/cmc.2021.013389

Abstract Late fusion multi-view clustering (LFMVC) algorithms aim to integrate the base partition of each single view into a consensus partition. Base partitions can be obtained by performing kernel k-means clustering on all views. This type of method is not only computationally efficient, but also more accurate than multiple kernel k-means, and is thus widely used in the multi-view clustering context. LFMVC improves computational efficiency to the extent that the computational complexity of each iteration is reduced from O(n³) to O(n) (where n is the number of samples). However, LFMVC also limits the search space of the optimal solution, meaning that… More >

Ahmed A. M. Jamel^1,∗, Bahriye Akay^2,†

Computer Systems Science and Engineering, Vol.35, No.6, pp. 441-456, 2020, DOI:10.32604/csse.2020.35.441

Abstract Recently, owing to the capability of mobile and wearable devices to sense daily human activity, human activity recognition (HAR) datasets have become a large-scale data resource. Due to the heterogeneity and nonlinearly separable nature of the data recorded by these sensors, the datasets generated require special techniques to accurately predict human activity and mitigate the considerable heterogeneity. Consequently, classic clustering algorithms do not work well with these data. Hence, kernelization, which converts the data into a new feature vector representation, is performed on nonlinearly separable data. This study aims to present a robust method to perform HAR data clustering to… More >