Search

With the launch of OpenAI's ChatGPT, large language models have garnered significant attention, and applications based on these models have proliferated. A critical challenge has emerged: how to rapidly enhance the capabilities of general LLMs in specialized domains. Compared to fine-tuning and other methods, prompt engineering has proven to be a cost-effective approach for improving the performance of LLMs on specific tasks, yielding remarkable results. However, current prompt example construction methods are numerous and lack a universally applicable approach that spans different models and tasks. Furthermore, existing research is predominantly tested and evaluated on a limited range of specific datasets, failing to explore the broader impact of these methods on a wider array of tasks. This paper proposes a prompt example construction method based on clustering and semantic similarity, which combines clustering algorithms with semantic similarity techniques to significantly improve the quality of prompt examples. In comparative tests conducted on six LLMs and seven datasets, the overall accuracy and stability of the proposed method significantly outperforms five other common methods, demonstrating broad applicability and the potential to enhance the output performance of all LLMs. Through comparative experiments, this paper also identifies that as the parameter scale of LLMs increases, the improvement effect of the prompt example construction method on LLM output performance tends to diminish. Additionally, diversified prompt example sets provide a more pronounced enhancement in LLM output performance. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a very famous network because of its many applications. IoT network has an integration of large-scale IoT devices that generate data. These IoT devices are very low power computing devices due to which they have a low level of communication. These devices construct data and transmit the data to the base station via intermediate IoT devices. The base station gathers and integrates the data and sends it to the administrator for further processing. The data attains the base station using various routing algorithms with the goal of low power consumption. When discussing low power IoT devices, power efficiency is an important performance measurement when creating a routing algorithm. This paper proposes a Minimum Power Consumption Routing (MPCR) algorithm using Hierarchical Fuzzy Logic Clustering (HFLC) algorithm for IoT networks. The MPCR with HFLC algorithm is an energy-efficient algorithm because of its lower power consumption for the cluster by aggregating the data within the cluster head and decreasing the number of data transmissions to the base station. In this paper, the cluster formation and cluster-head selection are explained, and a simulation has been conducted. In addition, the proposed algorithm is compared with the existing algorithms based on different metrics such as throughput, packet delivery ratio, and energy consumption of the network. The experimental results show that the proposed MPCR with the HFLC algorithm provides high throughput and packet delivery ratio and reduces energy consumption more efficiently than other existing algorithms. [ABSTRACT FROM AUTHOR]

New discoveries and knowledge are summarized in thousands of published papers per year per scientific domain, making it incomprehensible for scientists to account for all available knowledge relevant for their studies. In this paper, we present ACCORDION (ACCelerating and Optimizing model RecommenDatIONs), a novel methodology and an expert system that retrieves and selects relevant knowledge from literature and databases to recommend models with correct structure and accurate behavior, enabling mechanistic explanations and predictions, and advancing understanding. ACCORDION introduces an approach that integrates knowledge retrieval, graph algorithms, clustering, simulation, and formal analysis. Here, we focus on biological systems, although the proposed methodology is applicable in other domains. We used ACCORDION in nine benchmark case studies and compared its performance with other previously published tools. We show that ACCORDION is: comprehensive, retrieving relevant knowledge from a range of literature sources through machine reading engines; very effective, reducing the error of the initial baseline model by more than 80%, recommending models that closely recapitulate desired behavior, and outperforming previously published tools; selective, recommending only the most relevant, contextspecific, and useful subset (15%-20%) of candidate knowledge in literature; diverse, accounting for several distinct criteria to recommend more than one solution, thus enabling alternative explanations or intervention directions. [ABSTRACT FROM AUTHOR]

Food loss ans waste, referred next as FLW, has a great extent on the economic and behavioural patterns of consumption. In this paper, we aim to present statistical univariate and multivariate analyses based on a statistical study run during a period of several months in the Romanian territory. In this matter, the main purpose of the analysis developed in this paper is to determine several patterns of FLW phenomenon. This is made based on a methodology which comprises two main sections: the univariate analysis, consisting in statistical determinations of indicators and direct observation, and the multivariate analysis, related to the clustering analysis. The clustering analysis is based on the usage of hierarchical method, which has as final result the determination of clusters describing patterns of consumption related to food loss and waste. After the analysis was run, five main clusters related to food waste behaviour patterns were determined, with slight differences between food consumption habits, but with various combinations between the parameters taken into consideration. The obtained clusters offer important information for policymakers and stakeholders aiming to customize interventions and programs to target specific demographic groups or segments of the population. [ABSTRACT FROM AUTHOR]

Linear latent variable models such as principal component analysis (PCA), independent component analysis (ICA), canonical correlation analysis (CCA), and factor analysis (FA) identify latent directions (or loadings) either ordered or unordered. These data are then projected onto the latent directions to obtain their projected representations (or scores). For example, PCA solvers usually rank principal directions by explaining the most variance to the least variance. In contrast, ICA solvers usually return independent directions unordered and often with single sources spread across multiple directions as multiple sub-sources, severely diminishing their usability and interpretability. This paper proposes a general framework to enhance latent space representations to improve the interpretability of linear latent spaces. Although the concepts in this paper are programming language agnostic, the framework is written in Python. This framework simplifies the process of clustering and ranking of latent vectors to enhance latent information per latent vector and the interpretation of latent vectors. Several innovative enhancements are incorporated, including latent ranking (LR), latent scaling (LS), latent clustering (LC), and latent condensing (LCON). LR ranks latent directions according to a specified scalar metric. LS scales latent directions according to a specified metric. LC automatically clusters latent directions into a specified number of clusters. Lastly, LCON automatically determines the appropriate number of clusters to condense the latent directions for a given metric to enable optimal latent discovery. Additional functionality of the framework includes single-channel and multi-channel data sources and data pre-processing strategies such as Hankelisation to seamlessly expand the applicability of linear latent variable models (LLVMs) to a wider variety of data. The effectiveness of LR, LS, LC, and LCON is shown in two foundational problems crafted with two applied latent variable models, namely, PCA and ICA. [ABSTRACT FROM AUTHOR]

The effectiveness of archives, particularly those related to cultural heritage, depends on their accessibility and navigability. An intuitive interface is essential for improving accessibility and inclusivity, enabling users with diverse backgrounds and expertise to interact with archival content effortlessly. This paper introduces a new method for visualizing and navigating dataset information through the creation of semantic graphs. By leveraging pre-trained large language models, this approach groups data and generates semantic graphs. The development of multi-layer maps facilitates deep exploration of datasets, and the capability to handle multilingual datasets makes it ideal for archives containing documents in various languages. These features combine to create a user-friendly tool adaptable to various contexts, offering even non-expert users a new way to interact with and navigate the data. This enhances their overall experience, promoting a greater understanding and appreciation of the content. The paper presents experiments conducted on diverse datasets across different languages and topics employing various algorithms and methods. It provides a thorough discussion of the results obtained from these experiments. [ABSTRACT FROM AUTHOR]

In this paper, a method is introduced to control the dark knowledge values also known as soft targets, with the purpose of improving the training by knowledge distillation for multi-class classification tasks. Knowledge distillation effectively transfers knowledge from a larger model to a smaller model to achieve efficient, fast, and generalizable performance while retaining much of the original accuracy. The majority of deep neural models used for classification tasks append a SoftMax layer to generate output probabilities and it is usual to take the highest score and consider it the inference of the model, while the rest of the probability values are generally ignored. The focus is on those probabilities as carriers of dark knowledge and our aim is to quantify the relevance of dark knowledge, not heuristically as provided in the literature so far, but with an inductive proof on the SoftMax operational limits. These limits are further pushed by using an incremental decision tree with information gain split. The user can set a desired precision and an accuracy level to obtain a maximal temperature setting for a continual classification process. Moreover, by fitting both the hard targets and the soft targets, one obtains an optimal knowledge distillation effect that mitigates better catastrophic forgetting. The strengths of our method come from the possibility of controlling the amount of distillation transferred non-heuristically and the agnostic application of this model-independent study. [ABSTRACT FROM AUTHOR]

To accurately analyze the influence of similar weather scenes in the terminal area, a framework is proposed for identifying such scenarios based on the Multiresolution Spatiotemporal Window (MRSTW). The goal is to analyze the impact of similar weather patterns. This paper introduces a simple and effective method called the rasterized weather severity index (WSI) to reduce the dimensionality of data used for extracting air transport weather features, which can cause the loss of spatial information in an image. Additionally, the paper uses Dynamic Time Warping (DTW) and the Fuzzy C-mean (FCM) clustering algorithm to cluster time-series scenes influenced by convective weather in an unsupervised manner on a daily basis. The most similar weather scenes are then identified by searching for the same cluster within a multiresolution spatiotemporal window, using 4 h weather scenes as typical examples. Finally, the framework analyzes the impact of weather scenes on the operation of terminal area approach traffic flow by combining trajectory data. The findings demonstrate that this framework can effectively identify similar weather scenes and provide a more accurate reflection of their impact on the operation of terminal area approach traffic flow. [ABSTRACT FROM AUTHOR]

The growth of the Internet of Things (IoT) has become a crucial area of modern research. While the increasing number of IoT devices has driven significant advancements, it has also introduced several challenges, such as data storage, data privacy, communication protocols, complex network topologies, and IoT device management. In essence, the management of IoT devices is becoming more and more challenging, especially with the limited capacity and power of the IoT devices. The devices, having limited capacities, cannot store the information of the entire environment at once. In addition, device power consumption can affect network performance and stability. The devices' sensing areas with device grouping and management can simplify further networking tasks and improve response quality with data aggregation and correction techniques. In fact, most research papers are looking forward to expanding network lifetimes by relying on devices with high power capabilities. This paper proposes a device spatial clustering technique that covers crucial challenges in IoT. Our approach groups the dispersed devices to create clusters of connected devices while considering their coverage, their storage capacities, and their power. A new clustering protocol alongside a new clustering algorithm is introduced, resolving the aforementioned challenges. Moreover, a technique for non-sensed area extraction is presented. The efficiency of the proposed approach has been evaluated with extensive experiments that gave notable results. Our technique was also compared with other clustering algorithms, showing the different results of these algorithms. [ABSTRACT FROM AUTHOR]

Recently, business sectors have focused on offering a wide variety of services through utilizing different modern technologies such as super apps in order to fulfill customers' needs and create a satisfactory user experience. Accordingly, studying the user experience has become one of the most popular trends in the research field due to its essential role in business prosperity and continuity. Thus, many researchers have dedicated their efforts to exploring and analyzing the user experience across social media, blogs, and websites, employing a variety of research methods such as machine learning to mine users' reviews. However, there are limited studies concentrated on analyzing super app users' experiences and specifically mining Arabic users' reviews. Therefore, this paper aims to analyze and discover the most important topics that affect the user experience in the super app environment by mining Arabic business sector users' reviews in Saudi Arabia using biterm topic modeling, CAMeL sentiment analyzer, and doc2vec with k-means clustering. We explore users' feelings regarding the extracted topics in order to identify the weak aspects to improve and the strong aspects to enhance, which will promote a satisfactory user experience. Hence, this paper proposes an Arabic text annotation framework to help the business sector in Saudi Arabia to determine the important topics with negative and positive impacts on users' experience. The proposed framework uses two approaches: topic modeling with sentiment analysis and topic modeling with clustering. As a result, the proposed framework reveals four important topics: delivery and payment, customer service and updates, prices, and application. The retrieved topics are thoroughly studied, and the findings show that, in most topics, negative comments outweigh positive comments. These results are provided with general analysis and recommendations to help the business sector to improve its level of services. [ABSTRACT FROM AUTHOR]

Role-based access control (RBAC) is a widely adopted access control model in various domains for defining security management. Role mining is closely related to role-based access control, as the latter employs role assignments to offer a flexible and scalable approach to managing permissions within an organization. The edge role mining problem (Edge RMP), a variant of the role mining problem (RMP), has long been recognized as an effective strategy for role assignment. Role mining, which groups users with similar access permissions into the same role, bears some resemblance to symmetry. Symmetry categorizes objects or graphics with identical characteristics into one group. Both involve a certain form of "classification" or "induction". Edge-RMP reduces the associations between users and permissions, thereby lowering the security risks faced by the system. While an algorithm based on Boolean matrix factorization exists for this problem, it fails to further refine the resulting user–role assignment (UA) and role–permission assignment (PA) relationships. Additionally, this algorithm does not address constraint-related issues, such as cardinality constraints, user exclusion constraints, and user capabilities. Furthermore, it demonstrates significant redundancy of roles when handling large datasets, leaving room for further optimization of Edge-RMP results. To address these concerns, this paper proposes the MFC-RMA algorithm based on Boolean matrix factorization. The method achieves significant optimization of Edge-RMP results by handling relationships between roles possessing various permissions. Furthermore, this paper clusters, compresses, modifies, and optimizes the original data based on the similarity between users, ensuring its usability for role mining. Both theoretical and practical considerations are taken into account for different types of constraints, and algorithms are devised to reallocate roles incorporating these constraints, thereby generating UA and PA matrices. The proposed approach yields optimal numbers of generated roles and the sum of the minimum number of generated edges to address the aforementioned issues. Experimental results demonstrate that the algorithm reduces management overhead, provides efficient execution results, and ensures the accuracy of generated roles. [ABSTRACT FROM AUTHOR]

Traditional metrics may not adequately assess performance in certain situations, whereas the Area Under Curve (AUC) offers a comprehensive perspective by considering both sensitivity and specificity. This method enhances interpretability, addresses limitations, and promotes the development of robust clustering algorithms. In unsupervised learning, utilizing AUC is a significant method for improving the precision and accuracy of machine learning models. Our work is inspired by several recent related works that implement approaches to manage the challenges of developing new metrics that can effectively assess and evaluate the performance of clustering algorithms. The research question relies on the concept of using an optimal metric for model evaluation of classification and clustering. Therefore, the paper investigates the use of the classification metric AUC for clustering validation purposes. The methodology we adopt is a hybrid clustering model because such a technique offers a robust model by combining the strengths of each model. The linkage approach directly impacts the clustering results, so we give significant attention to this feature in our implementation. Among the various linkage methods, we utilized single and average linkages. The Manhattan and Euclidean metrics are the distance measures used in this work. Thus, our contribution is to explore the benefit of using linkages and distance measurement in clustering with the help of the AUC metric. In addition, the entire proposed work and the contributions of this paper are evaluated and applied to the NSL-KDD dataset. Based on the proposed approach of using AUC with clustering, the Detection Rate (DR), False Alarm Rate (FAR), and other criteria are chosen to examine the model's results and capabilities. [ABSTRACT FROM AUTHOR]

Reverse mortgage is one of the products (perhaps the main one) that is good to obtain additional income by using the habitual residence as collateral. The main objective of this paper is to analyse the effects that reverse mortgage contracting has on household finances over the lifetime of a family according to the socioeconomic group to which it belongs in Spain. Four indicators are employed to measure the immediate and long-term effects. We use a stochastic model with a double source of randomness, survival and entry into dependency, and apply it to the three socioeconomic groups obtained with cluster methodology from the 2017 Spanish Household Financial Survey data. We conclude that the effects are very different depending on the group: regarding only the effects of hiring a reverse mortgage on the income of the family, widowed women aged between 81 and 85 years, with low income and expenses as well as little net wealth, and a habitual residence that represents half of her net wealth (Cluster 1) are the most benefited; considering that the highest impact indicators are on the probability of illiquidity and on the value of lack of liquidity, the use of reverse mortgages benefits more the families in Cluster 3 (high income and expenses and really high net wealth, head of household aged between 76 and 80 years) and less the families in Cluster 2 (medium income, net wealth and expenses, head of household aged between 65 and 75 years). [ABSTRACT FROM AUTHOR]

Enhancing the management and monitoring of oil and gas processes demands the development of precise predictive analytic techniques. Over the past two years, oil and its prediction have advanced significantly using conventional and modern machine learning techniques. Several review articles detail the developments in predictive maintenance and the technical and non-technical aspects of influencing the uptake of big data. The absence of references for machine learning techniques impacts the effective optimization of predictive analytics in the oil and gas sectors. This review paper offers readers thorough information on the latest machine learning methods utilized in this industry's predictive analytical modeling. This review covers different forms of machine learning techniques used in predictive analytical modeling from 2021 to 2023 (91 articles). It provides an overview of the details of the papers that were reviewed, describing the model's categories, the data's temporality, field, and name, the dataset's type, predictive analytics (classification, clustering, or prediction), the models' input and output parameters, the performance metrics, the optimal model, and the model's benefits and drawbacks. In addition, suggestions for future research directions to provide insights into the potential applications of the associated knowledge. This review can serve as a guide to enhance the effectiveness of predictive analytics models in the oil and gas industries. [ABSTRACT FROM AUTHOR]

The aim of this paper is to examine the impact of a country's entry into the monetary union on its economic variables growth rate of real GDP as well as on GDP per capita growth for the period from 2010 to 2020. The clustering method and the ANFIS method were used in the data analysis. A total of two cluster analyses were performed. The first cluster includes countries that joined the EU in 2004 and became EZ members by 2010. The second cluster refers to those countries that joined the EU in 2004 but are not yet members of the EZ. For the first individual cluster analysis two models were analysed and for the second individual cluster three models were analysed using the ANFIS method. As expected, the results showed that GDP growth is connected with trade, inflation and gross investments in fixed capital in the observed countries, while GDP per capita is connected with unemployment, interest rates and public debt. With regard to GDP growth, the difference between countries that are in the eurozone and those that are not is not significant, which is in line with other studies. [ABSTRACT FROM AUTHOR]

Internet of things (IoT) applications from home applications to military applications have been expanding day by day. Energy efficient routing schemes are vital for resource constraint wireless sensor networks (WSNs) and IoT. Clustering based routing scheme is one of the basic methods to extend the lifetime of WSN-based IoT. On the other hand, clustering is NP-hard problem and metaheuristic algorithms are suitable for clustering. In this paper, a new energy-efficient routing scheme is presented for IoT using two metaheuristic algorithms Harris hawk's optimization (HHO) and whale optimization algorithm (WOA). The selection of the cluster header (CH) is based on the WOA using various parameters such as residual energy of nodes, distance to neighbors, distance to sink. After clustering phase, an energy efficient routing scheme was proposed using the HHO algorithm. The simulation results in MATLAB environment justifies that the proposed protocol improves network life by 10%, average energy consumption by 15%, packet delivery rate (PDR) by 12%, throughput by 11% and number of alive nodes by 15%. [ABSTRACT FROM AUTHOR]

The problem of image-based detection of the variety of beans, using artificial intelligence, is currently dealt with by scientists of various profiles. The idea of this paper is to show the possibility of applying different types of distances, primarily those that are fuzzy metrics, in clustering models in order to improve existing models and obtain more accurate results. The paper presents the method of variable neighborhood search, which uses both standard and fuzzy t-metrics and dual fuzzy s-metrics characterized by appropriate parameters. By varying those parameters of the fuzzy metric as well as the parameters of the metaheuristic used, we have shown how it is possible to improve the clustering results. The obtained results were compared with existing ones from the literature. The criterion function used in clustering is a fuzzy metric, which is proven in the paper. [ABSTRACT FROM AUTHOR]

The phenomenon of algal bloom seriously affects the function of the aquatic ecosystems, damages the landscape of urban river and lakes, and threatens the safety of water use. The introduction of a multi-attribute decision-making method avoids the shortcomings of traditional algal bloom management that relies on manual experience. However, the weight-calculation part of this method still receives the artificial influence of human factors, which reduces the accuracy and scientific rigor of the decision. This paper presents a group decision-making method based on information self-learning which makes decision weights automatically clustered and assigned. A general framework of decision-making management is constructed for the algal bloom management process. In the decision-making process, an improved density-based clustering algorithm is used to automatically cluster and rank the decision data in the form of the three-parameter interval number, and ultimately obtain the optimal management method that meets the management objectives. Finally, the method was applied at the monitoring station of Sanjiadian Reservoir in Beijing, China. Based on the treatment objectives and water quality monitoring data of the station, relevant experts were invited to evaluate the management solutions, and the information self-organizing algorithm of this paper was used to automatically rank the decision-making methods, and finally obtain the most suitable management method for the station. Comparison with the water quality data and treatment inputs after the previous man-made selection of treatment options, and discussion among experts, show that the decision-making method is feasible and effective, and contributes to the sustainable treatment of algal blooms. [ABSTRACT FROM AUTHOR]

Path-based clustering algorithms typically generate clusters by optimizing a benchmark function. Most optimization methods in clustering algorithms often offer solutions close to the general optimal value. This study achieves the global optimum value for the criterion function in a shorter time using the minimax distance, Maximum Spanning Tree "MST", and meta-heuristic algorithms, including Genetic Algorithm "GA" and Particle Swarm Optimization "PSO". The Fast Path-based Clustering "FPC" algorithm proposed in this paper can find cluster centers correctly in most datasets and quickly perform clustering operations. The FPC does this operation using MST, the minimax distance, and a new hybrid meta-heuristic algorithm in a few rounds of algorithm iterations. This algorithm can achieve the global optimal value, and the main clustering process of the algorithm has a computational complexity of O (k² × n). However, due to the complexity of the minimum distance algorithm, the total computational complexity is O (n²). Experimental results of FPC on synthetic datasets with arbitrary shapes demonstrate that the algorithm is resistant to noise and outliers and can correctly identify clusters of varying sizes and numbers. In addition, the FPC requires the number of clusters as the only parameter to perform the clustering process. A comparative analysis of FPC and other clustering algorithms in this domain indicates that FPC exhibits superior speed, stability, and performance. [ABSTRACT FROM AUTHOR]

Further reducing greenhouse gas and pollutant emissions from road vehicles is a major task for the automotive industry. Stricter regulations regarding emissions and fleet fuel consumption require the continuous development of new powertrains and methods. In particular, the combination of hybrid powertrains on the technical side and the focus on real driving emissions (RDE) on the legislative side pose significant challenges to the vehicle calibration process. Against this background, new test methods and environments are being investigated to counteract the high number of interactions between hybrid drive systems and quasi-infinite test conditions due to RDE. Complementary to new test environments, innovative methods for data analysis are needed that allow the exploitation of the complete potential of measurement data. The application of such a method in the field of emission calibration is presented in this paper. For this purpose, a clustering method (HDBSCAN) is applied to critical sequences from emission tests. Within this presentation, the clustering process is based on a single signal only. This paper shows how signals of various characteristics can be processed with dynamic time warping and generically structured with the clustering method used. Here, 959 single events are automatically categorized into 24 clusters. This provides a new basis for system evaluation, enabling the automatic identification, categorization, and prioritization of calibration weaknesses. Using twelve signals of different characteristics, the generic usability of the clustering method is demonstrated. [ABSTRACT FROM AUTHOR]

Achieving a balance between convergence and diversity and their mutual enhancement is a complex task in the process of algorithm improvement. This is crucial because it is directly related to the effectiveness of the algorithm in obtaining accurate and uniformly distributed Pareto frontiers. Although significant progress has been made in particle swarm algorithms, exploring new approaches is necessary. In this paper, we construct a projection plane (projection line in 2D) based on the extreme values of the non-dominated solutions, select a set of uniform reference points on the projection plane, and then project the non-dominated solutions onto the constructed projection plane to form projection points. The reference points and projection points on the projection plane are thus utilized to guide the updating of the population as well as the maintenance of the external archive, a strategy that enhances the algorithm's global exploration and local exploitation capabilities. Secondly, we aggregate the target values of particles into a single scalar value and combine the idea of particle fusion to design a scheme for the particle selection of individual optimal particles. This paper further improves the algorithm's overall performance by using the information between populations to select individual optimal particles. Lastly, it is evaluated against a number of multi-objective algorithms that are currently in use and perform well on 22 test problems. The findings demonstrate that the algorithm this paper proposes performs better when solving multi-objective problems. [ABSTRACT FROM AUTHOR]

Matrix factorization has demonstrated outstanding performance in machine learning. Recently, graph-based matrix factorization has gained widespread attention. However, graph-based methods are only suitable for handling small amounts of data. This paper proposes a fast semi-supervised learning method using only matrix factorization, which considers both global and local information. By introducing bipartite graphs into symmetric matrix factorization, the technique can handle large datasets effectively. It is worth noting that by utilizing tag information, the proposed symmetric matrix factorization becomes convex and unconstrained, i.e., the non-convex problem min x (1 − x 2) 2 is transformed into a convex problem. This allows it to be optimized quickly using state-of-the-art unconstrained optimization algorithms. The computational complexity of the proposed method is O (n m d) , which is much lower than that of the original symmetric matrix factorization, which is O (n 2 d) , and even lower than that of other anchor-based methods, which is O (n m d + m 2 n + m 3) , where n represents the number of samples, d represents the number of features, and m ≪ n represents the number of anchors. The experimental results on multiple public datasets indicate that the proposed method achieves higher performance in less time. [ABSTRACT FROM AUTHOR]

Machine learning is regarded as an effective approach in network intrusion detection, and has gained significant attention in recent studies. However, few intrusion detection methods have been successfully applied to detect anomalies in large-scale network traffic data, and low explainability of the complex algorithms has caused concerns about fairness and accountability. A further problem is that many intrusion detection systems need to work with distributed data sources in the cloud. In this paper, we propose an intrusion detection method based on distributed computing to learn the latent representations from large-scale network data with lower computation time while improving the intrusion detection accuracy. Our proposed classifier, based on a novel hierarchical algorithm combining adaptability and visualization ability from a self-structured unsupervised learning algorithm and achieving explainability from self-explainable supervised algorithms, is able to enhance the understanding of the model and data. The experimental results show that our proposed method is effective, efficient, and scalable in capturing the network traffic patterns and detecting detailed network intrusion information such as type of attack with high detection performance, and is an ideal method to be applied in cloud-computing environments. [ABSTRACT FROM AUTHOR]

Recently, the use of fingerprinting has been proposed for positioning using the Wi-Fi RTT estimations gathered by IEEE 802.11mc devices. Wi-Fi RTT poses a challenge on scalability due to the location-specific traffic injected in the network, which may limit the data traffic transmissions of other Wi-Fi users. In this respect, fingerprinting has been regarded as a promising scalable technique, compared to multilateration. While coupling other metrics should bring relief to the system, reducing the number of APs to which RTT measurements are requested alleviates the burden in specific cells. But how far may we go? This paper assesses several methods aimed at reducing the Wi-Fi RTT overhead while preserving the precision of the calculated position. The use of the Wi-Fi RTT standard deviation is assessed for the first time, being especially useful when the number of RTT procedures is minimized. The application of clustering can also improve position estimates while leveraging bandwidth for other users' purposes. [ABSTRACT FROM AUTHOR]

It is crucial for both traffic management organisations and individual commuters to be able to forecast traffic flows accurately. Graph neural networks made great strides in this field owing to their exceptional capacity to capture spatial correlations. However, existing approaches predominantly focus on local geographic correlations, ignoring cross-region interdependencies in a global context, which is insufficient to extract comprehensive semantic relationships, thereby limiting prediction accuracy. Additionally, most GCN-based models rely on pre-defined graphs and unchanging adjacency matrices to reflect the spatial relationships among node features, neglecting the dynamics of spatio-temporal features and leading to challenges in capturing the complexity and dynamic spatial dependencies in traffic data. To tackle these issues, this paper puts forward a fresh approach: a new self-supervised dynamic spatio-temporal graph convolutional network (SDSC) for traffic flow forecasting. The proposed SDSC model is a hierarchically structured graph–neural architecture that is intended to augment the representation of dynamic traffic patterns through a self-supervised learning paradigm. Specifically, a dynamic graph is created using a combination of temporal, spatial, and traffic data; then, a regional graph is constructed based on geographic correlation using clustering to capture cross-regional interdependencies. In the feature learning module, spatio-temporal correlations in traffic data are subjected to recursive extraction using dynamic graph convolution facilitated by Recurrent Neural Networks (RNNs). Furthermore, self-supervised learning is embedded within the network training process as an auxiliary task, with the objective of enhancing the prediction task by optimising the mutual information of the learned features across the two graph networks. The superior performance of the proposed SDSC model in comparison with SOTA approaches was confirmed by comprehensive experiments conducted on real road datasets, PeMSD4 and PeMSD8. These findings validate the efficacy of dynamic graph modelling and self-supervision tasks in improving the precision of traffic flow prediction. [ABSTRACT FROM AUTHOR]

The k-means algorithm is a prevalent clustering method due to its simplicity, effectiveness, and speed. However, its main disadvantage is its high sensitivity to the initial positions of the cluster centers. The global k-means is a deterministic algorithm proposed to tackle the random initialization problem of k-means but its well-known that requires high computational cost. It partitions the data to K clusters by solving all k-means sub-problems incrementally for all k = 1 , ... , K . For each k cluster problem, the method executes the k-means algorithm N times, where N is the number of datapoints. In this paper, we propose the globalk-means++ clustering algorithm, which is an effective way of acquiring quality clustering solutions akin to those of global k-means with a reduced computational load. This is achieved by exploiting the center selection probability that is effectively used in the k-means++ algorithm. The proposed method has been tested and compared in various benchmark datasets yielding very satisfactory results in terms of clustering quality and execution speed. [ABSTRACT FROM AUTHOR]

Clustering validity indices are designed for evaluating the performance of clustering algorithms in terms of quality of clusters. They are also used for detecting the correct number of clusters. Numerous clustering validity indices have been proposed in the literature for different types of data. However, to the best of our knowledge, there are a few well-known clustering validity indices for graph data. In this paper, we propose a new clustering validity index for graph data called the node-based clustering validity index. The main characteristic of our proposed index is that it captures the exclusive contribution of each node to the separation and compactness of the clusters in a graph. This characteristic gives an advantage to the method which is the detection of the correct number of clusters for cases that two sets of nodes are bonded to each other with a single node. We provide an illustrative example to show that many existing validity indices fail to detect the correct number of clusters in such cases. We evaluate the performance of our proposed index with several experiments on different real-world and synthetic graphs. Experiments show that our proposed node-based index outperforms the existing validity indices for different graph data. [ABSTRACT FROM AUTHOR]

This paper presents a novel clustering approach that utilizes variational autoencoders (VAEs) with disentangled representations, enhancing the efficiency and effectiveness of clustering. Traditional VAE-based clustering models often conflate generative and clustering information, leading to suboptimal clustering performance. To overcome this, our model distinctly separates latent representations into two modules: one for clustering and another for generation. This separation significantly improves clustering performance. Additionally, we employ augmented data to maximize mutual information between cluster assignment variables and the optimized latent variables. This strategy not only enhances clustering effectiveness but also allows the construction of latent variables that synergistically combine clustering information from original data with generative information from augmented data. Through extensive experiments, our model demonstrates superior clustering performance without the need for pre-training, outperforming existing deep generative clustering models. Moreover, it achieves state-of-the-art clustering accuracy on certain datasets, surpassing models that require pre-training. [ABSTRACT FROM AUTHOR]

The increasing importance of hydropower generation has led to the development of new smart technologies and the need for reliable and efficient equipment in this field. As long as hydropower plants are more complex to build up than other power plants, the operation regimes and maintenance activities become essential for the hydropower companies to optimize their performance, such that including the data-driven approaches in the decision-making process represents a challenge. In this paper, a comprehensive and multi-task framework integrated into a Knowledge Discovery module based on Data Mining to support the decisions of the operators from the control rooms and facilitate the transition from the classical to smart Supervisory Control and Data Acquisition (SCADA) system in hydropower plants has been designed, developed, and tested. It integrates tasks related to detecting the outliers through advanced statistical procedures, identifying the operating regimes through the patterns associated with typical operating profiles, and developing strategies for loading the generation units that consider the number of operating hours and minimize the water amount used to satisfy the power required by the system. The proposed framework has been tested using the SCADA system's database of a hydropower plant belonging to the Romanian HydroPower Company. The framework can offer the operators from the control room comparative information for a time horizon longer than one year. The tests demonstrated the utility of a Knowledge Discovery module to ensure the transition toward smart SCADA systems that will help the decision-makers improve the management of the hydropower plants. [ABSTRACT FROM AUTHOR]

Federated Learning (FL) is an emerging privacy-preserving technology that enables training a global model beneficial to all participants without sharing their data. However, differences in data distributions among participants may undermine the stability and accuracy of the global model. To address this challenge, recent research proposes client clustering based on data distribution similarity, generating independent models for each cluster in order to enhance FL performance. Nevertheless, due to the uncertainty of participant identities, FL struggles to rapidly and accurately determine the clusters. Most of the existing algorithms distinguish clients by iterative clustering, which not only increases the computing cost of the server but also affects the convergence speed of the federation model. To address these shortcomings, in this paper, we propose a novel clustering-based FL method, SoFL. SoFL introduces SOM networks, improves the quality of cluster data, and eliminates redundant categories through secondary clustering, encouraging more similar clients to train together. Through this mechanism, SoFL completes the clustering task in one round of communication and speeds up the convergence of federated model training. Simulation results demonstrate that SoFL accurately and swiftly adapts to determine the clusters. In different non-IID settings, SoFL's model accuracy improvements ranged from 9 to 18% compared to FedAvg and FedProx. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Internet of Vehicles applications are known to be critical and time-sensitive. The value proposition of edge computing comprises its lower latency, advantageous bandwidth consumption, privacy, management, efficiency of treatments, and mobility, which aim to improve vehicular and traffic services. Successful stories have been observed between IoV and edge computing to support smooth mobility and the use of local resources. However, vehicle travel, especially due to high-speed movement and intersections, can result in IoV devices losing connection and/or processing with high latency. This paper proposes a Cluster Collaboration Vehicular Edge Computing (CCVEC) framework that aims to guarantee and enhance the connectivity between vehicle sensors and the cloud by utilizing the edge computing paradigm in the middle. The objectives are achieved by utilizing the cluster management strategies deployed between cloud and edge computing servers. The framework is implemented in OpenStack cloud servers and evaluated by measuring the throughput, latency, and memory parameters in two different scenarios. The results obtained show promising indications in terms of latency (approximately 390 ms of the ideal status) and throughput (30 kB/s) values, and thus appears acceptable in terms of performance as well as memory. [ABSTRACT FROM AUTHOR]

Simplicity in information found online is in demand from diverse user groups seeking better text comprehension and consumption of information in an easy and timely manner. Readability assessment, particularly at the sentence level, plays a vital role in aiding specific demographics, such as language learners. In this paper, we research model evaluation metrics, strategies for model creation, and the predictive capacity of features and feature sets in assessing readability based on sentence complexity. Our primary objective is to classify sentences as either simple or complex, shifting the focus from entire paragraphs or texts to individual sentences. We approach this challenge as both a classification and clustering task. Additionally, we emphasize our tests on shallow features that, despite their simplistic nature and ease of use, seem to yield decent results. Leveraging the TextStat Python library and the WEKA toolkit, we employ a wide variety of shallow features and classifiers. By comparing the outcomes across different models, algorithms, and feature sets, we aim to offer valuable insights into optimizing the setup. We draw our data from sentences sourced from Wikipedia's corpus, a widely accessed online encyclopedia catering to a broad audience. We strive to take a deeper look at what leads to greater readability classification in datasets that appeal to audiences such as Wikipedia's, assisting in the development of improved models and new features for future applications with low feature extraction/processing times. [ABSTRACT FROM AUTHOR]

This study investigates the time-series behavior of vegetable prices in the Central Market of Thessaloniki, Greece, using Recurrence Plot (RP) analysis and Recurrence Quantification Analysis (RQA), which considers non-linearities and does not necessitate stationarity of time series. The period of study was 1999–2016 for practical and research reasons. In the present work, we focus on vegetables available throughout the year, exploring the dynamics and interrelationships between their prices to avoid missing data. The study applies RP visual inspection classification, a clustering based on RQA parameters, and a classification based on the RQA analysis graphs with epochs for the first time. The aim of the paper was to investigate the grouping of products based on their price dynamical behavior. The results show that the formed groups present similarities related to their use as dishes and their way of cultivation, which apparently affect the price dynamics. The results offer insights into market behaviors, helping to inform better management strategies and policymaking and offer a possibility to predict variability of prices. This information can interest government policies in various directions, such as what products to develop for greater stability, identity for fluctuating prices, etc. In future work, a larger dataset including missing data could be included, as well as a machine-learning algorithm to classify the products based on the RQA with epochs graphs. [ABSTRACT FROM AUTHOR]

Although industrial kitchens consume significantly more energy than other commercial buildings and represent an important opportunity for sustainable energy systems, researchers have largely overlooked energy efficiency in these spaces. One of the main challenges is the diversity of kitchen configurations, complicating the characterization and generalization of research findings, including establishing a standardized methodology for assessing and benchmarking energy demand. To address this research gap, this paper proposes a methodological framework to develop taxonomies for understanding the electricity consumption in industrial kitchens. The proposed framework was developed following an extensive survey of the existing literature, and it is based on four main steps: identification of the knowledge domain, extraction of terms and concepts, data collection, and information analysis. To demonstrate the proposed framework, a case study was developed involving the participation of 50 restaurants located in Portugal. The proposed framework proved valid as it enabled the construction of a taxonomy that allows the classification of industrial kitchens according to different energy consumption-related concepts, such as costs with energy, the physical size of the kitchen, and the number of workers. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are usually composed of tens or hundreds of nodes powered by batteries that need efficient resource management to achieve the WSN's goals. One of the techniques used to manage WSN resources is clustering, where nodes are grouped into clusters around a cluster head (CH), which must be chosen carefully. In this article, a new centralized clustering algorithm is presented based on a Type-1 fuzzy logic controller that infers the probability of each node becoming a CH. The main novelty presented is that the fuzzy logic controller employs three different knowledge bases (KBs) during the lifetime of the WSN. The first KB is used from the beginning to the instant when the first node depletes its battery, the second KB is then applied from that moment to the instant when half of the nodes are dead, and the last KB is loaded from that point until the last node runs out of power. These three KBs are obtained from the original KB designed by the authors after an optimization process. It is based on a particle swarm optimization algorithm that maximizes the lifetime of the WSN in the three periods by adjusting each rule in the KBs through the assignment of a weight value ranging from 0 to 1. This optimization process is used to obtain better results in complex systems where the number of variables or rules could make them unaffordable. The results of the presented optimized approach significantly improved upon those from other authors with similar methods. Finally, the paper presents an analysis of why some rule weights change more than others, in order to design more suitable controllers in the future. [ABSTRACT FROM AUTHOR]

As an extension of Fuzzy C-Means (FCM), Evidence C-Means (ECM) is proposed in the framework of Dempster–Shafer theory (DST) and has been applied to many fields. However, the objective function of ECM involves only the distortion between the object and the prototype, which relies heavily on the initial prototype. Therefore, ECM may encounter the problem of local optimization. To solve this problem, this paper introduces ECM with Particle Swarm Optimization (PSO) initialization to determine the initial clustering centroids, and proposes Particle Swarm Optimization-based Evidential C-Means (PSO-ECM), which reduces the influence of bad initial prototypes and improves the local optimality problem of ECM. PSO-ECM is compared with three other clustering algorithms in four experiments and with ECM on a noise-containing dataset. According to the experimental results, PSO-ECM performs well in terms of different clustering validity metrics compared with existing clustering algorithms, has high stability of clustering, and can effectively and stably cluster noise-containing datasets and accurately identify outlier points. [ABSTRACT FROM AUTHOR]

Money laundering identification (MLI) is a challenging task for financial AI research and application due to its massive transaction volume, label sparseness, and label bias. Most of the existing MLI methods focus on individual-level abnormal behavior while neglecting the community factor that money laundering is a collaborative group crime. Furthermore, the massive volume of transactions and the issue of label shifting also impede the application of supervised or semi-supervised models. To this end, this paper proposes an efficient community-oriented algorithm, namely SEGE, to identify money laundering based on structural entropy minimization (SEM) with graph embedding in an unsupervised approach. Experiments on both a private real-world money laundering network and a public synthetic dataset show that our SEGE algorithm derives prominent performance and outperforms the parameterized learning-based graph representation methods. Moreover, we find that there are pervasive sub-communities in the real-world money laundering network. Based on our local algorithm, we propose a real combat strategy against the money laundering group, in which when we have several scattered suspicious accounts in the transaction network, we are able to retrieve the whole money laundering group by the union of sub-communities with both high precision and high recall rates. [ABSTRACT FROM AUTHOR]

Clustering is a technique of grouping data into a homogeneous structure according to the similarity or dissimilarity measures between objects. In clustering, the fuzzy c-means (FCM) algorithm is the best-known and most commonly used method and is a fuzzy extension of k-means in which FCM has been widely used in various fields. Although FCM is a good clustering algorithm, it only treats data points with feature components under equal importance and has drawbacks for handling high-dimensional data. The rapid development of social media and data acquisition techniques has led to advanced methods of collecting and processing larger, complex, and high-dimensional data. However, with high-dimensional data, the number of dimensions is typically immaterial or irrelevant. For features to be sparse, the Lasso penalty is capable of being applied to feature weights. A solution for FCM with sparsity is sparse FCM (S-FCM) clustering. In this paper, we propose a new S-FCM, called S-FCM-Lasso, which is a new type of S-FCM based on the Lasso penalty. The irrelevant features can be diminished towards exactly zero and assigned zero weights for unnecessary characteristics by the proposed S-FCM-Lasso. Based on various clustering performance measures, we compare S-FCM-Lasso with the S-FCM and other existing sparse clustering algorithms on several numerical and real-life datasets. Comparisons and experimental results demonstrate that, in terms of these performance measures, the proposed S-FCM-Lasso performs better than S-FCM and existing sparse clustering algorithms. This validates the efficiency and usefulness of the proposed S-FCM-Lasso algorithm for high-dimensional datasets with sparsity. [ABSTRACT FROM AUTHOR]

Belief and plausibility functions based on evidence theory (ET) have been widely used in managing uncertainty. Various generalizations of ET to fuzzy sets (FSs) have been reported in the literature, but no generalization of ET to q-rung orthopair fuzzy sets (q-ROFSs) has been made yet. Therefore, this paper proposes a novel, simple, and intuitive approach to distance and similarity measures for q-ROFSs based on belief and plausibility functions within the framework of ET. This research addresses a significant research gap by introducing a comprehensive framework for handling uncertainty in q-ROFSs using ET. Furthermore, it acknowledges the limitations inherent in the current state of research, notably the absence of generalizations of ET to q-ROFSs and the challenges in extending belief and plausibility measures to certain aggregation operators and other generalizations including Hesitant fuzzy sets, Bipolar fuzzy sets, Fuzzy soft sets etc. Our contribution lies in the proposal of a novel approach to distance and similarity measures for q-ROFSs under ET, utilizing Orthopairian belief and plausibility intervals (OBPIs). We establish new similarity measures within the generalized ET framework and demonstrate the reasonability of our method through useful numerical examples. Additionally, we construct Orthopairian belief and plausibility GRA (OBP-GRA) for managing daily life complex issues, particularly in multicriteria decision-making scenarios. Numerical simulations and results confirm the usability and practical applicability of our proposed method in the framework of ET. [ABSTRACT FROM AUTHOR]

Renewable energy communities foster the users' engagement in the energy transition, paving the way to the integration of distributed renewable energy sources. So far, the scientific literature has focused on residential users in energy communities, thus overlooking the opportunities for industrial and commercial members. This paper seeks to bridge this gap by extending the analysis to the role of non-residential users. The proposed methodology develops an effective clustering approach targeted to actual non-residential consumption profiles. It is based on the k-means algorithm and statistical characterization based on relevant probability density function curves. The employed clusterization procedure allows for effectively reducing a sample of 49 real industrial load profiles up to 11 typical consumption curves, whilst capturing all the relevant characteristics of the initial population. Furthermore, a peer-to-peer sharing strategy is developed accounting for distributed and shared storage. Three scenarios are considered to validate the model with different shares of non-residential users, and the results are then evaluated by means of shared energy, self-consumption, and self-sufficiency indices. Moreover, the results show that the integration of a large non-residential prosumer in a REC may increase the self-sufficiency of residential members by 8.2%, self-consumption by 4.4%, and the overall shared energy by 37.3%. Therefore, the residential community consistently benefits from the presence of non-residential users, with larger users inducing more pronounced effects. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Kidney segmentation from abdominal computed tomography (CT) images is essential for computer-aided kidney diagnosis, pathology detection, and surgical planning. This paper introduces a kidney segmentation method for clinical contrast-enhanced CT images. First, it begins with shape-based preprocessing to remove the spine and ribs. Second, a novel clustering algorithm and an initial kidney selection strategy are utilized to locate the initial slices and contours. Finally, an adaptive narrow-band approach based on active contours is developed, followed by a clustering postprocessing to address issues with concave parts. Experimental results demonstrate the high segmentation performance of the proposed method, achieving a Dice Similarity Coefficient of 97.4 ± 1.0% and an Average Symmetric Surface Distance of 0.5 ± 0.2 mm across twenty sequences. Notably, this method eliminates the need for manually setting initial contours and can handle intensity inhomogeneity and varying kidney shapes without extensive training or statistical modeling. [ABSTRACT FROM AUTHOR]

Unsupervised learning is a type of machine learning that learns from data without human supervision. Unsupervised feature selection (UFS) is crucial in data analytics, which plays a vital role in enhancing the quality of results and reducing computational complexity in huge feature spaces. The UFS problem has been addressed in several research efforts. Recent studies have witnessed a surge in innovative techniques like nature-inspired algorithms for clustering and UFS problems. However, very few studies consider the UFS problem as a multi-objective problem to find the optimal trade-off between the number of selected features and model accuracy. This paper proposes a multi-objective symbiotic organism search algorithm for unsupervised feature selection (SOSUFS) and a symbiotic organism search-based clustering (SOSC) algorithm to generate the optimal feature subset for more accurate clustering. The efficiency and robustness of the proposed algorithm are investigated on benchmark datasets. The SOSUFS method, combined with SOSC, demonstrated the highest f-measure, whereas the KHCluster method resulted in the lowest f-measure. SOSFS effectively reduced the number of features by more than half. The proposed symbiotic organisms search-based optimal unsupervised feature-selection (SOSUFS) method, along with search-based optimal clustering (SOSC), was identified as the top-performing clustering approach. Following this, the SOSUFS method demonstrated strong performance. In summary, this empirical study indicates that the proposed algorithm significantly surpasses state-of-the-art algorithms in both efficiency and effectiveness. Unsupervised learning in artificial intelligence involves machine-learning techniques that learn from data without human supervision. Unlike supervised learning, unsupervised machine-learning models work with unlabeled data to uncover patterns and insights independently, without explicit guidance or instruction. [ABSTRACT FROM AUTHOR]

This paper proposes a new approach to defect detection system design focused on exact damaged areas demonstrated through visual data containing gear wheel images. The main advantage of the system is the capability to detect a wide range of patterns of defects occurring in datasets. The methodology is built on three processes that combine different approaches from unsupervised and supervised methods. The first step is a search for anomalies, which is performed by defining the correct areas on the controlled object by using the autoencoder approach. As a result, the differences between the original and autoencoder-generated images are obtained. These are divided into clusters using the clustering method (DBSCAN). Based on the clusters, the regions of interest are subsequently defined and classified using the pre-trained Xception network classifier. The main result is a system capable of focusing on exact defect areas using the sequence of unsupervised learning (autoencoder)–unsupervised learning (clustering)–supervised learning (classification) methods (U2S-CNN). The outcome with tested samples was 177 detected regions and 205 occurring damaged areas. There were 108 regions detected correctly, and 69 regions were labeled incorrectly. This paper describes a proof of concept for defect detection by highlighting exact defect areas. It can be thus an alternative to using detectors such as YOLO methods, reconstructors, autoencoders, transformers, etc. [ABSTRACT FROM AUTHOR]

The stability of Wireless Sensor Networks (WSNs) is a crucial requirement in real-time applications such as military, defense, and other surveillance systems. Clustering in WSNs is one of the most predominant techniques, offering benefits such as minimizing communication time, optimizing energy utilization, lengthening the network lifespan, and ensuring network stability. Moreover, achieving the balance between energy consumption and maintaining network stability is significantly influenced by the cluster size. This research paper addresses the challenges associated with clustered-based routing and cluster formation paradigm, introducing a novel algorithm employing the principle of Artificial Neural Networks (ANN). In particular, the proposed algorithm integrates a hybrid strategy of Self Organizing Map (SOM) and K-mean clustering to form energy-efficient clusters, even ensuring the energy distribution evenly among them. The validity of the proposed algorithm has been confirmed through experimental analysis conducted using MATLAB. The simulation results demonstrate that the hybrid combination of SOM and K-means clustering is highly efficient in minimizing energy consumption and maintaining network stability. The findings also reveal an average of 80% stable network lifetime and achieve a packet reception ratio (PRR) of 98% which is much higher than two other protocols i.e. LEACH and MODLEACH protocols. [ABSTRACT FROM AUTHOR]

Copyright of Revista Científica is the property of Revista Cientifica, Universidad Distrital Francisco Jose de Caldas and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)