Analyzing DNA Sequences Using Clustering Algorithm

Data mining gives a bright prospective in DNA sequences analysis through its concepts and techniques. This study carries out exploratory data analysis method to cluster DNA sequences.Feature vectors have been developed to map the DNA sequences to a twelve-dimensional vector in the space. Lysozyme, Myoglobin and Rhodopsin protein families have been tested in this space. The results of DNA sequences comparison among homologous sequences give close distances between their characterization vectors which are easily distinguishable from non-homologous in experiment it with a fixed DNA sequence size that does not exceed the maximum length of the shortest DNA sequence. Global comparison for multiple DNA sequences simultaneously presented in the genomic space is the main advantage of this work by applying direct comparison of the corresponding characteristic vectors distances. The novelty of this work is that for the new DNA sequence, there is no need to compare the new DNA sequence with the whole DNA sequences length, just the comparison focused on a fixed number of all the sequences in a way that does not exceed the maximum length of the new DNA sequence. In other words, parts of the DNA sequence can identify the functionality of the DNA sequence, and make it clustered with its family members

An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective

In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to “see” the whole robots’ workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning

The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem

In this paper we introduce a new self-organizing neural network, the Kohonen Network Incorporating Explicit Statistics (KNIES) that is based on Kohonen's Self-Organizing Map (SOM). The primary difference between the SOM and the KNIES is the fact that every iteration in the training phase includes two distinct modules - the attracting module and the dispersing module. As a result of the newly introduced dispersing module the neurons maintain the overall statistical properties of the data points. Thus, although in SOM the neurons individually find their places both statistically and topologically, in KNIES they collectively maintain their mean to be the mean of the data points, which they represent. Although the scheme as it is currently implemented maintains the mean as its invariant, the scheme can easily be generalized to maintain higher order central moments as invariants. The new scheme has been used to solve the Euclidean Travelling Salesman Problem (TSP). Experimental results for problems taken from TSPLIB indicate that it is a very accurate NN strategy for the TSP - probably the most accurate neural solutions available in the literature.In this paper we introduce a new self-organizing neural network, the Kohonen Network Incorporating Explicit Statistics (KNIES) that is based on Kohonen's Self-Organizing Map (SOM). The primary difference between the SOM and the KNIES is the fact that every iteration in the training phase includes two distinct modules - the attracting module and the dispersing module. As a result of the newly introduced dispersing module the neurons maintain the overall statistical properties of the data points. Thus, although in SOM the neurons individually find their places both statistically and topologically, in KNIES they collectively maintain their mean to be the mean of the data points, which they represent. Although the scheme as it is currently implemented maintains the mean as its invariant, the scheme can easily be generalized to maintain highe

Weather corrected electricity demand forecasting

Electricity load forecasts now form an essential part of the routine operations of electricity companies. The complexity of the short-term load forecasting (STLF) problem arises from the multiple seasonal components, the change in consumer behaviour during holiday seasons and other social and religious events that affect electricity consumption. The aim of this research is to produce models for electricity demand that can be used to further the understanding of the dynamics of electricity consumption in South Wales. These models can also be used to produce weather corrected forecasts, and to provide short-term load forecasts. Two novel time series modelling approaches were introduced and developed. Profiles ARIMA (PARIMA) and the Variability Decomposition Method (VDM). PARIMA is a univariate modelling approach that is based on the hierarchical modelling of the different components of the electricity demand series as deterministic profiles, and modelling the remainder stochastic component as ARIMA, serving as a simple yet versatile signal extraction procedure and as a powerful prewhitening technique. The VDM is a robust transfer function modelling approach that is based on decomposing the variability in time series data to that of inherent and external. It focuses the transfer function model building on explaining the external variability of the data and produces models with parameters that are pertinent to the components of the series. Several candidate input variables for the VDM models for electricity demand were investigated, and a novel collective measure of temperature the Fair Temperature Value (FTV) was introduced. The FTV takes into account the changes in variance of the daily maximum and minimum temperatures with time, making it a more suitable explanatory variable for the VDM model. The novel PARIMA and VDM approaches were used to model the quarterly, monthly, weekly, and daily demand series. Both approaches succeeded where existing approaches were unsuccessful and, where comparisons are possible, produced models that were superior in performance. The VDM model with the FTV as its explanatory variable was the best performing model in the analysis and was used for weather correction. Here, weather corrected forecasts were produced using the weather sensitive components of the PARIMA models and the FTV transfer function component of the VDM model