A New-Fangled FES-k-Means Clustering Algorithm for Disease Discovery and Visual Analytics

<p/> <p>The central purpose of this study is to further evaluate the quality of the performance of a new algorithm. The study provides additional evidence on this algorithm that was designed to increase the overall efficiency of the original <it>k</it>-means clustering technique&#8212;the Fast, Efficient, and Scalable <it>k</it>-means algorithm (<it>FES-k</it>-means). The <it>FES-k</it>-means algorithm uses a hybrid approach that comprises the <it>k-d</it> tree data structure that enhances the nearest neighbor query, the original <it>k</it>-means algorithm, and an adaptation rate proposed by Mashor. This algorithm was tested using two real datasets and one synthetic dataset. It was employed twice on all three datasets: once on data trained by the innovative MIL-SOM method and then on the actual untrained data in order to evaluate its competence. This two-step approach of data training prior to clustering provides a solid foundation for knowledge discovery and data mining, otherwise unclaimed by clustering methods alone. The benefits of this method are that it produces clusters similar to the original <it>k</it>-means method at a much faster rate as shown by runtime comparison data; and it provides efficient analysis of large geospatial data with implications for disease mechanism discovery. From a disease mechanism discovery perspective, it is hypothesized that the linear-like pattern of elevated blood lead levels discovered in the city of Chicago may be spatially linked to the city's water service lines.</p

Traveling Salesman Problem

This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering

Optimizing the performance of an integrated process planning and scheduling problem: an AIS-FLC based approach

The present market scenario demands an integration of process planning and scheduling to stay competitive with others. In the present work, an integrated process planning and scheduling model encapsulating the salient features of outsourcing strategy has been proposed. The paper emphasizes on the role of outsourcing strategy in optimizing the performance of enterprises in rapidly changing environment. In the present work authors have proposed an artificial immune system based AIS-FLC algorithm embedded with the fuzzy logic controller to solve the complex problem prevailing under such scenario, while simultaneously optimizing the performance. The authors have shown the efficacy of the proposed algorithm by comparing the results with other random search methods

Event-Driven Technologies for Reactive Motion Planning: Neuromorphic Stereo Vision and Robot Path Planning and Their Application on Parallel Hardware

Die Robotik wird immer mehr zu einem Schlüsselfaktor des technischen Aufschwungs. Trotz beeindruckender Fortschritte in den letzten Jahrzehnten, übertreffen Gehirne von Säugetieren in den Bereichen Sehen und Bewegungsplanung noch immer selbst die leistungsfähigsten Maschinen. Industrieroboter sind sehr schnell und präzise, aber ihre Planungsalgorithmen sind in hochdynamischen Umgebungen, wie sie für die Mensch-Roboter-Kollaboration (MRK) erforderlich sind, nicht leistungsfähig genug. Ohne schnelle und adaptive Bewegungsplanung kann sichere MRK nicht garantiert werden. Neuromorphe Technologien, einschließlich visueller Sensoren und Hardware-Chips, arbeiten asynchron und verarbeiten so raum-zeitliche Informationen sehr effizient. Insbesondere ereignisbasierte visuelle Sensoren sind konventionellen, synchronen Kameras bei vielen Anwendungen bereits überlegen. Daher haben ereignisbasierte Methoden ein großes Potenzial, schnellere und energieeffizientere Algorithmen zur Bewegungssteuerung in der MRK zu ermöglichen. In dieser Arbeit wird ein Ansatz zur flexiblen reaktiven Bewegungssteuerung eines Roboterarms vorgestellt. Dabei wird die Exterozeption durch ereignisbasiertes Stereosehen erreicht und die Pfadplanung ist in einer neuronalen Repräsentation des Konfigurationsraums implementiert. Die Multiview-3D-Rekonstruktion wird durch eine qualitative Analyse in Simulation evaluiert und auf ein Stereo-System ereignisbasierter Kameras übertragen. Zur Evaluierung der reaktiven kollisionsfreien Online-Planung wird ein Demonstrator mit einem industriellen Roboter genutzt. Dieser wird auch für eine vergleichende Studie zu sample-basierten Planern verwendet. Ergänzt wird dies durch einen Benchmark von parallelen Hardwarelösungen wozu als Testszenario Bahnplanung in der Robotik gewählt wurde. Die Ergebnisse zeigen, dass die vorgeschlagenen neuronalen Lösungen einen effektiven Weg zur Realisierung einer Robotersteuerung für dynamische Szenarien darstellen. Diese Arbeit schafft eine Grundlage für neuronale Lösungen bei adaptiven Fertigungsprozesse, auch in Zusammenarbeit mit dem Menschen, ohne Einbußen bei Geschwindigkeit und Sicherheit. Damit ebnet sie den Weg für die Integration von dem Gehirn nachempfundener Hardware und Algorithmen in die Industrierobotik und MRK

Extensions and applications of neuro-immune network

Orientadoesr: Fernando José Von Zuben, Leandro Nunes de CastroDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: Esta dissertação propõe a extensão e desenvolvimento de ferramentas imuno-inspiradas. As ferramentas desenvolvidas destinam-se à resolução de problemas de agrupamento e classificação de dados com atributos binários ou reais. Inspirados em idéias advindas do sistema imunológico, os algoritmos propostos apresentam robustez e soluções parcimoniosas. Uma característica comum presente nas ferramentas desenvolvidas é a definição automática do número de protótipos por meio de estágios de clonagem e poda. Baseado na projeção de protótipos, empregando uma técnica de escalonamento multidimensional, desenvolveu-se uma ferramenta de visualização de redes imunológicas com dados numéricos multivariados, com o propósito de obter uma descrição da estrutura global dos grupos, visualizar a presença e forma de grupos, descobrir protótipos pouco representativos e identificar outliers. Por fim, a aplicação de um algoritmo proposto em conjunto com uma heurística desenvolvida e um algoritmo de busca local iterativa solucionou de forma inovadora um problema relacionado à área de equalização de canais em telecomunicaçõesAbstract: This thesis considers the extension and development of immune-inspired tools. The developed tools are devoted to the resolution of clustering and classification problems with binary or real-valued data attributes. Inspired by ideas of the immune system, the considered algorithms have produced robust and parsimonious solutions. A common feature in the developed tools is the automatic definition of the number of prototypes by means of cloning and pruning stages. Based on the projection of prototypes, using a technique of multidimensional scaling, a visualization tool of immune networks with multivariate numerical data was developed, making it possible to get a description of the global structure of the groups, to visualize the presence and form of groups, to discover low representative prototypes and to identify outliers. Finally, a device composed of one of the tools considered above, a dedicated heuristic and an algorithm for iterative local search was developed. The application of this device solved in an innovative way a problem related to channel equalizationMestradoEngenharia de Computaçã

Trajectory prediction of moving objects by means of neural networks

Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 1997Includes bibliographical references (leaves: 103-105)Text in English; Abstract: Turkish and Englishviii, 105 leavesEstimating the three-dimensional motion of an object from a sequence of object positions and orientation is of significant importance in variety of applications in control and robotics. For instance, autonomous navigation, manipulation, servo, tracking, planning and surveillance needs prediction of motion parameters. Although "motion estimation" is an old problem (the formulations date back to the beginning of the century), only recently scientists have provided with the tools from nonlinear system estimation theory to solve this problem eural Networks are the ones which have recently been used in many nonlinear dynamic system parameter estimation context. The approximating ability of the neural network is used to identifY the relation between system variables and parameters of a dynamic system. The position, velocity and acceleration of the object are estimated by several neural networks using the II most recent measurements of the object coordinates as input to the system Several neural network topologies with different configurations are introduced and utilized in the solution of the problem. Training schemes for each configuration are given in detail. Simulation results for prediction of motion having different characteristics via different architectures with alternative configurations are presented comparatively

Transforming Graph Representations for Statistical Relational Learning

Relational data representations have become an increasingly important topic due to the recent proliferation of network datasets (e.g., social, biological, information networks) and a corresponding increase in the application of statistical relational learning (SRL) algorithms to these domains. In this article, we examine a range of representation issues for graph-based relational data. Since the choice of relational data representation for the nodes, links, and features can dramatically affect the capabilities of SRL algorithms, we survey approaches and opportunities for relational representation transformation designed to improve the performance of these algorithms. This leads us to introduce an intuitive taxonomy for data representation transformations in relational domains that incorporates link transformation and node transformation as symmetric representation tasks. In particular, the transformation tasks for both nodes and links include (i) predicting their existence, (ii) predicting their label or type, (iii) estimating their weight or importance, and (iv) systematically constructing their relevant features. We motivate our taxonomy through detailed examples and use it to survey and compare competing approaches for each of these tasks. We also discuss general conditions for transforming links, nodes, and features. Finally, we highlight challenges that remain to be addressed

Coding Strategies for Genetic Algorithms and Neural Nets

The interaction between coding and learning rules in neural nets (NNs), and between coding and genetic operators in genetic algorithms (GAs) is discussed. The underlying principle advocated is that similar things in "the world" should have similar codes. Similarity metrics are suggested for the coding of images and numerical quantities in neural nets, and for the coding of neural network structures in genetic algorithms. A principal component analysis of natural images yields receptive fields resembling horizontal and vertical edge and bar detectors. The orientation sensitivity of the "bar detector" components is found to match a psychophysical model, suggesting that the brain may make some use of principal components in its visual processing. Experiments are reported on the effects of different input and output codings on the accuracy of neural nets handling numeric data. It is found that simple analogue and interpolation codes are most successful. Experiments on the coding of image data demonstrate the sensitivity of final performance to the internal structure of the net. The interaction between the coding of the target problem and reproduction operators of mutation and recombination in GAs are discussed and illustrated. The possibilities for using GAs to adapt aspects of NNs are considered. The permutation problem, which affects attempts to use GAs both to train net weights and adapt net structures, is illustrated and methods to reduce it suggested. Empirical tests using a simulated net design problem to reduce evaluation times indicate that the permutation problem may not be as severe as has been thought, but suggest the utility of a sorting recombination operator, that matches hidden units according to the number of connections they have in common. A number of experiments using GAs to design network structures are reported, both to specify a net to be trained from random weights, and to prune a pre-trained net. Three different coding methods are tried, and various sorting recombination operators evaluated. The results indicate that appropriate sorting can be beneficial, but the effects are problem-dependent. It is shown that the GA tends to overfit the net to the particular set of test criteria, to the possible detriment of wider generalisation ability. A method of testing the ability of a GA to make progress in the presence of noise, by adding a penalty flag, is described

Autonomously Reconfigurable Artificial Neural Network on a Chip

Artificial neural network (ANN), an established bio-inspired computing paradigm, has proved very effective in a variety of real-world problems and particularly useful for various emerging biomedical applications using specialized ANN hardware. Unfortunately, these ANN-based systems are increasingly vulnerable to both transient and permanent faults due to unrelenting advances in CMOS technology scaling, which sometimes can be catastrophic. The considerable resource and energy consumption and the lack of dynamic adaptability make conventional fault-tolerant techniques unsuitable for future portable medical solutions. Inspired by the self-healing and self-recovery mechanisms of human nervous system, this research seeks to address reliability issues of ANN-based hardware by proposing an Autonomously Reconfigurable Artificial Neural Network (ARANN) architectural framework. Leveraging the homogeneous structural characteristics of neural networks, ARANN is capable of adapting its structures and operations, both algorithmically and microarchitecturally, to react to unexpected neuron failures. Specifically, we propose three key techniques --- Distributed ANN, Decoupled Virtual-to-Physical Neuron Mapping, and Dual-Layer Synchronization --- to achieve cost-effective structural adaptation and ensure accurate system recovery. Moreover, an ARANN-enabled self-optimizing workflow is presented to adaptively explore a "Pareto-optimal" neural network structure for a given application, on the fly. Implemented and demonstrated on a Virtex-5 FPGA, ARANN can cover and adapt 93% chip area (neurons) with less than 1% chip overhead and O(n) reconfiguration latency. A detailed performance analysis has been completed based on various recovery scenarios

Unsupervised methods of classifying remotely sensed imges using Kohonen self-organizing maps

Orientadores: Marcio Luiz de Andrade Netto, Jose Alfredo Ferreira CostaAcompanha Anexo A: Midia com informações adicionais em CD-RTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de ComputaçãoResumo: Esta tese propõe novas metodologias de classificação não-supervisionada de imagens de sensoriamento remoto que particularmente exploram as características e propriedades do Mapa Auto-organizável de Kohonen (SOM - Self-Organizing Map). O ponto chave dos métodos de classificação propostos é realizar a análise de agrupamentos das imagens através do mapeamento produzido pelo SOM, ao invés de trabalhar diretamente com os padrões originais das cenas. Tal estratégia reduz significativamente a complexidade da análise dos dados, tornando possível a utilização de técnicas normalmente consideradas computacionalmente inviáveis para o processamento de imagens de sensoriamento remoto, como métodos de agrupamentos hierárquicos e índices de validação de agrupamentos. Diferentemente de outras abordagens, nas quais o SOM é utilizado como ferramenta de auxílio visual para a detecção de agrupamentos, nos métodos de classificação propostos, mecanismos para analisar de maneira automática o arranjo de neurônios de um SOM treinado são aplicados e aprimorados com o objetivo de encontrar as melhores partições para os conjuntos de dados das imagens. Baseando-se nas propriedades estatísticas do SOM, modificações nos cálculos de índices de validação agrupamentos são propostas com o objetivo de reduzir o custo computacional do processo de classificação das imagens. Técnicas de análise de textura em imagens são aplicadas para avaliar e filtrar amostras de treinamento e/ou protótipos do SOM que correspondem a regiões de transição entre classes de cobertura terrestre. Informações espaciais a respeito dos protótipos do SOM, além das informações de distância multiespectral, também são aplicadas em critérios de fusão de agrupamentos procurando facilitar a discriminação de classes de cobertura terrestre que apresentam alto grau de similaridade espectral. Resultados experimentais mostram que os métodos de classificação propostos apresentam vantagens significativas em relação às técnicas de classificação não-supervisionada mais freqüentemente utilizadas na área de sensoriamento remoto.Abstract: This thesis proposes new methods of unsupervised classification for remotely sensed images which particularly exploit the characteristics and properties of the Kohonen Self-Organizing Map (SOM). The key point is to execute the clustering process through a set of prototypes of SOM instead of analyzing directly the original patterns of the image. This strategy significantly reduces the complexity of data analysis, making it possible to use techniques that have not usually been considered computationally viable for processing remotely sensed images, such as hierarchical clustering methods and cluster validation indices. Unlike other approaches in which SOM is used as a visual tool for detection of clusters, the proposed classification methods automatically analyze the neurons grid of a trained SOM in order to find better partitions for data sets of images. Based on the statistical properties of the SOM, clustering validation indices calculated in a modified manner are proposed with the aim of reducing the computational cost of the classification process of images. Image texture analysis techniques are applied to evaluate and filter training samples and/or prototypes of the SOM that correspond to transition regions between land cover classes. Spatial information about the prototypes of the SOM, in addition to multiespectral distance information, are also incorporated in criteria for merging clusters with aim to facilitate the discrimination of land cover classes which have high spectral similarity. Experimental results show that the proposed classification methods present significant advantages when compared to unsupervised classification techniques frequently used in remote sensing.DoutoradoEngenharia de ComputaçãoDoutor em Engenharia Elétric