13 research outputs found

    Evolving, dynamic clustering of spatio/spectro-temporal data in 3D spiking neural network models and a case study on EEG data

    Get PDF
    Clustering is a fundamental data processing technique. While clustering of static (vector based) data and of fixed window size time series have been well explored, dynamic clustering of spatiotemporal data has been little researched if at all. Especially when patterns of changes (events) in the data across space and time have to be captured and understood. The paper presents novel methods for clustering of spatiotemporal data using the NeuCube spiking neural network (SNN) architecture. Clusters of spatiotemporal data were created and modified on-line in a continuous, incremental way, where spatiotemporal relationships of changes in variables are incrementally learned in a 3D SNN model and the model connectivity and spiking activity are incrementally clustered. Two clustering methods were proposed for SNN, one performed during unsupervised and one—during supervised learning models. Before submitted to the models, the data is encoded as spike trains, a spike representing a change in the variable value (an event). During the unsupervised learning, the cluster centres were predefined by the spatial locations of the input data variables in a 3D SNN model. Then clusters are evolving during the learning, i.e. they are adapted continuously over time reflecting the dynamics of the changes in the data. In the supervised learning, clusters represent the dynamic sequence of neuron spiking activities in a trained SNN model, specific for a particular class of data or for an individual instance. We illustrate the proposed clustering method on a real case study of spatiotemporal EEG data, recorded from three groups of subjects during a cognitive task. The clusters were referred back to the brain data for a better understanding of the data and the processes that generated it. The cluster analysis allowed to discover and understand differences on temporal sequences and spatial involvement of brain regions in response to a cognitive task

    Evolving fuzzy classifier for novelty detection and landmark recognition by mobile robots

    No full text
    In this chapter, an approach to real-time landmark recognition and simultaneous classifier design for mobile robotics is introduced. The approach is based on the recently developed evolving fuzzy systems (EFS) method [1], which is based on subtractive clustering method [2] and its on-line evolving extension called eClustering [1]. When the robot travels in an unknown environment, the landmarks are automatically deteced and labelled by the EFS-based self-organizing classifier (eClass) in real-time. It makes fully autonomous and unsupervised joint landmark detection and recognition without using the absolute coordinates (altitude or longitude), without a communication link or any pretraining. The proposed algorithm is recursive, non-iterative, incremental and thus computationally light and suitable for real-time applications. Experiments carried out in an indoor environment (an office located at InfoLab21, Lancaster University, Lancaster, UK) using a Pioneer3 DX mobile robotic platform equipped with sonar and motion sensors are introduced as a case study. Several ways to use the algorithm are suggested. Further investigations will be directed towards development of a cooperative scheme, tests in a realistic outdoor environment, and in the presence of moving obstacles

    An online pruning strategy for supervised ARTMAP-based neural networks

    Full text link
    Identifying an appropriate architecture of an artificial neural network (ANN) for a given task is important because learning and generalisation of an ANN is affected by its structure. In this paper, an online pruning strategy is proposed to participate in the learning process of two constructive networks, i.e. fuzzy ARTMAP (FAM) and fuzzy ARTMAP with dynamic decay adjustment (FAMDDA), and the resulting hybrid networks are called FAM/FAMDDA with temporary nodes (i.e. FAM-T and FAMDDA-T, respectively). FAM-T and FAMDDA-T possess a capability of reducing the network complexity online by removing unrepresentative neurons. The performances of FAM-T and FAMDDA-T are evaluated and compared with those of FAM and FAMDDA using a total of 13 benchmark data sets. To demonstrate the applicability of FAM-T and FAMDDA-T, a real fault detection and diagnosis task in a power plant is tested. The results from both benchmark studies and real-world application show that FAMDDA-T and FAM-T are able to yield satisfactory classification performances, with the advantage of having parsimonious network structures.<br /
    corecore