Sudan Jha¹, Gyanendra Prasad Joshi², Lewis Nkenyereya³, Dae Wan Kim^{4, *}, Florentin Smarandache⁵

CMC-Computers, Materials & Continua, Vol.65, No.2, pp. 1203-1220, 2020, DOI:10.32604/cmc.2020.011618 - 20 August 2020

Abstract Raw data are classified using clustering techniques in a reasonable manner to create disjoint clusters. A lot of clustering algorithms based on specific parameters have been proposed to access a high volume of datasets. This paper focuses on cluster analysis based on neutrosophic set implication, i.e., a k-means algorithm with a threshold-based clustering technique. This algorithm addresses the shortcomings of the k-means clustering algorithm by overcoming the limitations of the threshold-based clustering algorithm. To evaluate the validity of the proposed method, several validity measures and validity indices are applied to the Iris dataset (from the University More >

Lianggui Liu^1,*, Wei Li¹, Huiling Jia¹

CMC-Computers, Materials & Continua, Vol.57, No.1, pp. 97-106, 2018, DOI:10.32604/cmc.2018.03511

Abstract With the rapid development of mobile communication all over the world, the similarity of mobile phone communication data has received widely attention due to its advantage for the construction of smart cities. Mobile phone communication data can be regarded as a type of time series and dynamic time warping (DTW) and derivative dynamic time warping (DDTW) are usually used to analyze the similarity of these data. However, many traditional methods only calculate the distance between time series while neglecting the shape characteristics of time series. In this paper, a novel hybrid method based on the More >