Optimization Clustering Algorithm Research Articles

Application of nonlinear clustering optimization algorithm in web data mining of cloud computing

Abstract To improve data mining and data clustering performance to improve the efficiency of the cloud computing platform, the author proposes a bionic optimized clustering data extraction algorithm based on cloud computing platform. According to the Gaussian distribution function graph, the degree of aggregation of the categories and the distribution of data points of the same category can be judged more intuitively. The cloud computing platform has the characteristics of large amount of data and high dimension. In the process of solving the distance between all sample points and the center point, after each center point update, the optimization function needs to be re-executed, the author mainly uses clustering evaluation methods such as PBM-index and DB-index. The simulation data object is the Iris dataset in UCI, and N = 500 samples are selected for simulation. The experiment result shows that when P is not greater than 15, the PBM value changes very little, and when P = 20, the PBM performance of all the four clustering algorithms decreased significantly. When the sample size is increased from 50,000 to 100,000, the DB performance of this algorithm does not change much, and the DB value tends to be stable. In terms of clustering operation time, the K-means algorithm has obvious advantages, the DBSCAN algorithm is the most time-consuming, and the operation time of wolf pack clustering and Mean-shift is in the middle. In the actual application process, the number of samples for each training can be dynamically adjusted according to the actual needs, in order to improve the applicability of the wolf pack clustering algorithm in specific application scenarios. Flattening in cloud computing for data clusters, this algorithm is compared with the common clustering algorithm in PBM. DB also shows better performance.

Efficient optimization algorithms for various machine learning tasks, including classification, regression, and clustering

The research on efficient optimization algorithms for machine learning is novel because it addresses several gaps in previous research and proposes new solutions to improve the efficiency and accuracy of machine learning models. Firstly, the proposed research focuses on developing more efficient algorithms for large-scale deep learning. While there have been many optimization algorithms proposed for deep learning, the proposed research aims to develop new algorithms that can handle the complexity and scale of these models and improve their efficiency. Secondly, the proposed research aims to explore the effectiveness of optimization algorithms for different types of machine learning tasks. While many studies have focused on deep learning, the proposed research aims to evaluate the effectiveness of optimization algorithms for other types of machine learning tasks, such as reinforcement learning, unsupervised learning, and semi-supervised learning. Thirdly, the proposed research aims to develop optimization algorithms that can handle noisy and incomplete data, which is a significant challenge for machine learning models. The proposed research aims to develop algorithms that can handle noisy and incomplete data and improve the accuracy of machine learning models. Fourthly, the proposed research aims to develop optimization algorithms that can handle non-convex objective functions. While some optimization techniques have been proposed for non-convex optimization, the proposed research aims to develop new algorithms that can handle these functions and improve the accuracy of machine learning models. The proposed research aims to investigate the trade-off between optimization efficiency and model performance. While previous research has explored this trade-off to some extent, the proposed research aims to develop algorithms that can balance these factors and optimize both efficiency and performance. The proposed research is novel because it addresses several gaps in previous research and proposes new solutions to improve the efficiency and accuracy of machine learning models for various tasks, including classification, regression, and clustering. By developing new algorithms and evaluating their effectiveness for different types of machine learning tasks, the proposed research can advance the field of machine learning and improve the accuracy and efficiency of machine learning models.

Optimal Learning Paradigm and Clustering for Effective Radio Resource Management in 5G HetNets

Ultra-dense heterogeneous networks (UDHN) based on small cells are a requisite part of the future cellular networks as they are proposed as one of the enabling technologies to handle coverage and capacity problems. But co-tier and cross-tier interferences in UDHN severely degrade the quality of service due to K-tiered architecture. Machine learning based radio resource management either through independent learning or cooperative learning is a proven efficient scheme for interference mitigation and quality of service provision in UDHN in a both distributive and cooperative manner. However, an optimal learning paradigm selection, i.e., either independent or cooperative learning and optimal cooperative cluster size in cooperative learning for efficient radio resource management in UDHN is still an open research problem. In this article, a Q-learning based radio resource management scheme is proposed and evaluated for both distributive and cooperative schemes using independent and cooperative learning. The proposed Q-learning solution follows the ϵ-greedy policy for optimal convergence. The simulation results for the UDHN in an urban setup show that in comparison to the independent learning paradigm, cooperative learning has no significant impact on macro cell user capacity. However, there is a significant improvement in small cell user capacity and the sum capacity of the cooperating small cells in the cluster. A significant increase of 48.57% and 37.9% is observed in the small cell user capacity, and sum capacity of the cooperating small cells, respectively, using cooperative learning as compared to independent learning which sets cooperative learning as an optimal learning strategy in UDHN. The improvement in small cell user capacity is at cost of increased computational time which is directly proportional to the number of cooperating small cells. To solve the issue of computational time in cooperative learning, an optimal clustering algorithm is proposed. The proposed optimal clustering reduced the computational time by four times in cooperative Q-learning.

Enhancing the job scheduling procedure to develop an efficient cloud environment using near optimal clustering algorithm

In this internet era, cloud computing and there are various problems in the cloud computing, where the consumers as well as the service providers facing in their day to day cloud activities. Job scheduling problem plays a vital role in the cloud environment. To provide an efficient job scheduling environment, it is necessary to perform efficient resource clustering. In this regard, the proposed system, concentrated on the resource clustering methodology by proposing an efficient resource clustering algorithm named identicalness split up periodic node size (ISPNS) in the cloud environment. The algorithm proposed helps in forming resource clusters with the help of cloud environment. The proposed system is compared with the existing systems to justify the performance of the proposed resource clustering algorithm and it produces near optimal solution for the resource clustering problem which helps to provide an efficient job scheduling in cloud environment.

Opposition Learning Based Improved Bee Colony Optimization (OLIBCO) Algorithm for Data Clustering

Opposition Learning Based Improved Bee Colony Optimization (OLIBCO) Algorithm for Data Clustering

Data survivability in unattended wireless sensor networks with optimal clustering and hybrid encryption algorithm

Data survivability in unattended wireless sensor networks with optimal clustering and hybrid encryption algorithm

Blockchain-IOT Based Secure Data Sharing for Precision Agriculture with Optimal Clustering and Hybrid Encryption Algorithm

Blockchain-IOT Based Secure Data Sharing for Precision Agriculture with Optimal Clustering and Hybrid Encryption Algorithm

Coverage hole aware optimal cluster based routing for wireless sensor network assisted IoT using hybrid deep recurrent neural network

SummaryNowadays, the wireless sensor network (WSN) with IoT is intended to monitor real‐world physical or environmental phenomena in a number of applications, including foreign areas such as health and habitat monitoring. The WSN‐IoT network generates huge volume of data, which has to be processed and accessed by the remote users. Due to this large volume of data generation and resource constraint ability make achieving optimal cluster based routing in WSN‐IoT. The location of the sensor nodes significantly affects the accuracy of the information collected, which determines the quality of service provided by the application system. WSN can have multiple conflicts, which can create different coverage holes. These holes will break the existing overlap or connection and affect the required operation of the networks. Therefore, it is essential to find and repair the coverage holes to ensure the full functioning of the WSN as a motivation of this study. In this paper, we suggest a novel Coverage Hole aware Optimal Cluster based Routing (CHOCR) scheme for WSN‐IoT. First, we propose Modified Lichtenberg optimization (MLO) algorithm for balanced clustering which improve the performance of coverage hole. Second, we develop a linear equilibrium optimization based decision making (LEO‐DM) technique to subtract trust value of each IoT node using multiple restraints in cluster and consider the highest trusted node is act as cluster head (CH). After that, a hybrid deep recurrent neural network (HD‐RNN) is developed for intermediate node selection to frame the routing between two nodes. Finally, we simulate our proposed CHOCR scheme on the NS3.26 simulator. According to energy consumption, network longevity, number of nodes that are still alive and packet delivery ratio, packet loss ratio and throughput, end‐to‐end latency and delay of our proposed CHOCR routing system, we compare it to other current routing schemes.

Financial Market Correlation Analysis and Stock Selection Application Based on TCN-Deep Clustering

It is meaningful to analyze the market correlations for stock selection in the field of financial investment. Since it is difficult for existing deep clustering methods to mine the complex and nonlinear features contained in financial time series, in order to deeply mine the features of financial time series and achieve clustering, a new end-to-end deep clustering method for financial time series is proposed. It contains two modules: an autoencoder feature extraction network based on TCN (temporal convolutional neural) networks and a temporal clustering optimization algorithm with a KL (Kullback–Leibler) divergence. The features of financial time series are represented by the causal convolution and the dilated convolution of TCN networks. Then, the pre-training results based on the KL divergence are fine-tuned to make the clustering results discriminative. The experimental results show that the proposed method outperforms existing deep clustering and general clustering algorithms in the CSI 300 and S&P 500 index markets. In addition, the clustering results combined with an inference strategy can be used to select stocks that perform well or poorly, thus guiding actual stock market trades.

An Intelligent Harris Hawks Optimization Based Cluster Optimization Scheme for VANETs

In recent years, intelligent vehicles with cutting-edge vehicular applications have grown in popularity, enabling the growth of Vehicular Ad hoc Networks (VANETs). Vehicular Ad hoc Networks (VANETs) are a network of vehicles that share and analyze real-time data and require a well-organized and efficient data delivery method. The stability of clusters and dynamic topology change in VANETs are the major issues in finding an optimal route amongst the vehicles. The cooperative approach and surprise pounce chasing technique of Harris Hawks in nature serve as the main sources of inspiration for Harris Hawks Optimization. In this technique, several hawks work together to attack a victim from various angles to surprise it. Due to the unpredictable nature of situations and the prey’s fleeing movements, Harris Hawks can exhibit a variety of intelligent strategies. This study proposes a novel route clustering optimization technique that takes into account communication range, the number of nodes, velocity, orientations, and grid size. To create and evaluate ideal cluster head (CH), the proposed method is based on Harris Hawks Intelligent Optimization Algorithm for route Clustering (iCHHO) which finds optimal and reliable routes amongst the vehicles. Other state-of-the-art methods, such as the Grasshopper Optimization Algorithm (GOA), Gray Wolf Optimization (GWO), and Whale Optimization Algorithm (WOACNET), are utilized to evaluate and validate the proposed method. Our findings show that the developed method outperforms other current methods in terms of number of clusters, variable communication ranges, network size, and the number of vehicles. Furthermore, the statistical analysis concludes that the proposed method improves cluster optimization by 79% and increases cluster stability by an adjusted R -squared of 91.22.

Soft Computing Techniques Aware Clustering-Based Routing Protocols in Vehicular Ad Hoc Networks: A Review

The vehicular ad hoc network is an emerging area of technology that provides intelligent transportation systems with vast advantages and applications. Frequent disconnections between the vehicular nodes due to high-velocity vehicles impact network performance. This can be addressed by efficient clustering techniques. Several recent studies have attempted to develop optimal clustering algorithms to improve network performance metrics using soft computing techniques. Although sufficient work on soft computing techniques has been carried out, it seems less commonplace to find an analysis of various algorithms’ network parameters together. This paper provides a systematic analysis of the clustering-based routing protocols used in vehicular networks that are aware of soft computing techniques. The categorization is performed according to various soft computing techniques: particle swarm optimization, k-means, neural networks, artificial bee colony, genetic algorithm, firefly algorithm, and fuzzy logic. A comparative study of soft computing strategies is also provided in the survey with a focus on their objectives, along with their strengths and limitations. This survey makes it easier for researchers to pick the required soft computing technique used in vehicular networks in order to improve metrics such as packet delivery ratio, end-to-end delay, throughput, cluster lifetime, and message overhead.

A novel method of quantitative evaluation and comprehensive classification of low permeability-tight oil reservoirs: A case study of Jidong Oilfield, China

The classification of low permeability-tight reservoirs is the premise of development. The deep reservoir of Shahejie 3 member contains rich low permeability-tight reserves, but the strong heterogeneity and complex micro pore structure make the main controlling factors subjective and the classification boundaries unclear. Therefore, a new indicator considering the interaction between fluid and rock named Threshold Flow Zone Indicator (TFZI) is proposed, it can be used as the main sequence of correlation analysis to screen the main controlling factors, and the clustering algorithm is optimized combined with probability distribution to determine the classification boundaries. The sorting coefficient, main throat radius, movable fluid saturation and displacement pressure are screened as the representative parameters for the following four key aspects: rock composition, microstructure, flow capacity and the interaction between rock and fluid. Compared with the traditional probability distribution and clustering algorithm, the boundary of the optimized clustering algorithm proposed in this paper is more accurate. The classification results are consistent with sedimentary facies, oil levels and oil production intensity. This method provides an important basis for the development of low permeability-tight reservoirs.

An enhanced whale optimization algorithm for clustering

An enhanced whale optimization algorithm for clustering

Honesty aware congestion concerned secured edge disjoint multi path routing with fuzzy rule descriptors

Congestion and security plays a most important key role in the wireless sensor network. In our previous work, energy balances routing is ensured by introducing the Energy Balancing and Optimal Routing Based Secured Data Transmission (EBORDT). But in this research work, congestion and security is not focused. This will lead to increased data loss rate along with entire network collision. These issues are focused and resolved in the proposed research work by introducing the method namely Honest aware Congestion concerned Secured Edge Disjoint Multipath Routing (HC-SEDMR) Scheme. In this work cluster head selection is done using hybridized simulated annealing with fuzzy rule descriptors. Base on these selected cluster head, clustering is done using Normalized optimal clustering algorithm. After clustering Energy and Edge disjoint aware optimal routing is done using Congestion and Collision aware Edge Disjoint multipath routing. Here secured routing is ensured by choosing honest nodes for the forwarding process. This is done by using honest forwarding node selection method. The performance analysis of the research work is done in the NS2 simulation environment from which it is proved that the proposed method attains better performance than the existing methodology.

Optimization Algorithms for Scalable Stream Batch Clustering with k Estimation

The increasing volume and velocity of the continuously generated data (data stream) challenge machine learning algorithms, which must evolve to fit real-world problems. The data stream clustering algorithms face issues such as the rapidly increasing volume of the data, the variety of the number of clusters, and their shapes. The present work aims to improve the accuracy of sequential clustering batches of data streams for scenarios in which clusters evolve dynamically and continuously, automatically estimating their number. In order to achieve this goal, three evolutionary algorithms are presented, along with three novel algorithms designed to deal with clusters of normal distribution based on goodness-of-fit tests in the context of scalable batch stream clustering with automatic estimation of the number of clusters. All of them are developed on top of MapReduce, Discretized-Stream models, and the most recent MPC frameworks to provide scalability, reliability, resilience, and flexibility. The proposed algorithms are experimentally compared with state-of-the-art methods and present the best results for accuracy for normally distributed data sets, reaching their goal.

An ACO-Based Clustering Algorithm With Chaotic Function Mapping

To overcome shortcomings when the ant colony optimization clustering algorithm (ACOC) deal with the clustering problem, this paper introduces a novel ant colony optimization clustering algorithm with chaos. The main idea of the algorithm is to apply the chaotic mapping function in the two stages of ant colony optimization: pheromone initialization and pheromone update. The application of chaotic mapping function in the pheromone initialization phase can encourage ants to be distributed in as many different initial states as possible. Applying the chaotic mapping function in the pheromone update stage can add disturbance factors to the algorithm, prompting the ants to explore new paths more, avoiding premature convergence and premature convergence to suboptimal solutions. Extensive experiments on the traditional and proposed algorithms on four widely used benchmarks are conducted to investigate the performance of the new algorithm. These experiments results demonstrate the competitive efficiency, effectiveness, and stability of the proposed algorithm.

An Adaptive Fuzzy C Means with Seagull Optimization Algorithm for Analysis of WSNs in Agricultural Field with IoT

In recent years, the environmental monitoring in agriculture field is an essential required application. To achieve the environmental monitoring of agriculture fields, the wireless sense networks (WSN) and internet of things is utilized. In the WSN, the energy consumption is a main issue to access the medium and transfer the networks. Hence, in this paper, adaptive fuzzy C means clustering and seagull optimization algorithm is developed for monitoring environmental conditions in agriculture field. Two main objective functions are utilized to empower the presentation of the WSN such as load balancing and energy efficient operation. The proposed method is a combination of fuzzy C means clustering and seagull optimization algorithm (SOA). The energy efficient and load balancing is achieved by optimal routing scheme by proposed method. The fuzzy C-means clustering is utilized to empower the energy efficient operation and load balancing. In the fuzzy C-means clustering, the SOA is utilized to select the optimal path selection. The proposed method is executed by NS2 simulator and performances are compared with existing methods such as atom search optimization and emperor penguin optimization respectively. The performance metrics are delay, drop, throughput, energy consumption, network lifetime, overhead and delivery ratio.

Soft-sensing of effluent total phosphorus using adaptive recurrent fuzzy neural network with Gustafson-Kessel clustering

To address the issue of soft-sensing of effluent total phosphorus in wastewater treatment processes (WWTPs), a soft-sensing system based on an adaptive recursive fuzzy neural network with Gustafson-Kessel (GK) clustering and hierarchical adaptive second-order optimization algorithm (HAS) is proposed in this paper. In GK-ARFNN, first, the GK clustering algorithm was utilized to cluster the input–output dataset. Thus, the establishment of the initial fuzzy rule base and the determination of the parameter value of the fuzzy set membership function was realized. Then, the recursive layer was added into FNN to improve the dynamic mapping ability of the system. Finally, the HAS algorithm was developed based on the improved Levenberg-Marquardt (LM) optimization algorithm, and all the free parameters of the GK-ARFNN were adjusted online using HAS to improve the generalization capability and prediction accuracy of the soft-sensing system. In addition, the convergence of the proposed GK-ARFNN algorithm was also analyzed in this paper, which can ensure the effectiveness of the solutions to modelling issues for practical industrial processes. The simulation results demonstrate that the GK-ARFNN-based soft-sensing system introduced in this paper achieved satisfactory accuracy in the prediction of effluent total phosphorus in WWTPs. The source codes of GK-ARFNN and some competitors can be downloaded from https://github.com/hyitzhb/GK-ARFNN.

Internet of Drones: Routing Algorithms, Techniques and Challenges

In the past decades, unmanned aerial vehicles (UAVs), also known as drones, have drawn more attention in the academic domain and exploration in the research fields of wireless sensor networks (WSNs). Moreover, applications of drones aid operations related to military support, agriculture industry, and smart Internet-of-Things (IoT). Currently, the use of drone based IoT, also known as Internet-of-Drones (IoD), and their design challenges and techniques are being probed by researchers around the globe. The placement of drones (nodes) is an important consideration in a IoD environment and is closely related to the properties of IoT. Given a base station (BS), sensor nodes (SNs) and IoT devices are designed to capture the signals transmitted by the BS and make use of internet connectivity in a manner to facilitate users. Mutual benefit can be achieved by integrating drones into IoT. The drone based cluster models are not free from challenges. Routing protocols have to be substantiated by key algorithms. Drones are designed to be specific to applications, but the underlying principles are the same. Optimization algorithms are the gateway to better accuracy, performance, and reliability. This article discusses some of these optimization algorithms, include genetic algorithm (GA), bee optimization algorithm, and Chicken Swarm Optimization Clustering Algorithm (CSOCA). Finally, the routing schemes, protocols, and challenges in the context of IoD are discussed.

An optimal clustering algorithm based distance-aware routing protocol for wireless sensor networks

Wireless Sensors Networks (WSN) consist of low power devices that are deployed at different geographical isolated areas to monitor physical event. Sensors are arranged in clusters. Each cluster assigns a specific and vital node which is known as a cluster head (CH). Each CH collects the useful information from its sensor member to be transmitted to a sink or Base Station (BS). Sensor have implemented with limited batteries (1.5V) that cannot have replaced. To resolve this issue and improve network stability, the proposed scheme adjust the transmission range between CHs and their members. The proposed approach is evaluated via simulation experiments and compared with some references existing algorithms. Our protocol seemed improved performance in terms of extended lifetime and achieved more than 35% improvements in terms of energy consumption