External Support Vector Machine Clustering

The external-Support Vector Machine (SVM) clustering algorithm clusters data vectors with no a priori knowledge of each vector\u27s class. The algorithm works by first running a binary SVM against a data set, with each vector in the set randomly labeled, until the SVM converges. It then relabels data points that are mislabeled and a large distance from the SVM hyperplane. The SVM is then iteratively rerun followed by more label swapping until no more progress can be made. After this process, a high percentage of the previously unknown class labels of the data set will be known. With sub-cluster identification upon iterating the overall algorithm on the positive and negative clusters identified (until the clusters are no longer separable into sub-clusters), this method provides a way to cluster data sets without prior knowledge of the data\u27s clustering characteristics, or the number of clusters

External Support Vector Machine Clustering

The external-Support Vector Machine (SVM) clustering algorithm clusters data vectors with no a priori knowledge of each vector\u27s class. The algorithm works by first running a binary SVM against a data set, with each vector in the set randomly labeled, until the SVM converges. It then relabels data points that are mislabeled and a large distance from the SVM hyperplane. The SVM is then iteratively rerun followed by more label swapping until no more progress can be made. After this process, a high percentage of the previously unknown class labels of the data set will be known. With sub-cluster identification upon iterating the overall algorithm on the positive and negative clusters identified (until the clusters are no longer separable into sub-clusters), this method provides a way to cluster data sets without prior knowledge of the data\u27s clustering characteristics, or the number of clusters

A SURVEY ON COLOR IMAGE SEGMENTATION THROUGH LEAKY INTEGRATE AND FIRE MODEL OF SPIKING NEURAL NETWORKS

Neurological research shows that the biological neurons store information in the timing of spikes. Spiking neural networks are the third generation of neural networks which take into account the precise firing time of neurons for information encoding. In SNNs, computation is performed in the temporal (time related) domain and relies on the timings between spikes. The leaky integrate-and-fire neuron is probably the best-known example of a formal spiking neuron model. In this paper, we have simulated LIF model of SNN for performing the image segmentation using K-Means clustering. Clustering can be termed here as a grouping of similar images in the database. Clustering is done based on different attributes of an image such as size, color, texture etc. The purpose of clustering is to get meaningful result, effective storage and fast retrieval in various areas. Image segmentation is the first step and also one of the most critical tasks of image analysis .Because of its simplicity and efficiency, clustering approach is used for the segmentation of (textured) natural images. After the extraction of the image features using wavelet; the feature samples, handled as vectors, are grouped together in compact but well-separated clusters corresponding to each class of the image. Simulation results therefore demonstrate how SNN can be applied with efficacy in Image Segmentation

Service workload patterns for QoS-driven cloud resource management

Cloud service providers negotiate SLAs for customer services they offer based on the reliability of performance and availability of their lower-level platform infrastructure. While availability management is more mature, performance management is less reliable. In order to support a continuous approach that supports the initial static infrastructure configuration as well as dynamic reconfiguration and auto-scaling, an accurate and efficient solution is required. We propose a prediction technique that combines a workload pattern mining approach with a traditional collaborative filtering solution to meet the accuracy and efficiency requirements. Service workload patterns abstract common infrastructure workloads from monitoring logs and act as a part of a first-stage high-performant configuration mechanism before more complex traditional methods are considered. This enhances current reactive rule-based scalability approaches and basic prediction techniques by a hybrid prediction solution. Uncertainty and noise are additional challenges that emerge in multi-layered, often federated cloud architectures. We specifically add log smoothing combined with a fuzzy logic approach to make the prediction solution more robust in the context of these challenges

An Informed Long-term Forecasting Method for Electrical Distribution Network Operators

Northern Powergrid (NPG) is an electrical distribution network operator in the UK servicing Yorkshire and the Northeast of England. Currently they produce long-term eight year forecasts for each substation on the network with an emphasis on an annual maximum demand (MD) figure. The current method used by NPG is thought to oversimplify the problem and does not give enough insight into changes in substation demand. In order to inform their current forecast, the novel CL-ANFIS method uses a combination of machine learning techniques for both forecasting and general insight to the drivers of demand. Also introduced here are novel techniques for determination of MD at NPG and methods for handling load transfer periods. In order to address a problem of this size, a twofold approach is taken. One is to address the drivers of demand such as weather, economic or demographic data sets through the use of statistics and machine learning techniques. The other is to address the long-term forecasting problem with a transparent technique that can aid in explaining the drivers of demand on any given substation. Techniques used include cluster analysis on demographic data sets in addition to ANFIS as a forecasting method. The results of the novel CL-ANFIS method are compared against the current NPG forecast and show how more insight into substation demand profiles can drive the decision-making process. This is done through a combination of using a tailored customer database for NPG and leveraging the information provided by the membership functions of ANFIS

Circumventing the fuzzy type reduction for autonomous vehicle controller

Fuzzy type-2 controllers can easily deal with systems nonlinearity and utilise humans’ expertise to solve many complex control problems; they are also very good at processing uncertainty, which exists in many robotic systems, such as autonomous vehicles. However, their computational cost is high, especially at the type reduction stage. In this research, it is aimed to reduce the computation cost of the type reduction stage, thus to facilitate faster performance speed and increase the number of actions able to be operated in one microprocessor. Proposed here are adaptive integration principles with a binary successive search technique to locate the straight or semi-straight segments of a fuzzy set, thus to use them in achieving faster weighted average computation. This computation is very important because it runs frequently in many type reductions. A variable adaptation rate is suggested during the type reduction iterations to reduce the computation cost further. The influence of the proposed approaches on the fuzzy type-2 controller’s error has been mathematically analysed and then experimentally measured using a wall-following behaviour, which is the most important action for many autonomous vehicles. The resultant execution time-gain of the proposed technique has reached to 200%. This evaluated with respect to the execution time of the original, unmodified, type reduction procedure. This study develops a new accelerated version of the enhanced Karnik-Mendel type reducer by using better initialisations and better indexing scheme. The resulting performance time-gain reached 170%, with respect to the original version. A further cut in the type reduction time is achieved by proposing a One-Go type reduction procedure. This technique can reduce multiple sets altogether in one pass, thus eliminating much of the redundant calculations needed to carry out the reduction individually. All the proposed type reduction enhancements were evaluated in terms of their execution time-gain and performance error using every possible fuzzy firing level combination. Tests were then performed using a real autonomous vehicle, navigates in a relatively complex arena field with acute, right, obtuse, and reflex angled corners, to assure evaluating wide variety of operation conditions. A simplified state hold technique using Schmitt-trigger principles and dynamic sense pattern control was suggested and implemented to assure small rule base size and to obtain more accurate evaluation of the type reduction stages

Exploration of Subjective Color Perceptual-Ability by EEG-Induced Type-2 Fuzzy Classifiers

Perceptual-ability informally refers to the ability of a person to recognize a stimulus. This paper deals with color perceptual-ability measurement of subjects using brain response to basic color (red, green and blue) stimuli. It also attempts to determine subjective ability to recognize the base colors in presence of noise tolerance of the base colors, referred to as recognition tolerance. Because of intra- and inter-session variations in subjective brain signal features for a given color stimulus, there exists uncertainty in perceptual-ability. In addition, small variations in the color stimulus result in wide variations in brain signal features, introducing uncertainty in perceptual-ability of the subject. Type-2 fuzzy logic has been employed to handle the uncertainty in color perceptual-ability measurements due to a) variations in brain signal features for a given color, and b) the presence of colored noise on the base colors. Because of limited power of uncertainty management of interval type-2 fuzzy sets and high computational overhead of its general type-2 counterpart, we developed a semi-general type-2 fuzzy classifier to recognize the base color. It is important to note that the proposed technique transforms a vertical slice based general type-2 fuzzy set into an equivalent interval type-2 counterpart to reduce the computational overhead, without losing the contributions of the secondary memberships. The proposed semi-general type-2 fuzzy sets induced classifier yields superior performance in classification accuracy with respect to existing type-1, type-2 and other well-known classifiers. The brain-understanding of a perceived base or noisy base colors is also obtained by exact low resolution electromagnetic topographic analysis (e-LORETA) software. This is used as the reference for our experimental results of the semi-general type-2 classifier in color perceptual-ability detection. Statistical tests undertaken confirm the superiority of the proposed classifier over its competitors. The proposed technique is expected to have interesting applications in identifying people with excellent color perceptual-ability for chemical, pharmaceutical and textile industries

Deep Learning of Explainable EEG Patterns as Dynamic Spatiotemporal Clusters and Rules in a Brain-Inspired Spiking Neural Network.

The paper proposes a new method for deep learning and knowledge discovery in a brain-inspired Spiking Neural Networks (SNN) architecture that enhances the model’s explainability while learning from streaming spatiotemporal brain data (STBD) in an incremental and on-line mode of operation. This led to the extraction of spatiotemporal rules from SNN models that explain why a certain decision (output prediction) was made by the model. During the learning process, the SNN created dynamic neural clusters, captured as polygons, which evolved in time and continuously changed their size and shape. The dynamic patterns of the clusters were quantitatively analyzed to identify the important STBD features that correspond to the most activated brain regions. We studied the trend of dynamically created clusters and their spike-driven events that occur together in specific space and time. The research contributes to: (1) enhanced interpretability of SNN learning behavior through dynamic neural clustering; (2) feature selection and enhanced accuracy of classification; (3) spatiotemporal rules to support model explainability; and (4) a better understanding of the dynamics in STBD in terms of feature interaction. The clustering method was applied to a case study of Electroencephalogram (EEG) data, recorded from a healthy control group (n = 21) and opiate use (n = 18) subjects while they were performing a cognitive task. The SNN models of EEG demonstrated different trends of dynamic clusters across the groups. This suggested to select a group of marker EEG features and resulted in an improved accuracy of EEG classification to 92%, when compared with all-feature classification. During learning of EEG data, the areas of neurons in the SNN model that form adjacent clusters (corresponding to neighboring EEG channels) were detected as fuzzy boundaries that explain overlapping activity of brain regions for each group of subjects