Efficient Clustering Approach Research Articles

An efficient network clustering approach using graph-boosting and nonnegative matrix factorization

Network clustering is a critical task in data analysis, aimed at uncovering the underlying structure and patterns within complex networks. Traditional clustering methods often struggle with large-scale and noisy data, leading to suboptimal results. Also, the efficiency of positive samples in network clustering depends on the carefully constructed data augmentation, and the pre-training process of the model deals with large-scale data. To address these issues, in this paper, we introduce an efficient network clustering approach that leverages Graph-Boosting and Nonnegative Matrix Factorization to enhance clustering performance (GBNMF). Our algorithm addresses the limitations of traditional clustering techniques by incorporating the strengths of graph-boosting, which iteratively improves the quality of clusters, and Nonnegative Matrix Factorization (NMF), which effectively captures latent structures within the data. We validate our algorithm through extensive experiments on various benchmark network datasets, demonstrating significant improvements in clustering accuracy and robustness. The proposed algorithm not only achieves superior clustering results but also exhibits remarkable computational efficiency, making it a valuable tool for large-scale network analysis applications.

Toward an Efficient Hybrid Clustering and Classification Approach for Fake News Detection in Social Network

Objectives: The spread of fake news on social media has become a pressing issue in recent times. Despite various organizations' efforts to address this problem, it continues to persist, necessitating finding more effective solutions. This study implements a machine learning-based approach for identifying fake news on social media with improved accuracy. Methods : The study's methodology utilizes a combination of Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) to extract semantic features from news articles. Then, a hybrid clustering and classification approach is used, which combines K-means clustering and Artificial Neural Network (ANN) classifiers. Data used is a secondary data consisting of 23481 world news articles obtained from the Reuters.com website and 21417 unreliable news from polifact.com. During the training process, the number of units and layers on the model was tuned to optimize model performance. The model was compared to other baseline models such as KNN, SVM, Decision tree, and Boosted decision tree to establish the best performing model. Findings: The results from the two algorithms were weighted to final classifications using Bayesian probability theory. The proposed approach achieved an accuracy of 99.78%, a sensitivity of 100%, and specificity equal to 99.73%. The model's precision is 99.74%, indicating its ability to identify fake news. The F-score of the approach is 99.87%, indicating that the model strikes a good balance between correctly classifying fake news articles and reliable news articles. The approach outperformed other machine learning classifiers, including KNN, SVM, Decision Tree, and Boosted Decision Tree. Novelty : The study applies a hybrid approach with a classification and clustering algorithm to improve detection of fake news on social media, the approach is tested with varied real-world datasets to establish its robustness under different vocabularies and vocabulary sizes. Keywords: Artificial Intelligence, Machine Learning, Deep Learning, Hybrid clustering approach, Classification, CNN, LSTM, Boosted Decision Tree, Social platforms, K-means

An efficient graph embedding clustering approach for heterogeneous network

An efficient graph embedding clustering approach for heterogeneous network

Adaptive local neighborhood information based efficient fuzzy clustering approach

The purpose of clustering is to partition data similar with each other into a same group and partition data dissimilar with each other into different groups. However, in most existing fuzzy clustering approaches, the membership degrees of an individual belonging to different clusters are relied on the different distances between the individual and different cluster centroids, the similarity between the individual and data in different clusters are ignored, besides, the outliers cannot be distinguished effectively. For improving the clustering performance and addressing the problems in most existing fuzzy clustering approaches, based on the concept that data close to each other should be grouped together and be assigned to a same cluster, in this paper, we present a novel efficient fuzzy clustering approach, in which the adaptive local neighborhood information of each data referring to different clusters is taken into consideration; an entirely new idea that the membership degree values of an individual referring to different clusters should not only depend on the distances between the individual and different cluster centers, but also rely on the distances between the individual and several nearest neighbor data in different clusters is put forward; a new scheme to search for the outliers is presented, a method for identifying the different importance of different features is introduced. Experiments on synthetic and publicly real-world datasets were conducted, the clustering results show that the approach put forward can yield consistently satisfying clustering performance and has significant advantages.

Performance Analysis of New Hybrid Distributed Energy Efficient Clustering Approach for WSNs

One of the biggest obstacles to the development of wireless sensor network (WSN) is achieving energy efficiency. Since transmission accounts for the majority of energy consumption, clustering of the network is adopted by the research community to address this issue. In clustering protocols, the prime focus is given on cluster head selection method to achieve better network lifetime. In this paper, the cluster head selection is optimized by using Firefly method where the attractiveness of the nodes is computed using Firefly which optimizes the head selection process. The protocol was simulated in MATLAB and the performance of the network was analyzed based on energy consumed in the network and number of nodes alive. The proposed protocol showed better performance than the other two indicating the achievement of better network lifetime. Keywords: Wireless sensor network (WSN), Firefly Optimization, Clustering, Energy efficiency

Big data clustering using fuzzy based energy efficient clustering and MobileNet V2

Big data analytics (BDA) is a systematic way to analyze and detect various patterns, relationships, and trends in vast amounts of data. Big data analysis and processing require significant effort, techniques, and equipment. The Hadoop framework software uses the MapReduce approach to do large-scale data analysis using parallel processing in order to generate results as soon as possible. Due to the traditional algorithm’s longer execution time and difficulty in processing big amounts of data, this is one of the main issues. Clusters are highly correlated inside each other but are not highly correlated with one another. The technique of effectively allocating limited resources is known as an optimization algorithm for clustering. For processing large amounts of data with several dimensions, the conventional optimization approach is insufficient. By using a fuzzy method, this can be prevented. In this paper, we proposed Fuzzy based energy efficient clustering approach to enhance the clustering mechanism. In summary, Fuzzy based energy efficient clustering introduces a function that measures the distance between the cluster center and the instance, which aids in improved clustering, and we then present the MobileNet V2 model to improve efficiency and speed up computation. To enhance the method’s performance and reduce its time complexity, the distributed database simulates the shared memory space and parallelizes on the MapReduce framework on the Hadoop cloud computing platform. The proposed approach is evaluated using performance metrics such as Accuracy, Precision, Adjusted Rand Index (ARI), Recall, F1-Score, and Normalized Mutual Information (NMI). The experimental findings indicate that the proposed approach outperforms the existing techniques in terms of clustering accuracy.

An efficient Analysis of the Fusion of Statistical-Centred Clustering and Machine Learning for WSN Energy Efficiency

Recently, wireless sensor networks on several challenging topics have piqued researchers’ attention. Maximising a network's lifetime requires just the right combination of cluster size and number of nodes. Data transmission from nodes to cluster leaders is energy intensive, even for a modest number of clusters. If there are several clusters, many leaders will be chosen, and many nodes will rely on long-distance transmission to communicate with the home base. Therefore, in order to maximise efficiency, it is necessary to strike a balance between these two factors. WSN's major challenge is improving its energy efficiency. This is because their energy consumption defines their lifespan, and it is difficult, if not impossible, to recharge their batteries. Therefore, it is crucial to develop algorithms that consume as little energy as possible in order to maximise the network's potential. The perfect clusters are essential for the longevity of the network. Therefore, an algorithm called statistical centre energy efficient clustering approach (SEECA) is presented to increase the network's lifetime while decreasing its energy consumption. The experimental findings show that the proposed methodology SCEECA outperforms the LEACH method by a wide margin, with gains of 32% in Residual energy, 16% in Network Lifetime, and 12% in Throughput.

Conceptual clustering with application on FCA context

Conceptual clustering is one of the key approaches for automatic concept generation from input contexts. In this paper, we propose an extension of the dominating k-means method. The proposed method introduces a flexible distance metric that enables the approximation of both Euclidean and meet(or join)-based similarity calculations. To increase the approximation accuracy, the method combines the k-means method with a Quality Threshold component. The paper shows that the method can also be used for approximation of formal concept lattices. Based on the performed tests, the method provides an efficient alternative conceptual clustering approach.

Proposed Naïve Bayes- Genetic algorithm to detect black hole attacks in MANETs.

The threats and attacks on mobile ad hoc networks (MANETs) are significant, making it difficult for traditional security systems to provide complete protection. Therefore, an efficient hybrid clustering approach must be designed to construct an intrusion detection system (IDS) that is suitable for this network. IDSs are crucial in MANETs due to the presence of black hole threats, which are the most significant vulnerabilities in this network.Our suggestion is to use a hybrid classifier to detect black hole attacks in MANETs. This can be achieved by using the Naïve Bayes algorithm for clustering to select the cluster head, and modify the Genetic Algorithm to identify the node responsible for a black hole attack on the optimal path. Finally, the confidence server instructs the destination node. If permitted, it alerts the collection head; otherwise, it identifies the node as a malicious one in the black hole attack within each cluster. The results of our proposed technique show that it has improved package damage rate, quantity, package distribution ratio, whole network interruption, and standardized directing capacity parameters compared to current black hole detection approaches.
 The simulation was done in KDD cup 99 to carry out black hole attack and trace file obtained is used as dataset for training and testing purpose using visual basic.

A novel k-means powered algorithm for an efficient clustering in vehicular ad-hoc networks

<p>Considerable attention has recently been given to the routing issue in vehicular ad-hoc networks (VANET). Indeed, the repetitive communication failures and high velocity of vehicles reduce the efficacy of routing protocols in VANET. The clustering technique is considered an important solution to overcome these difficulties. In this paper, an efficient clustering approach using an adapted k-means algorithm for VANET has been introduced to enhance network stability in a highway environment. Our approach relies on a clustering scheme that accounts for the network characteristics and the number of connected vehicles. The simulation indicates that the proposed approach is more efficient than similar schemes. The results obtained appear an overall increase in constancy, proven by an increase in cluster head lifetime by 66%, and an improvement in robustness clear in the overall reduction of the end-to-end delay by 46% as well as an increase in throughput by 74%.</p>

VoomSOM: voom-based Self-Organizing Maps for Clustering RNASequencing Data

Background: Due to overdispersion in the RNA-Seq data and its discrete structure, clustering samples based on gene expression profiles remains a challenging problem, and several clustering approaches have been developed so far. However, there is no “gold standard” strategy for clustering RNA-Seq data, so alternative approaches are needed. Objective: In this study, we presented a new clustering approach, which incorporates two powerful methods, i.e., voom and self-organizing maps, into the frequently used clustering algorithms such as kmeans, k-medoid and hierarchical clustering algorithms for RNA-seq data clustering. Methods: We first filter and normalize the raw RNA-seq count data. Then to transform counts into continuous data, we apply the voom method, which outputs the log-cpm matrix and sample quality weights. After the voom transformation, we apply the SOM algorithm to log-cpm values to get the codebook used in the downstream analysis. Next, we calculate the weighted distance matrices using the sample quality weights obtained from voom transformation and codebooks from the SOM algorithm. Finally, we apply k-means, k-medoid and hierarchical clustering algorithms to cluster samples. Results: The performances of the presented approach and existing methods are compared over simulated and real datasets. The results show that the new clustering approach performs similarly or better than other methods in the Rand index and adjusted Rand index. Since the voom method accurately models the observed mean-variance relationship of RNA-seq data and SOM is an efficient algorithm for modeling high dimensional data, integrating these two powerful methods into clustering algorithms increases the performance of clustering algorithms in overdispersed RNA-seq data. Conclusion: The proposed algorithm, voomSOM, is an efficient and novel clustering approach that can be applied to RNA-Seq data clustering problems.

Ameliorate the performance using soft computing approaches in wireless networks

<span lang="EN-US">Wireless sensor networks are an innovative and rapidly advanced network occupying the broad spectrum of wireless networks. It works on the principle of “use with less expense, effort and with more comfort.” In these networks, routing provides efficient and effective data transmission between different sources to access points using the clustering technique. This work addresses the low-energy adaptive clustering hierarchy (LEACH) protocol’s main backdrop of choosing head nodes based on a random value. In this, the soft computing methods are used, namely the fuzzy approach, to overcome this barrier in LEACH. Our approach’s primary goal is to extend the network lifetime with efficient energy consumption and by choosing the appropriate head node in each cluster based on the fuzzy parameters. The proposed clustering algorithm focused on two fuzzy inference structures, namely Mamdani and Sugeno fuzzy logic models in two scenarios, respectively. We compared our approach with four existing works, the conventional LEACH, LEACH using the fuzzy method, multicriteria cluster head delegation, and fuzzy-based energy efficient clustering approach (FEECA) in wireless sensor network. The proposed scenario based fuzzy LEACH protocol approaches are better than the four existing methods regarding stability, network survivability, and energy consumption.</span>

Energy Efficient Unequal Fault Tolerance Clustering Approach

For achieving Energy-Efficiency in wireless sensor networks (WSNs), different schemes have been proposed which focuses only on reducing the energy consumption. A shortest path determines for the Base Station (BS), but fault tolerance and energy balancing gives equal importance for improving the network lifetime. For saving energy in WSNs, clustering is considered as one of the effective methods for Wireless Sensor Networks. Because of the excessive overload, more energy consumed by cluster heads (CHs) in a cluster based WSN to receive and aggregate the information from member sensor nodes and it leads to failure. For increasing the WSNs’ lifetime, the CHs selection has played a key role in energy consumption for sensor nodes. An Energy Efficient Unequal Fault Tolerant Clustering Approach (EEUFTC) is proposed for reducing the energy utilization through the intelligent methods like Particle Swarm Optimization (PSO). In this approach, an optimal Master Cluster Head (MCH)-Master data Aggregator (MDA), selection method is proposed which uses the fitness values and they evaluate based on the PSO for two optimal nodes in each cluster to act as Master Data Aggregator (MDA), and Master Cluster Head. The data from the cluster members collected by the chosen MCH exclusively and the MDA is used for collected data reception from MCH transmits to the BS. Thus, the MCH overhead reduces. During the heavy communication of data, overhead controls using the scheduling of Energy-Efficient Time Division Multiple Access(EE-TDMA). To describe the proposed method superiority based on various performance metrics, simulation and results are compared to the existing methods.

Design of Evolutionary Algorithm Based Energy Efficient Clustering Approach for Vehicular Adhoc Networks

In a vehicular ad hoc network (VANET), a massive quantity of data needs to be transmitted on a large scale in shorter time durations. At the same time, vehicles exhibit high velocity, leading to more vehicle disconnections. Both of these characteristics result in unreliable data communication in VANET. A vehicle clustering algorithm clusters the vehicles in groups employed in VANET to enhance network scalability and connection reliability. Clustering is considered one of the possible solutions for attaining effectual interaction in VANETs. But one such difficulty was reducing the cluster number under increasing transmitting nodes. This article introduces an Evolutionary Hide Objects Game Optimization based Distance Aware Clustering (EHOGO-DAC) Scheme for VANET. The major intention of the EHOGO-DAC technique is to portion the VANET into distinct sets of clusters by grouping vehicles. In addition, the DHOGO-EAC technique is mainly based on the HOGO algorithm, which is stimulated by old games, and the searching agent tries to identify hidden objects in a given space. The DHOGO-EAC technique derives a fitness function for the clustering process, including the total number of clusters and Euclidean distance. The experimental assessment of the DHOGO-EAC technique was carried out under distinct aspects. The comparison outcome stated the enhanced outcomes of the DHOGO-EAC technique compared to recent approaches.

Energy Efficient Load Balancing and Routing Using Multi-Objective Based Algorithm in WSN

In wireless sensor network (WSN), the gateways which are placed far away from the base station (BS) forward the collected data to the BS through the gateways which are nearer to the BS. This leads to more energy consumption because the gateways nearer to the BS manages heavy traffic load. So, to overcome this issue, loads around the gateways are to be balanced by presenting energy efficient clustering approach. Besides, to enhance the lifetime of the network, optimal routing path is to be established between the source node and BS. For energy efficient load balancing and routing, multi objective based beetle swarm optimization (BSO) algorithm is presented in this paper. Using this algorithm, optimal clustering and routing are performed depend on the objective functions routing fitness and clustering fitness. This approach leads to decrease the power consumption. Simulation results show that the performance of the proposed BSO based clustering and routing scheme attains better results than that of the existing algorithms in terms of energy consumption, delivery ratio, throughput and network lifetime. Namely, the proposed scheme increases throughput to 72% and network lifetime to 37% as well as it reduces delay to 37% than the existing optimization algorithms based clustering and routing schemes.

DPC-FSC: An approach of fuzzy semantic cells to density peaks clustering

Density peaks clustering (DPC) algorithm is a succinct and efficient density-based clustering approach to data analysis. It computes the local density and the relative distance for objects to seek cluster centers and form clusters. However, it is difficult to estimate an appropriate local density by a rule of thumb; therefore, the performance of DPC may be poor on real datasets in practice. Thus, this study proposes a novel method for density peaks clustering based on fuzzy semantic cells. Specifically, each object is coarsened into a fuzzy point with the form of the fuzzy semantic cell model. Based on this model, a local density metric is defined and estimated via the principle of justifiable granularity. Our local density estimation can be converted into an optimization problem. In addition, a relative semantic distance is also introduced which concerns the distance between fuzzy semantic cells. The relative semantic distance is more informative for selecting cluster centers in the decision graph. The experimental results show that our method not only exhibits higher performance but also provides a clearer decision graph to select cluster centers.

A performance efficient joint clustering and routing approach for heterogeneous wireless sensor networks

AbstractWireless sensor networks have proven to be a promising paradigm due to their wide applicability in the real‐world scenarios. Because of the resource constraint, type‐variant and battery‐powered features of the sensor nodes, the key challenge is how to improve the energy usage and network life in the heterogeneous sensor networks. In this paper, the Mahalanobis distance based K‐Means algorithm is integrated with a novel evolutionary approach for clustering called calf search optimization algorithm (K‐CSOA) that creates energy efficient clusters. The routing in the network is performed using a power efficient ant colony optimization algorithm (ACO). The extensive and multiple simulations are performed to validate the effectiveness of the proposed method. It is observed that the running time of the proposed scheme is lowered due to the implementation of hybrid clustering. The results are validated for various performance metrics wherein the proposed method shows 41.6% and 4.3%–12% reduction in energy expenditure and end‐to‐end delay respectively and around 60% enhancement in the throughput of the network when compared with other similar state‐of‐the‐art methods. In addition to this, statistical analysis is also carried out to identify the performance of the proposed algorithm.

Wildfire Monitoring Based on Energy Efficient Clustering Approach for FANETS

Forest fires are a significant threat to the ecological system’s stability. Several attempts have been made to detect forest fires using a variety of approaches, including optical fire sensors, and satellite-based technologies, all of which have been unsuccessful. In today’s world, research on flying ad hoc networks (FANETs) is a thriving field and can be used successfully. This paper describes a unique clustering approach that identifies the presence of a fire zone in a forest and transfers all sensed data to a base station as soon as feasible via wireless communication. The fire department takes the required steps to prevent the spread of the fire. It is proposed in this study that an efficient clustering approach be used to deal with routing and energy challenges to extend the lifetime of an unmanned aerial vehicle (UAV) in case of forest fires. Due to the restricted energy and high mobility, this directly impacts the flying duration and routing of FANET nodes. As a result, it is vital to enhance the lifetime of wireless sensor networks (WSNs) to maintain high system availability. Our proposed algorithm EE-SS regulates the energy usage of nodes while taking into account the features of a disaster region and other factors. For firefighting, sensor nodes are placed throughout the forest zone to collect essential data points for identifying forest fires and dividing them into distinct clusters. All of the sensor nodes in the cluster communicate their packets to the base station continually through the cluster head. When FANET nodes communicate with one another, their transmission range is constantly adjusted to meet their operating requirements. This paper examines the existing clustering techniques for forest fire detection approaches restricted to wireless sensor networks and their limitations. Our newly designed algorithm chooses the most optimum cluster heads (CHs) based on their fitness, reducing the routing overhead and increasing the system’s efficiency. Our proposed method results from simulations are compared with the existing approaches such as LEACH, LEACH-C, PSO-HAS, and SEED. The evaluation is carried out concerning overall energy usage, residual energy, the count of live nodes, the network lifetime, and the time it takes to build a cluster compared to other approaches. As a result, our proposed EE-SS algorithm outperforms all the considered state-of-art algorithms.

Self-Adaptive Efficient Dynamic Multi-Hop Clustering (SA-EDMC) Approach for Improving VANET’s Performance

Vehicular ad hoc networks (VANETs) are mainly used in the intelligent transportation field for smart applications. VANETS received maximum concentration among the researchers in academic research. Providing traffic safety at the time of high mobility in the network is the major issue. Also, it consists of few general issues namely self-organization, link failure and speedy variation in topology. In order to address this issue, we developed a novel approach namely, Self-Adaptive Efficient Dynamic Multi-Hop Clustering (SA-EDMC) approach which is designed to reduce the delay and energy consumption in the VANETs that leads to increase the efficiency and overall Quality of Service (QoS) of the network. This approach is composed into four parts (1) network construction, (2) prime cluster head selection, (3) dynamic prime CH selection and (4) gateway creation. Network simulator is utilized to demonstrate the behavior of our SA-EDMC approach. The simulation evaluation exhibits that our proposed work achieved high packet delivery ratio, low delay and high throughput when compared with earlier research outputs like MCA-V2I and QMM-VANET. The comparative analysis expressed that performance of the proposed SA-EDMC is ~5% increase in packet delivery ratio, produced 300 to 500 kbps extra throughput compared with the earlier methods and delay is comparatively low.

Change Detection Approach for SAR Imagery Based on Arc-Tangential Difference Image and k-Means++

In this letter, an unsupervised change detection (CD) approach based on arc-tangential difference and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> -Means++ clustering is presented for synthetic aperture radar (SAR) remote-sensing images. The images are first standardized with their variance values using a logarithmic function applied to multitemporal images. The difference image (DI) is then calculated by subtracting the SAR images using the arc-tangential subtraction operator. After that, the DI is subjected to a 2-D Gaussian filter and a median filter, respectively. Filters are essential for determining the best feature space for CD. The 2-D Gaussian filter smooths DIs to retain local area consistency, while the median filter handles edge information. Finally, using <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> -Means++, a quick and efficient clustering approach, filtered data is clustered into two classes. Experiments using real-world datasets in Bern, Ottawa, and Yellow River have demonstrated that the given technique is fast, successful, and effective.