Samih M. Mostafa^1,2,*

Journal on Artificial Intelligence, Vol.2, No.4, pp. 189-215, 2020, DOI:10.32604/jai.2020.014944

Abstract Because of the abundance of clustering methods, comparing between methods and determining which method is proper for a given dataset is crucial. Especially, the availability of huge experimental datasets and transactional and the emerging requirements for data mining and the like needs badly for clustering algorithms that can be applied in various domains. This paper presents essential notions of clustering and offers an overview of the significant features of the most common representative clustering algorithms of clustering categories presented in a comparative way. More specifically the study is based on the numerical type of the data that the algorithm supports,… More >

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 >

Tianyu Wang, Yu Xue, Yan Zhao, Yuxiang Wang^*, Yan Zhang, Yuxiang He

Journal of Information Hiding and Privacy Protection, Vol.2, No.3, pp. 135-142, 2020, DOI:10.32604/jihpp.2020.010362

Abstract In the field of data mining and machine learning, clustering is a typical issue which has been widely studied by many researchers, and lots of effective algorithms have been proposed, including K-means, fuzzy c-means (FCM) and DBSCAN. However, the traditional clustering methods are easily trapped into local optimum. Thus, many evolutionary-based clustering methods have been investigated. Considering the effectiveness of brain storm optimization (BSO) in increasing the diversity while the diversity optimization is performed, in this paper, we propose a new clustering model based on BSO to use the global ability of BSO. In our experiment, we apply the novel… More >

Guorong Cui, Hao Li, Yachuan Zhang, Rongjing Bu, Yan Kang^*, Jinyuan Li, Yang Hu

Journal of Quantum Computing, Vol.2, No.2, pp. 85-95, 2020, DOI:10.32604/jqc.2020.09717

Abstract The traditional K-means clustering algorithm is difficult to determine the cluster number, which is sensitive to the initialization of the clustering center and easy to fall into local optimum. This paper proposes a clustering algorithm based on self-organizing mapping network and weight particle swarm optimization SOM&WPSO (Self-Organization Map and Weight Particle Swarm Optimization). Firstly, the algorithm takes the competitive learning mechanism of a self-organizing mapping network to divide the data samples into coarse clusters and obtain the clustering center. Then, the obtained clustering center is used as the initialization parameter of the weight particle swarm optimization algorithm. The particle position… More >

Soukaina Mjahed^1,*, Khadija Bouzaachane¹, Ahmad Taher Azar^2,3, Salah El Hadaj¹, Said Raghay¹

CMES-Computer Modeling in Engineering & Sciences, Vol.125, No.2, pp. 459-494, 2020, DOI:10.32604/cmes.2020.010791

Abstract This paper focuses on the unsupervised detection of the Higgs boson particle using the most informative features and variables which characterize the “Higgs machine learning challenge 2014” data set. This unsupervised detection goes in this paper analysis through 4 steps: (1) selection of the most informative features from the considered data; (2) definition of the number of clusters based on the elbow criterion. The experimental results showed that the optimal number of clusters that group the considered data in an unsupervised manner corresponds to 2 clusters; (3) proposition of a new approach for hybridization of both hard and fuzzy clustering… More >

Lei Feng^1,2, Haibin Li^1,*, Yakun Gao¹, Yakun Zhang¹

Intelligent Automation & Soft Computing, Vol.26, No.4, pp. 831-839, 2020, DOI:10.32604/iasc.2020.010117

Abstract In the paper, we apply the sparse reconstruction algorithm of improved background dictionary to saliency detection. Firstly, after super-pixel segmentation, two bottom features are extracted: the color information of LAB and the texture features of the image by Gabor filter. Secondly, the convex hull theory is used to remove object region in boundary region, and K-means clustering algorithm is used to continue to simplify the background dictionary. Finally, the saliency map is obtained by calculating the reconstruction error. Compared with the mainstream algorithms, the accuracy and efficiency of this algorithm are better than those of other algorithms. More >

Parvathavarthini S^1,*, Karthikeyani Visalakshi N², Shanthi S³, Madhan Mohan J⁴

Intelligent Automation & Soft Computing, Vol.26, No.2, pp. 253-260, 2020, DOI:10.31209/2019.100000155

Abstract Intuitionistic fuzzy clustering allows the uncertainties in data to be represented more precisely. Medical data usually possess a high degree of uncertainty and serve as the right candidate to be represented as Intuitionistic fuzzy sets. However, the selection of initial centroids plays a crucial role in determining the resulting cluster structure. Crow search algorithm is hybridized with Intuitionistic fuzzy C-means to attain better results than the existing hybrid algorithms. Still, the performance of the algorithm needs improvement with respect to the objective function and cluster indices especially with internal indices. In order to address these issues, the crow search algorithm… More >

U. Kanimozhi, D. Manjula

Intelligent Automation & Soft Computing, Vol.24, No.4, pp. 701-709, 2018, DOI:10.1080/10798587.2017.1307626

Abstract We are witnessing the era of big data computing where computing the resources is becoming the main bottleneck to deal with those large datasets. In the case of high-dimensional data where each view of data is of high dimensionality, feature selection is necessary for further improving the clustering and classification results. In this paper, we propose a new feature selection method, Incremental Filtering Feature Selection (IF2S) algorithm, and a new clustering algorithm, Temporal Interval based Fuzzy Minimal Clustering (TIFMC) algorithm that employs the Fuzzy Rough Set for selecting optimal subset of features and for effective grouping of large volumes of… More >

Yu Jiang^{1, 2}, Dengwen Yu¹, Mingzhao Zhao^{1, 2}, Hongtao Bai^{1, 2}, Chong Wang^{1, 2, 3}, Lili He^{1, 2, *}

CMC-Computers, Materials & Continua, Vol.64, No.1, pp. 207-216, 2020, DOI:10.32604/cmc.2020.09861

Abstract Semi-supervised clustering improves learning performance as long as it uses a small number of labeled samples to assist un-tagged samples for learning. This paper implements and compares unsupervised and semi-supervised clustering analysis of BOAArgo ocean text data. Unsupervised K-Means and Affinity Propagation (AP) are two classical clustering algorithms. The Election-AP algorithm is proposed to handle the final cluster number in AP clustering as it has proved to be difficult to control in a suitable range. Semi-supervised samples thermocline data in the BOA-Argo dataset according to the thermocline standard definition, and use this data for semi-supervised cluster analysis. Several semi-supervised clustering… More >

Abeer I. Alhujaylan^{1, 2, *}, Manar I. Hosny¹

CMC-Computers, Materials & Continua, Vol.62, No.3, pp. 1025-1051, 2020, DOI:10.32604/cmc.2020.08742

Abstract Mobile commerce (m-commerce) contributes to increasing the popularity of electronic commerce (e-commerce), allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time. As demand for e-commerce increases tremendously, the pressure on delivery companies increases to organise their transportation plans to achieve profits and customer satisfaction. One important planning problem in this domain is the multi-vehicle profitable pickup and delivery problem (MVPPDP), where a selected set of pickup and delivery customers need to be served within certain allowed trip time. In this paper, we proposed hybrid clustering algorithms with the greedy randomised adaptive… More >