Search results for "Map"
showing 10 items of 3484 documents
Using SOM and PCA for analysing and interpreting data from a P-removal SBR
2008
This paper focuses on the application of Kohonen self-organizing maps (SOM) and principal component analysis (PCA) to thoroughly analyse and interpret multidimensional data from a biological process. The process is aimed at enhanced biological phosphorus removal (EBPR) from wastewater. In this work, SOM and PCA are firstly applied to the data set in order to identify and analyse the relationships among the variables in the process. Afterwards, K-means algorithm is used to find out how the observations can be grouped, on the basis of their similarity, in different classes. Finally, the information obtained using these intelligent tools is used for process interpretation and diagnosis. In the…
A New Linear Initialization in SOM for Biomolecular Data
2009
In the past decade, the amount of data in biological field has become larger and larger; Bio-techniques for analysis of biological data have been developed and new tools have been introduced. Several computational methods are based on unsupervised neural network algorithms that are widely used for multiple purposes including clustering and visualization, i.e. the Self Organizing Maps (SOM). Unfortunately, even though this method is unsupervised, the performances in terms of quality of result and learning speed are strongly dependent from the neuron weights initialization. In this paper we present a new initialization technique based on a totally connected undirected graph, that report relat…
The BioDICE Taverna plugin for clustering and visualization of biological data: a workflow for molecular compounds exploration
2014
Background: In many experimental pipelines, clustering of multidimensional biological datasets is used to detect hidden structures in unlabelled input data. Taverna is a popular workflow management system that is used to design and execute scientific workflows and aid in silico experimentation. The availability of fast unsupervised methods for clustering and visualization in the Taverna platform is important to support a data-driven scientific discovery in complex and explorative bioinformatics applications. Results: This work presents a Taverna plugin, the Biological Data Interactive Clustering Explorer (BioDICE), that performs clustering of high-dimensional biological data and provides a …
Recognizing actions with the associative self-organizing map
2013
When artificial agents interact and cooperate with other agents, either human or artificial, they need to recognize others’ actions and infer their hidden intentions from the sole observation of their surface level movements. Indeed, action and intention understanding in humans is believed to facilitate a number of social interactions and is supported by a complex neural substrate (i.e. the mirror neuron system). Implementation of such mechanisms in artificial agents would pave the route to the development of a vast range of advanced cognitive abilities, such as social interaction, adaptation, and learning by imitation, just to name a few. We present a first step towards a fully-fledged int…
A Comparison between Habituation and Conscience mechanism in Self–Organizing Maps
2006
In this letter, a preliminary study of habituation in self-organizing networks is reported. The habituation model implemented allows us to obtain a faster learning process and better clustering performances. The liabituable neuron is a generalization of the typical neuron and can be used in many self-organizing network models. The habituation mechanism is implemented in a SOM and the clustering performances of the network are compared to the conscience learning mechanism that follows roughly the same principle but is less sophisticated.
Automatic Detection of Hemangioma through a Cascade of Self-organizing Map Clustering and Morphological Operators
2016
Abstract In this paper we propose a method for the automatic detection of hemangioma regions, consisting of a cascade of algorithms: a Self Organizing Map (SOM) for clustering the image pixels in 25 classes (using a 5x5 output layer) followed by a morphological method of reducing the number of classes (MMRNC) to only two classes: hemangioma and non-hemangioma. We named this method SOM-MMRNC. To evaluate the performance of the proposed method we have used Fuzzy C-means (FCM) for comparison. The algorithms were tested on 33 images; for most images, the proposed method and FCM obtain similar overall scores, within one percent of each other. However, in about 18% of the cases, there is a signif…
Hierarchies of Self-Organizing Maps for action recognition
2016
We propose a hierarchical neural architecture able to recognise observed human actions. Each layer in the architecture represents increasingly complex human activity features. The first layer consists of a SOM which performs dimensionality reduction and clustering of the feature space. It represents the dynamics of the stream of posture frames in action sequences as activity trajectories over time. The second layer in the hierarchy consists of another SOM which clusters the activity trajectories of the first-layer SOM and learns to represent action prototypes. The third - and last - layer of the hierarchy consists of a neural network that learns to label action prototypes of the second-laye…
Order Parameters for Self-Organizing Maps
1998
We introduce and discuss different approaches to construct order parameters for Kohonen’s Self-Organizing Maps. As one approach the notion of an order parameter in the sense of Haken’s synergetics is studied and contrasted with organization measures using SOM structure information.
Complexity Selection of the Self-Organizing Map
2002
This paper describes how the complexity of the Self-Organizing Map can be selected using the Minimum Message Length principle. The use of the method in textual data analysis is also demonstrated.
Studying the feasibility of a recommender in a citizen web portal based on user modeling and clustering algorithms
2006
This paper presents a methodology to estimate the future success of a collaborative recommender in a citizen web portal. This methodology consists of four stages, three of them are developed in this study. First of all, a user model, which takes into account some usual characteristics of web data, is developed to produce artificial data sets. These data sets are used to carry out a clustering algorithm comparison in the second stage of our approach. This comparison provides information about the suitability of each algorithm in different scenarios. The benchmarked clustering algorithms are the ones that are most commonly used in the literature: c-Means, Fuzzy c-Means, a set of hierarchical …