Inference From Aging Information

For many learning tasks the duration of the data collection can be greater than the time scale for changes of the underlying data distribution. The question we ask is how to include the information that data are aging. Ad hoc methods to achieve this include the use of validity windows that prevent the learning machine from making inferences based on old data. This introduces the problem of how to define the size of validity windows. In this brief, a new adaptive Bayesian inspired algorithm is presented for learning drifting concepts. It uses the analogy of validity windows in an adaptive Bayesian way to incorporate changes in the data distribution over time. We apply a theoretical approach based on information geometry to the classification problem and measure its performance in simulations. The uncertainty about the appropriate size of the memory windows is dealt with in a Bayesian manner by integrating over the distribution of the adaptive window size. Thus, the posterior distribution of the weights may develop algebraic tails. The learning algorithm results from tracking the mean and variance of the posterior distribution of the weights. It was found that the algebraic tails of this posterior distribution give the learning algorithm the ability to cope with an evolving environment by permitting the escape from local traps.

Inovação em recursos naturais: acumulação de capacidade em uma empresa de mineração no Brasil (1994-2008)

Ao longo dos últimos 40 anos tem havido uma profusão de estudos sobre acumulação de capacidades tecnológicas em empresas de economias emergentes. Porém, são escassos os estudos que examinem, de maneira conjunta e de uma perspectiva dinâmica, o relacionamento entre trajetórias de acumulação de capacidades tecnológicas e os mecanismos subjacentes de aprendizagem. São ainda mais escassos estudos sobre este relacionamento em firmas atuando na indústria de processamento de recursos naturais. O interesse neste último está em oferecer uma visão alternativa de alguns autores quando se referem a estas indústrias como 'maduras', de 'baixa tecnologia' ou meramente produtoras de 'commodities' e 'no fim da linha de inovação'. Logo, neste estudo, defende-se que as inovações tecnológicas estão bem presentes em empresas baseadas em processamento de recursos naturais, principalmente em empresas de mineração. Buscando preencher essas lacunas da literatura, examinam-se, nesta dissertação, essas questões à luz de modelos analíticos disponíveis na literatura internacional -, adaptados para o contexto desta dissertação. O modelo para examinar a acumulação de capacidades tecnológicas identifica as capacidades para as funções tecnológicas de processos e organização da produção. Para a análise das fontes de capacidades tecnológicas, utiliza-se, nesta dissertação, o modelo para examinar as estratégias intraorganizacionais que desmembram o processo de aprendizagem em aquisição de conhecimento externo e interno e os convertem do nível individual para o organizacional pela socialização e codificação, com base em suas característicaschave: variedade, intensidade e funcionamento. Esse conjunto de relacionamentos é examinado por meio de estudo de caso simples e de longo prazo (1994-2008) em uma empresa de processamento de recursos naturais (mineração de cobre) no Brasil. Tomando-se por base evidências empíricas qualitativas e quantitativas, colhidas em primeira mão, verificou-se o seguinte. 1. A empresa acumulou capacidade inovadora em processos e organização da produção em Nível Inovador Intermediário, ou seja, a empresa já promove a expansão sistemática da capacidade por meio da manipulação de parâmetros-chave de processo. Verificou-se também que a firma tem potencial para atingir o Nível Inovador Avançado em virtude dos avanços obtidos em seu projeto de biolixiviação de cobre sulfetedo. Este nível não foi atingido porque, ao final da pesquisa, a aplicação comercial bem-sucedida deste projeto ainda não tinha sido comprovada. 2. Os vários processos e mecanismos de aprendizagem tiveram um papel crucial na acumulação desse nível de capacidade inovadora. Especificamente a progressiva incidência e a maneira como os mecanismos de aprendizagem foram criados e geridos na empresa contribuíram decisivamente para criar uma base de conhecimento que pennitiu à empresa desenvolver capacidades tanto para atividades de produção como para atividades de inovação. Não obstante, as evidências também sugerem que estes mesmos tipos de mecanismos não foram suficientes para que a empresa acumulasse capacidades além do nível alcançado. Ou seja, o alcance de níveis mais sofisticados de inovação implica a adoção de mecanismos mais complexos de aprendizagem. Naturalmente, outros fatores, como o comportamento da liderança empresarial, também contribuíram para o acúmulo dessas capacidades, embora este ponto tenha sido examinado aqui de maneira superficial. Esses resultados fazem avançar nosso entendimento sobre as dificuldades e complexidades envolvidas no processo de acumulação de capacidades inovadoras em empresas de economias emergentes. O estudo contribui para mostrar que, se empresas dessa natureza objetivarem acumular níveis inovadores de capacidade tecnológica e, com isso, obter melhor performance competitiva, terão que desenhar estratégias robustas de aprendizagem. Finalmente, o estudo joga luz no entendimento sobre o processo de inovação em empresas em indústrias à base de processamento de recursos naturais, setores estes de grande importância para países ricos em recursos naturais como o Brasil.

Aprendizado por Reforço com Valores deInfluência em Sistemas Multi-Agente

We propose a new paradigm for collective learning in multi-agent systems (MAS) as a solution to the problem in which several agents acting over the same environment must learn how to perform tasks, simultaneously, based on feedbacks given by each one of the other agents. We introduce the proposed paradigm in the form of a reinforcement learning algorithm, nominating it as reinforcement learning with influence values. While learning by rewards, each agent evaluates the relation between the current state and/or action executed at this state (actual believe) together with the reward obtained after all agents that are interacting perform their actions. The reward is a result of the interference of others. The agent considers the opinions of all its colleagues in order to attempt to change the values of its states and/or actions. The idea is that the system, as a whole, must reach an equilibrium, where all agents get satisfied with the obtained results. This means that the values of the state/actions pairs match the reward obtained by each agent. This dynamical way of setting the values for states and/or actions makes this new reinforcement learning paradigm the first to include, naturally, the fact that the presence of other agents in the environment turns it a dynamical model. As a direct result, we implicitly include the internal state, the actions and the rewards obtained by all the other agents in the internal state of each agent. This makes our proposal the first complete solution to the conceptual problem that rises when applying reinforcement learning in multi-agent systems, which is caused by the difference existent between the environment and agent models. With basis on the proposed model, we create the IVQ-learning algorithm that is exhaustive tested in repetitive games with two, three and four agents and in stochastic games that need cooperation and in games that need collaboration. This algorithm shows to be a good option for obtaining solutions that guarantee convergence to the Nash optimum equilibrium in cooperative problems. Experiments performed clear shows that the proposed paradigm is theoretical and experimentally superior to the traditional approaches. Yet, with the creation of this new paradigm the set of reinforcement learning applications in MAS grows up. That is, besides the possibility of applying the algorithm in traditional learning problems in MAS, as for example coordination of tasks in multi-robot systems, it is possible to apply reinforcement learning in problems that are essentially collaborative

Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço

The metaheuristics techiniques are known to solve optimization problems classified as NP-complete and are successful in obtaining good quality solutions. They use non-deterministic approaches to generate solutions that are close to the optimal, without the guarantee of finding the global optimum. Motivated by the difficulties in the resolution of these problems, this work proposes the development of parallel hybrid methods using the reinforcement learning, the metaheuristics GRASP and Genetic Algorithms. With the use of these techniques, we aim to contribute to improved efficiency in obtaining efficient solutions. In this case, instead of using the Q-learning algorithm by reinforcement learning, just as a technique for generating the initial solutions of metaheuristics, we use it in a cooperative and competitive approach with the Genetic Algorithm and GRASP, in an parallel implementation. In this context, was possible to verify that the implementations in this study showed satisfactory results, in both strategies, that is, in cooperation and competition between them and the cooperation and competition between groups. In some instances were found the global optimum, in others theses implementations reach close to it. In this sense was an analyze of the performance for this proposed approach was done and it shows a good performance on the requeriments that prove the efficiency and speedup (gain in speed with the parallel processing) of the implementations performed

Roteamento em Redes de Sensores Sem Fios Com Base Em Aprendizagem Por Reforço

The use of wireless sensor and actuator networks in industry has been increasing past few years, bringing multiple benefits compared to wired systems, like network flexibility and manageability. Such networks consists of a possibly large number of small and autonomous sensor and actuator devices with wireless communication capabilities. The data collected by sensors are sent directly or through intermediary nodes along the network to a base station called sink node. The data routing in this environment is an essential matter since it is strictly bounded to the energy efficiency, thus the network lifetime. This work investigates the application of a routing technique based on Reinforcement Learning s Q-Learning algorithm to a wireless sensor network by using an NS-2 simulated environment. Several metrics like energy consumption, data packet delivery rates and delays are used to validate de proposal comparing it with another solutions existing in the literature

Experimental Active Vibration Control in Truss Structures Considering Uncertainties in System Parameters

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Otimização em comitês de classificadores: uma abordagem baseada em filtro para seleção de subconjuntos de atributos

Traditional applications of feature selection in areas such as data mining, machine learning and pattern recognition aim to improve the accuracy and to reduce the computational cost of the model. It is done through the removal of redundant, irrelevant or noisy data, finding a representative subset of data that reduces its dimensionality without loss of performance. With the development of research in ensemble of classifiers and the verification that this type of model has better performance than the individual models, if the base classifiers are diverse, comes a new field of application to the research of feature selection. In this new field, it is desired to find diverse subsets of features for the construction of base classifiers for the ensemble systems. This work proposes an approach that maximizes the diversity of the ensembles by selecting subsets of features using a model independent of the learning algorithm and with low computational cost. This is done using bio-inspired metaheuristics with evaluation filter-based criteria

Abordagem de construção de arquitetura homogênea para comitês via meta-aprendizagem

In the world we are constantly performing everyday actions. Two of these actions are frequent and of great importance: classify (sort by classes) and take decision. When we encounter problems with a relatively high degree of complexity, we tend to seek other opinions, usually from people who have some knowledge or even to the extent possible, are experts in the problem domain in question in order to help us in the decision-making process. Both the classification process as the process of decision making, we are guided by consideration of the characteristics involved in the specific problem. The characterization of a set of objects is part of the decision making process in general. In Machine Learning this classification happens through a learning algorithm and the characterization is applied to databases. The classification algorithms can be employed individually or by machine committees. The choice of the best methods to be used in the construction of a committee is a very arduous task. In this work, it will be investigated meta-learning techniques in selecting the best configuration parameters of homogeneous committees for applications in various classification problems. These parameters are: the base classifier, the architecture and the size of this architecture. We investigated nine types of inductors candidates for based classifier, two methods of generation of architecture and nine medium-sized groups for architecture. Dimensionality reduction techniques have been applied to metabases looking for improvement. Five classifiers methods are investigated as meta-learners in the process of choosing the best parameters of a homogeneous committee.

In silico network topology-based prediction of gene essentiality

The identification of genes essential for survival is important for the understanding of the minimal requirements for cellular life and for drug design. As experimental studies with the purpose of building a catalog of essential genes for a given organism are time-consuming and laborious, a computational approach which could predict gene essentiality with high accuracy would be of great value. We present here a novel computational approach, called NTPGE (Network Topology-based Prediction of Gene Essentiality), that relies on the network topology features of a gene to estimate its essentiality. The first step of NTPGE is to construct the integrated molecular network for a given organism comprising protein physical, metabolic and transcriptional regulation interactions. The second step consists in training a decision-tree-based machine-learning algorithm on known essential and non-essential genes of the organism of interest, considering as learning attributes the network topology information for each of these genes. Finally, the decision-tree classifier generated is applied to the set of genes of this organism to estimate essentiality for each gene. We applied the NTPGE approach for discovering the essential genes in Escherichia coli and then assessed its performance. (C) 2007 Elsevier B.V. All rights reserved.

Aprendizado não-supervisionado em redes neurais pulsadas de base radial: um estudo da capacidade de agrupamento para a classificação de pixels

Redes neurais pulsadas - redes que utilizam uma codificação temporal da informação - têm despontado como uma promissora abordagem dentro do paradigma conexionista, emergente da ciência cognitiva. Um desses novos modelos é a rede neural pulsada com função de base radial, que é capaz de armazenar informação nos tempos de atraso axonais dos neurônios. Um algoritmo de aprendizado foi aplicado com sucesso nesta rede pulsada, que se mostrou capaz de mapear uma seqüência de pulsos de entrada em uma seqüência de pulsos de saída. Mais recentemente, um método baseado no uso de campos receptivos gaussianos foi proposto para codificar dados constantes em uma seqüência de pulsos temporais. Este método tornou possível a essa rede lidar com dados computacionais. O processo de aprendizado desta nova rede não se encontra plenamente compreendido e investigações mais profundas são necessárias para situar este modelo dentro do contexto do aprendizado de máquinas e também para estabelecer as habilidades e limitações desta rede. Este trabalho apresenta uma investigação desse novo classificador e um estudo de sua capacidade de agrupar dados em três dimensões, particularmente procurando estabelecer seus domínios de aplicação e horizontes no campo da visão computacional.

Variational studies and replica symmetry breaking in the generalization problem of the binary perceptron

We analyze the average performance of a general class of learning algorithms for the nondeterministic polynomial time complete problem of rule extraction by a binary perceptron. The examples are generated by a rule implemented by a teacher network of similar architecture. A variational approach is used in trying to identify the potential energy that leads to the largest generalization in the thermodynamic limit. We restrict our search to algorithms that always satisfy the binary constraints. A replica symmetric ansatz leads to a learning algorithm which presents a phase transition in violation of an information theoretical bound. Stability analysis shows that this is due to a failure of the replica symmetric ansatz and the first step of replica symmetry breaking (RSB) is studied. The variational method does not determine a unique potential but it allows construction of a class with a unique minimum within each first order valley. Members of this class improve on the performance of Gibbs algorithm but fail to reach the Bayesian limit in the low generalization phase. They even fail to reach the performance of the best binary, an optimal clipping of the barycenter of version space. We find a trade-off between a good low performance and early onset of perfect generalization. Although the RSB may be locally stable we discuss the possibility that it fails to be the correct saddle point globally. ©2000 The American Physical Society.

Improving the accuracy of the optimum-path forest supervised classifier for large datasets

In this work, a new approach for supervised pattern recognition is presented which improves the learning algorithm of the Optimum-Path Forest classifier (OPF), centered on detection and elimination of outliers in the training set. Identification of outliers is based on a penalty computed for each sample in the training set from the corresponding number of imputable false positive and false negative classification of samples. This approach enhances the accuracy of OPF while still gaining in classification time, at the expense of a slight increase in training time. © 2010 Springer-Verlag.

OPF-MRF: Optimum-path forest and Markov random fields for contextual-based image classification

Some machine learning methods do not exploit contextual information in the process of discovering, describing and recognizing patterns. However, spatial/temporal neighboring samples are likely to have same behavior. Here, we propose an approach which unifies a supervised learning algorithm - namely Optimum-Path Forest - together with a Markov Random Field in order to build a prior model holding a spatial smoothness assumption, which takes into account the contextual information for classification purposes. We show its robustness for brain tissue classification over some images of the well-known dataset IBSR. © 2013 Springer-Verlag.

Aplicação de redes neurais artificiais no monitoramento da operação de dressagem

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Aplicação de redes neurais artificiais na classificação de padrões filogeográficos com base na variabilidade genômica do DNA mitocondrial

Historicamente, o processo de formação das populações da Amazônia, assim como de todo território brasileiro, envolveu três grupos étnicos principais: o ameríndio, o europeu e o africano. Como conseqüência, estas populações possuem em geral constituição miscigenada do ponto de vista social e biológico. Desde o final do século passado, estudos do DNA mitocondrial (mtDNA) tem sido desenvolvidos com o propósito de estimar a mistura interétnica presente nestas populações. Para isto, é de fundamental importância a classificação de uma determinada linhagem de mtDNA em um dos mais de 250 haplogrupos/subclados propostos na literatura. Com o objetivo de desenvolver um sistema automatizado, preciso e acurado de classificação de seqüências (linhagens) de mtDNA, o presente trabalhou lançou mão da técnica de Redes Neurais Artificiais (RNA’s) tendo como base os estudos de filogeografia. Para esta classificação, foram desenvolvidas quatro redes neurais artificiais diretas, com múltiplas camadas e algoritmo de aprendizagem de retropropagação. As entradas de cada rede equivalem às posições nucleotídicas polimórficas da região hipervariável do DNA mitocondrial, as quais retornam como saída a classificação específica de cada linhagem. Posterior ao treinamento, todas as redes apresentaram índices de acerto de 100%, demonstrando que a técnica de Rede Neural Artificial pode ser utilizada, com êxito, na classificação de padrões filogeográficos com base no DNA mitocondrial.