Life in the modern century is heavily reliant on an enormous amount of electricity consumption as technology has become the most integral part of daily life. In this context, smart grid systems play a pivotal role to maintain the uninterrupted power supply which needs to be monitored in a timely fashion to keep track of the electric consumers’ usage pattern. The smart meter is the one of smart applications of the smart grid that collects huge amounts of consumer load data on a daily basis which has become a focus for various researchers and analyzers to study load characterization. In this paper, an approach has been proposed to recognize the energy consumption patterns among diverse types of consumers ranging from residential to industrial levels. This approach is worth considering not only for load pattern recognition but also for involving customers in different events such as demand response or peak shaving. In such a way, this analytical mechanism certainly assists in reducing power wastage and saving costs. The proposed methodology is based on a two-fold clustering algorithm with the use of state-of-the-art technology, machine learning. The primary goal is to classify electric customers' data collected from smart meters. Then, analyzing the classified results with an aim to predict power consumption patterns for the customers in the future and making the right energy policy that will benefit both the grid operator and consumers as well.

In actuarial practice, the modeling of total losses tied to a certain policy is a non-trivial task. Traditional parametric models to predict total losses have limitations due to complex distributional features such as extreme skewness, zero inflation, multi-modality, etc., and the lack of explicit solutions for log-normal convolution. In the recent literature, the application of the Dirichlet process mixture for insurance loss has been proposed to eliminate the risk of model misspecification biases; however, the effect of covariates as well as missing covariates in the modeling framework is rarely studied. In this article, we propose novel connections among covariate-dependent Dirichlet process mixture, log-normal convolution, and missing covariate imputation. Assuming an individual loss is log-normally distributed, we develop a log skew-normal Dirichlet process to approximate the log-normal sum. As a generative approach, our framework models the joint of outcome and covariates, which allows to impute missing covariates under the assumption of missingness at random. The performance is assessed by applying our model to several insurance datasets, and the empirical results demonstrate the benefit of our model compared to the existing actuarial models such as the Tweedie-based generalized linear model, generalized additive model, or multivariate adaptive regression spline.

Traveling salesman problems (TSPs) are well-known combinatorial optimization problems, and most existing algorithms are challenging for solving TSPs when its scale is large. To improve the efficiency of solving large-scale TSPs, this work presents a novel adaptive layered clustering framework with improved genetic algorithm (ALC\_IGA). The primary idea behind ALC\_IGA is to break down a large-scale problem into a series of small-scale problems. First, the $k$-means and improved genetic algorithm are used to segment the large-scale TSPs layer by layer and generate the initial solution. Then, the developed two phases simplified $2$-opt algorithm is applied to further improve the quality of the initial solution. The analysis reveals that the computational complexity of the ALC\_IGA is between $O(n\log n)$ and $O(n^2)$. The results of numerical experiments on various TSP instances indicate that, in most situations, the ALC\_IGA surpasses the state-of-the-art algorithms in convergence speed, stability, and solution quality. Specifically, the ALC\_IGA can solve instances with $2 \times 10^5$ nodes within 0.15h, $1.4 \times 10^6$ nodes within 1h, and $2 \times 10^6$ nodes in three dimensions within 1.5h.

Context: Anomaly detection in a data center is a challenging task, having to consider different services on various resources. Current literature shows the application of artificial intelligence techniques to either log files or monitoring data: the former created by services at run time, while the latter produced by specific sensors directly on the physical or virtual machine. Objectives: We propose a model that exploits information both in log files and monitoring data to identify patterns and detect anomalies over time. Methods: The key idea is to use on one side natural language processing solutions to detect problems at service level, extracting words that represent anomalies. Clustering and topic modeling techniques have been used to identify patterns and group them with respect to topics. On the other side time series anomaly detection technique has been applied to sensors data in order to combine problems found in the log files with problems stored in the monitoring data. Results: We have tested our approach on a real data center equipped with log files and monitoring data that can characterize the behaviour of physical and virtual resources in production. We have observed a correspondence between anomalies in log files and monitoring data, e.g. an increase in memory usage or machine load. The results are extremely promising. Conclusion: Our model requires to integrate site administrators' expertise in order to consider all critical scenario in the data center and understand results properly.

Underwater Wireless Sensor Networks (UWSN) enables various oceanic applications which require effective packet transmission. In this case, sparse node distribution, dynamic network topology and inappropriate selection of relay nodes cause void holes. Addressing this problem, we present a Relay based Void Hole Prevention and Repair protocol (ReVOHPR) by multiple Autonomous Underwater Vehicles (AUV) for UWSN. ReVOHPR efficiently identifies and avoids void holes and trap relay nodes to avoid it. ReVOHPR adopts the following operations as Ocean Depth (levels) based Equal Cluster Formation, Dynamic Sleep Scheduling, Virtual Graph based Routing, and Relay Assisted Void Hole Repair. For energy efficient cluster forming, Entropy based Eligibility Ranking (E2R) is presented which elects stable cluster heads (CHs). Then, dynamic sleep scheduling is implemented Dynamic Kernel Kalman Filter (DK2F) algorithm in which Sleep and Active modes based on the nodes current status. Inter Cluster Routing is performed by maximum matching nodes which selects by Dual criteria and also data transmitted to AUV. Finally, void holes are detected and repair by Bi-Criteria Mayfly Optimization (BiCMO) algorithm. The BiCMO focuses on reducing the number of holes, data packet loss and maximizes Quality of Service (QoS) and energy efficiency of the networks. This protocol is timely deal with node failures in packet transmission via multi-hop routing. Simulation is implemented by NS3 (AquaSim module) simulator that evaluates the performance in network simulation for following metrics as average energy consumption, delay, packet delivery rate and throughput.

Various type of soils have been identified based on their electrical and magnetic properties, especially with regards to peat soils. Peat soils are commonly considered as partly decomposed vegetation. In this study, electrical and magnetic properties have been used in K-means clustering to identify layers of peat soils. K-means clustering is a partitioning method that treats observations in the data. Data cores were obtained at every centimeter and examined for their electrical conductivity (σ) and magnetic susceptibility (χ_m) properties. A 291 cm core was obtained at Tegal Arum Village in South Kalimantan, Indonesia. The K-means clustering results indicate two different layers at 148 cm, and this is supported by loss on ignition (LOI) measurements. In the first layers, a 87.65% LOI was found associated with peat soils (above 248 cm). Whereas, in the second layers, there was a 26.11% LOI associated with mineral soils (below 248 cm). The results of this study using K-means clustering can be used to delineate soil layers.

There are many applications of anomaly detection in IoT domain. IoT technology consists of large number of interconnecting digital devices not only generating huge data continuously but also making real-time computations. Since IoT devices are highly exposed due to Internet, they frequently meet with the challenges of illegitimate accesses in the form of intrusions, anomaly, fraud, etc. Identifying these illegitimate accesses in IoT domain can be an exciting research problem. In numerous applications fuzzy clustering and rough set theory have been successfully employed. As the data generated in IoT domains are high-dimensional, the clustering methods used for lower dimensional data cannot be applied efficiently. In this article, mixed approaches consisting of nano topology and fuzzy clustering techniques are proposed for anomaly detection. First of all, the nano topology is generated to find lower dimensional apace and then a couple of well-known fuzzy clustering techniques are employed on it for the efficient anomaly detection. The effectiveness of the proposed approaches is evaluated using time-complexity analysis, experimental studies with a synthetic dataset and a real-life dataset along with comparative studies with traditional fuzzy clustering approaches namely fuzzy c-means clustering (FCM) algorithm, Gustafson-Kessel (GK) Algorithm, Gath-Geva (GG) Algorithm, Mahalanobis Distance based Fuzzy C-Means algorithm (M-FCM), and Common Mahalanobis Distance based Fuzzy C-Means algorithm (CM-FCM). Experimentally, it has been found that the proposed approaches outperform the aforesaid algorithms in terms of detection rates, accuracy rates, false alarm rates and computational times.

Examining the similarity of event environments or surroundings, more precisely settings, provides additional insight in analyzing event sequences as it provides information about the context and potential common factors that may have influenced them. This article proposes a new similarity measure for event setting sequences, which involve the space and time in which events occur. While similarity measures for spatiotemporal event sequences have been studied, the settings and setting sequences have not yet been studied. While modeling event setting sequences we consider spatial and temporal scales to define the bounds of the setting and incorporates dynamic variables alongside static variables. Using a matrix-based representation and an extended Jaccard index we developed new similarity measures that allow for the use of all variable data types. We successfully used these similarity measures coupled with other multivariate statistical analysis approaches in a case study involving setting sequences and pollution event sequences associated with the same monitoring stations, which validate the hypothesis that more similar spatial-temporal settings or setting sequences may generate more similar events or event sequences. In conclusion, these similarity measures have many potential real-world applications, and offer researchers a powerful tool for understanding different factors and their dynamics corresponding to occurrences of spatiotemporal event sequences.

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to currently not provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed `quantum-inspired' algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

The aim of this work is to explain the behaviour of the multiresistance percentage of Pseudomona aeruginosa in some countries of Europe through a multivariate statistical analysis and machine learning validation, using data from the European Antimicrobial Resistance Surveillance System, the World Health Organization and the World Bank. First, we will use a descriptive analysis and a principal components analysis. Then, we use a k-means clustering to determine the countries and regions that are most affected by the antibiotic resistance. Second, we expand the database by adding some socioeconomic, governance and antibiotic-consumption variables. We then run a data panel regression analysis to determine some functions that relates the multiresistance percentage with those new variables. Finally, we use machine learning techniques to validate a pooling panel data case, using XGBoost and random forest algorithms. The results of the data panel analysis indicate that the most important variables for the multiresistance percentage are corruption control and the rule of law. Similar results are found with the machine learning validation analysis, where the human development index is an additional important variable for the multiresistance percentage.

The aerospace industry develops prognosis and health management algorithms to ensure better safety on board. Particularly for in-flight controls where jamming is dreaded. For that, vibration signals are monitored to predict future defect occurrences. However, time series are not labeled according to severity level, and the user can only assess the system health from the data mining procedure. To that extent, we developed a clustering algorithm using a deep neural network core. We encoded the time series into pictures to be feed into an artificially trained neural network: U-NET. From the segmented output, one-dimensional information on cluster frontiers is extracted and filtered without any parameter selection. Then, a kernel density estimation finally transforms the signal into an empirical density. Ultimately, a Gaussian mixture model extracts the latter independent components. The method empowered us to reveal different degrees of severity faults in the studied data, with their respective likelihood without prior knowledge. We compared it to state-of-the-art machine learning algorithms. However, internal clustering results evaluation for time series is an open question. As state-of-the-art indexes were not producing relevant results, we built a new indicator to fulfill this task. We applied the whole method to an actuator consisting of an induction machine linked to a ball screw. This study lays the groundwork for future training of diagnosis and prognosis structures in the health management framework.

This article shows the numerical results and the analysis of households' degree of knowledge in an intermediary city such as Huelva (Andalusia, Spain) about the sustainable use of urban water. It analyzes the needs and values regarding water and the attitudes that households maintain regarding the acceptance of reclaimed water and the use of new technologies to achieve more efficient and sustainable consumption. These results are part of the stages of needfinding and synthesis of Design Thinking methodology, adopted as a framework to improve the efficiency and sustainability of urban water among households in this city. Different statistical analysis techniques of surveys sent to households and the use of clustering are the mathematical tools used to draw conclusions and recommendations that allow the design of a web-based prototype grounded on Product Service Systems methodology, as a tool to improve the engagement of households concerning water and align citizens with the sustainability of their city. Strategies of customization and technological facilitators will be the means to improve the hydrosocial contract among households in Huelva in future later stages of the project.

Crop type and field boundary mapping enable cost-efficient crop management on the field scale and serve as the basis for yield forecasts. Our study uses a data set with crop types and corresponding field borders from the federal state of Bavaria, Germany, as documented by farmers from 2016 to 2018. The study classified corn, winter wheat, barley, sugar beet, potato, and rapeseed as the main crops grown in Upper Bavaria. Corresponding Sentinel-2 data sets include the normalised difference vegetation index (NDVI) and raw band data from 2016 to 2018 for each selected field. The influences of clouds, raw bands, and NDVI on crop type classification are analysed, and the classification algorithms, i.e., support vector machine (SVM) and random forest (RF), are compared. Field boundary detection and extraction are based on non-iterative clustering and a newly developed procedure based on Canny edge detection. The results emphasise the application of Sentinel’s raw bands (B1–B12) and RF, which outperforms SVM with an accuracy of up to 94%. Furthermore, we forecast data for an unknown year, which slightly reduces the classification accuracy. The results demonstrate the usefulness of the proof-of-concept and its readiness for use in real applications.

In recent years, distributed generation technology has developed rapidly. Renewable energy, represented by wind energy and solar energy, has been widely studied and utilized. In order to give full play to the advantages of Distributed Generation (DG) and meet the challenges after power grid access, Active Distribution Network (ADN) is considered as the future development direction of traditional distribution network because of its ability of active management. Nowadays, multi-scenario analysis is widely used in the research of optimal allocation of distributed power supply in active distribution network. Aiming at the problems that may arise when using multi-scenario analysis to plan DG with uncertainties in large-scale scenarios, a scenario reduction method based on improved clustering algorithm is proposed. The validity of the scene reduction method is tested, and the feasibility of the method is verified. At present, there are few studies on the optimal allocation of DG in ADN under fault state. In this paper, comprehensive safety indicators are introduced. Considering the timing characteristics of DG and the influence of active management mode, a bi-level programming model is established, which aims at minimizing the investment of annual life cycle and the removal of active power. The bi-level model is a complex mixed integer non-linear programming model. A hybrid algorithm combining cuckoo search algorithm and primal dual interior point method is used to solve the model. Finally, through the simulation of the IEEE-33 node system, the superiority of the scenario reduction method and the comprehensive security index used in this paper to optimize the configuration of DG in ADN is verified.

In recent decades, the Variational AutoEncoder (VAE) model has shown good potential and capabilities in image generation and dimensionality reduction. The combination of VAE and various machine learning frameworks has also worked effectively in different daily life applications, however its possibility and effectiveness in modern game design has seldom been explored nor assessed. The use of its feature extractor for data clustering was minimally discussed in literature neither. This paper first attempts to explore different mathematical properties of the VAE model, in particular, the theoretical framework of the encoding and decoding processes, the possible achievable lower bound and loss functions of different applications; then applies the established VAE model into generating new game levels within two well-known game settings; as well as validating the effectiveness of its data clustering mechanism with the aid of the Modified National Institute of Standards and Technology (MNIST) database. Respective statistical metrics and assessments were also utilized for evaluating the performance of the proposed VAE model in aforementioned case studies. Based on the statistical and spatial results, several potential drawbacks and future enhancement of the established model were outlined, with the aim of maximizing the strengths and advantages of VAE for future game design tasks and relevant industrial missions.

Applications for Wireless Sensor Networks (WSNs) range from monitoring the environment to automating factories. However, sustained and effective functioning is made more difficult by Sensor Nodes (SNs) limited energy supplies in which optimization is the main issue. So with the aim of increasing the lifespan by decreasing the energy consumption of WSN, Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol with Deep Learning (DL) algorithm is analyzed in this paper. LEACH is a hierarchical mechanism that elects Cluster Heads (CHs) and regularly rotates their positions in order to allocate energy use effectively by using the same amount of energy. However, Deep Learning (DL) method is used to further improve energy optimization. In many applications, the types of Deep Learning methods like Artificial Neural Networks (ANNs) have shown to be very useful. Using this method, WSNs may make more efficient decisions that reduce energy consumption. Data aggregation, duty cycling, and transmission protocols may all be optimized by Deep Learning model's ability to recognize patterns and forecast network behavior. This results in lower energy consumption, a longer lifespan for the network, and better overall performance.

Keywords: Requirements prioritization, Next release plan, Software product planning, Decision support, MoSCoW, AHP, K-Menas, GMM, BIRCH, PAM, Hierarchical, Clustering, Clusters Evaluation

The safe and reliable operation of autonomous vehicles in complex and dynamic environments is heavily dependent upon exteroceptive and proprioceptive sensors. A LiDAR system generates accurate 3D point clouds, which are crucial for the detection, classification, and tracking of multiple targets. LiDAR data, however, presents significant challenges due to its density, noise, and varying sampling rates. In this study, various clustering and MTT techniques for LiDAR point clouds will be identified and classified within the context of autonomous driving to assess the state-of-the-art methods’ key challenges and their performances. We have categorized clustering and MTT methods used in AV applications, identified research gaps and challenges and analyzed existing algorithms and their challenges in detail. Researchers and practitioners in the field of autonomous driving will find this review to be a valuable resource.

We describe a new approach for integrating multiple views of data into a common latent space using non-negative tensor factorization (NTF). This approach, which we refer to as the "Integrated Sources Model" (ISM), consists of two main steps: embedding and analysis. In the embedding step, each view is transformed into a matrix with common non-negative components. In the analysis step, the transformed views are combined into a tensor and decomposed using NTF. Noteworthy, ISM can be extended to process multi-view data sets with missing views. We illustrate the new approach using two examples: the UCI digit dataset and a public cell type gene signatures dataset, to show that multi-view clustering of digits or marker genes by their respective cell type is better achieved with ISM than with other latent space approaches. We also show how the non-negativity and sparsity of the ISM model components enable straightforward interpretations, in contrast to latent factors of mixed signs. Finally, we present potential applications to single-cell multi-omics and spatial mapping, including spatial imaging and spatial transcriptomics, and computational biology, which are currently under evaluation. ISM relies on state-of-the-art algorithms invoked via a simple workflow implemented in a Jupyter Python notebook.

Recently, the Integrated Air Defense System (IADS) has become vital for the defense system as the military defense system is vital for national security. Placing Integrated Air Defense System batteries among locations to protect locations assets is a crucial problem because optimal solutions are needed for interceptor missiles to intercept attacker missiles for maximizing protection of assets across locations or places. In this research, the procedures of using network algorithms along with developing several network algorithms are going to be demonstrated to develop a model for sequential development of seven network securing strategies of placing Surface to Air Missile (SAM) batteries to maximize the protection of assets across locations (based on given asset values) by generating optimal solutions through computation to destroy maximum attacker missiles by using minimum interceptor missiles with given intercept probability. This network securing strategies can be implemented not only for Integrated Air Defense System (IADS) planning but also Counter Air (CA) planning as Integrated Air Defense System (IADS) is conducted with defensive counter air supported by attack operations in offensive counter air.

Mobile phones have become an integral part of our lives in the last two decades, leaving a digital trace of our activities and communication. This study aims to develop a data processing framework to evaluate human mobility and socioeconomic status based on call detail records. The methodology proposed first calculates radius of gyration and entropy for each user, then estimates the socioeconomic status by the price and age of the subscribers' phones. Finally, an unsupervised machine learning algorithm was used to group the cells into clusters based on their mobility and socioeconomic metrics. The research showed differences between Buda and Pest during a large scale social event using mobile phone ages and prices. Additionally, the clustering results revealed homogenous groups of cells around Budapest, with similar mobility and socioeconomic metrics. The main conclusion is that mobile network data combined with mobile phone properties offer a useful tool for characterising urban mobility and socioeconomic status.

A Wireless Body Area Sensor Network (WBASN) is combination of numerous sense nodes, positioned onto/close or inside a person body. Wireless Body Area Sensor Networks (WBASN) is a developing automation trend that exploits wireless sensor nodes to put instantaneous wearable well-being of ill person to improve individual’s existence. The sensor nodes might be used outwardly to observe abundant health parameters (like heart activity, blood pressure and cholesterol) of an ill person at a vital site within hospital. Hence the goal of WBASN is much crucial, enhancing the lifetime of nodes is compulsory to sustain many issues such as utility and efficiency. It is essential to evaluate time that when the first node will die it we want to refresh or change the battery reason is that loss of crucial information is not tolerable. The lifetime is termed as the time interval when a first node dies out due to battery exhaustion. In our proposed protocol life time of a network is the main concern as well other protocol related issues such as throughput, path loss, and residual energy. Bio-sensors are used for deployment on human body. Poisson distribution and equilibrium model techniques have been used for attaining the required results. Multi-hop network topology and random network node deployment used to achieve minimum energy consumption and longer network lifetime.