Hachemi Bennaceur, Meznah Almutairy, Norah Alhussain^*

Intelligent Automation & Soft Computing, Vol.37, No.3, pp. 2687-2706, 2023, DOI:10.32604/iasc.2023.038723

Abstract The dimensionality of data is increasing very rapidly, which creates challenges for most of the current mining and learning algorithms, such as large memory requirements and high computational costs. The literature includes much research on feature selection for supervised learning. However, feature selection for unsupervised learning has only recently been studied. Finding the subset of features in unsupervised learning that enhances the performance is challenging since the clusters are indeterminate. This work proposes a hybrid technique for unsupervised feature selection called GAk-MEANS, which combines the genetic algorithm (GA) approach with the classical k-Means algorithm. In the proposed algorithm, a new… More >

Bilal Bataineh^*, Ahmad A. Alzahrani

CMC-Computers, Materials & Continua, Vol.76, No.2, pp. 1833-1851, 2023, DOI:10.32604/cmc.2023.039923

Abstract Cluster analysis is a crucial technique in unsupervised machine learning, pattern recognition, and data analysis. However, current clustering algorithms suffer from the need for manual determination of parameter values, low accuracy, and inconsistent performance concerning data size and structure. To address these challenges, a novel clustering algorithm called the fully automated density-based clustering method (FADBC) is proposed. The FADBC method consists of two stages: parameter selection and cluster extraction. In the first stage, a proposed method extracts optimal parameters for the dataset, including the epsilon size and a minimum number of points thresholds. These parameters are then used in a… More >

Jiahao Zhang, Honglin Wang^*

CMC-Computers, Materials & Continua, Vol.76, No.2, pp. 2427-2441, 2023, DOI:10.32604/cmc.2023.038462

Abstract With the rapid development of technology, processing the explosive growth of meteorological data on traditional standalone computing has become increasingly time-consuming, which cannot meet the demands of scientific research and business. Therefore, this paper proposes the implementation of the parallel Clustering Large Application based upon RANdomized Search (CLARANS) clustering algorithm on the Spark cloud computing platform to cluster China’s climate regions using meteorological data from 1988 to 2018. The aim is to address the challenge of applying clustering algorithms to large datasets. In this paper, the morphological similarity distance is adopted as the similarity measurement standard instead of Euclidean distance,… More >

Lei Ling¹, Lijun Huang², Jie Wang², Li Zhang², Yue Wu², Yizhang Jiang¹, Kaijian Xia^2,3,*

CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.3, pp. 2353-2379, 2023, DOI:10.32604/cmes.2023.028828

Abstract In recent years, the soft subspace clustering algorithm has shown good results for high-dimensional data, which can assign different weights to each cluster class and use weights to measure the contribution of each dimension in various features. The enhanced soft subspace clustering algorithm combines interclass separation and intraclass tightness information, which has strong results for image segmentation, but the clustering algorithm is vulnerable to noisy data and dependence on the initialized clustering center. However, the clustering algorithm is susceptible to the influence of noisy data and reliance on initialized clustering centers and falls into a local optimum; the clustering effect… More >

Mona Jamjoom¹, Ahmed Elhadad², Hussein Abulkasim^3,*, Safia Abbas⁴

CMC-Computers, Materials & Continua, Vol.76, No.1, pp. 367-382, 2023, DOI:10.32604/cmc.2023.037310

Abstract Several pests feed on leaves, stems, bases, and the entire plant, causing plant illnesses. As a result, it is vital to identify and eliminate the disease before causing any damage to plants. Manually detecting plant disease and treating it is pretty challenging in this period. Image processing is employed to detect plant disease since it requires much effort and an extended processing period. The main goal of this study is to discover the disease that affects the plants by creating an image processing system that can recognize and classify four different forms of plant diseases, including Phytophthora infestans, Fusarium graminearum,… More >

Sami Saeed Binyamin¹, Mahmoud Ragab^2,*

Computer Systems Science and Engineering, Vol.47, No.1, pp. 105-119, 2023, DOI:10.32604/csse.2023.037311

Abstract Cognitive radio wireless sensor networks (CRWSN) can be defined as a promising technology for developing bandwidth-limited applications. CRWSN is widely utilized by future Internet of Things (IoT) applications. Since a promising technology, Cognitive Radio (CR) can be modelled to alleviate the spectrum scarcity issue. Generally, CRWSN has cognitive radio-enabled sensor nodes (SNs), which are energy limited. Hierarchical cluster-related techniques for overall network management can be suitable for the scalability and stability of the network. This paper focuses on designing the Modified Dwarf Mongoose Optimization Enabled Energy Aware Clustering (MDMO-EAC) Scheme for CRWSN. The MDMO-EAC technique mainly intends to group the… More >

Mohammed Altaf Ahmed¹, T. Satyanarayana Murthy², Fayadh Alenezi³, E. Laxmi Lydia⁴, Seifedine Kadry^5,6,7, Yena Kim⁸, Yunyoung Nam^8,*

Computer Systems Science and Engineering, Vol.47, No.1, pp. 1283-1297, 2023, DOI:10.32604/csse.2023.035786

Abstract Wireless Sensor Networks (WSN) play a vital role in several real-time applications ranging from military to civilian. Despite the benefits of WSN, energy efficiency becomes a major part of the challenging issue in WSN, which necessitate proper load balancing amongst the clusters and serves a wider monitoring region. The clustering technique for WSN has several benefits: lower delay, higher energy efficiency, and collision avoidance. But clustering protocol has several challenges. In a large-scale network, cluster-based protocols mainly adapt multi-hop routing to save energy, leading to hot spot problems. A hot spot problem becomes a problem where a cluster node nearer… More >

Clément Chagnaud^1,3, Philippe Garat², Paule-Annick Davoine^1,3, Guylaine Brun-Trigaud⁴

Revue Internationale de Géomatique, Vol.30, No.1, pp. 67-83, 2020, DOI:10.3166/rig.2020.00107

Abstract We propose a multidimensional statistical analysis procedure using projection and classification methods, in order to identify coherent clusters into a set of surficial entities called dispersion areas. The methodology includes a geographical factor to build the representation space for the projection of the data. By applying this method on geolinguistic data, we are able to identify and explain new spatial patterns among a set of dispersion areas of linguistic features.

RÉSUMÉ
Nous proposons une procédure d’analyse statistique multidimensionnelle couplant des méthodes de projection et de classification pour identifier des ensembles cohérents au sein d’un corpus d’entités géographiques surfaciques que l’on… More >

Xiong Xu¹, Chun Zhou^2,*, Chenggang Wang¹, Xiaoyan Zhang², Hua Meng²

Intelligent Automation & Soft Computing, Vol.37, No.1, pp. 815-831, 2023, DOI:10.32604/iasc.2023.034656

Abstract Clustering analysis is one of the main concerns in data mining. A common approach to the clustering process is to bring together points that are close to each other and separate points that are away from each other. Therefore, measuring the distance between sample points is crucial to the effectiveness of clustering. Filtering features by label information and measuring the distance between samples by these features is a common supervised learning method to reconstruct distance metric. However, in many application scenarios, it is very expensive to obtain a large number of labeled samples. In this paper, to solve the clustering… More >

Zhe Yuan^*, Zhewei Wei, Ji-rong Wen

CMC-Computers, Materials & Continua, Vol.75, No.3, pp. 5009-5026, 2023, DOI:10.32604/cmc.2023.038531

Abstract Motif-based graph local clustering (MGLC) algorithms are generally designed with the two-phase framework, which gets the motif weight for each edge beforehand and then conducts the local clustering algorithm on the weighted graph to output the result. Despite correctness, this framework brings limitations on both practical and theoretical aspects and is less applicable in real interactive situations. This research develops a purely local and index-adaptive method, Index-adaptive Triangle-based Graph Local Clustering (TGLC+), to solve the MGLC problem w.r.t. triangle. TGLC+ combines the approximated Monte-Carlo method Triangle-based Random Walk (TRW) and deterministic Brute-Force method Triangle-based Forward Push (TFP) adaptively to estimate… More >