Made available in DSpace on 2014-12-17T15:47:48Z (GMT). No. of bitstreams: 1 ValeriaMSB.pdf: 564848 bytes, checksum: fbed1b62b5d33ac05db3c528f1bdcf62 (MD5) Previous issue date: 2006-07-14 / The use of intelligent agents in multi-classifier systems appeared in order to making the centralized decision process of a multi-classifier system into a distributed, flexible and incremental one. Based on this, the NeurAge (Neural Agents) system (Abreu et al 2004) was proposed. This system has a superior performance to some combination-centered methods (Abreu, Canuto, and Santana 2005). The negotiation is important to the multiagent system performance, but most of negotiations are defined informaly. A way to formalize the negotiation process is using an ontology. In the context of classification tasks, the ontology provides an approach to formalize the concepts and rules that manage the relations between these concepts. This work aims at using ontologies to make a formal description of the negotiation methods of a multi-agent system for classification tasks, more specifically the NeurAge system. Through ontologies, we intend to make the NeurAge system more formal and open, allowing that new agents can be part of such system during the negotiation. In this sense, the NeurAge System will be studied on the basis of its functioning and reaching, mainly, the negotiation methods used by the same ones. After that, some negotiation ontologies found in literature will be studied, and then those that were chosen for this work will be adapted to the negotiation methods used in the NeurAge. / A utiliza??o de agentes inteligentes em sistemas multi-classificadores surgiu devido ? necessidade de tornar o processo de tomada de decis?o de tais sistemas distribu?do, aut?nomo e flex?vel. Baseado nisso, foi proposto o sistema NeurAge (Neural Agents) (Abreu et al 2004). Este sistema possui um desempenho superior a v?rios m?todos de combina??o centralizados (Abreu, Canuto, and Santana 2005). A negocia??o ? importante para o desempenho de um sistema multiagente, por?m a maioria das negocia??es s?o definidas de maneira informal. Um modo de formalizar as negocia??es ? atrav?s do uso de ontologias. Dentro do contexto de classifica??o de padr?es, o uso de ontologias fornece uma abordagem para formalizar os conceitos e regras que governam as rela??es entre esses conceitos. O objetivo deste trabalho ? utilizar ontologias para formalizar os m?todos de negocia??o de um sistema multiagente para reconhecimento de padr?es, mais especificamente o sistema NeurAge. Atrav?s de ontologias, pretende-se deixar o sistema NeurAge mais formal e aberto, permitindo que novos agentes possam fazer parte de tal sistema durante o processo de negocia??o. Para a realiza??o deste objetivo, o Sistema NeurAge ser? estudado com base em seu funcionamento e focalizando, principalmente, os m?todos de negocia??o utilizados pelo mesmo. Na seq??ncia, algumas ontologias para negocia??o encontradas na literatura ser?o estudadas, e ent?o aquelas que foram escolhidas para este trabalho ser?o adaptadas aos m?todos de negocia??o utilizados no NeurAge.

In a wide range of applications, decisions must be made by combining information from multiple agents with varying levels of trust and expertise. For example, citizen science involves large numbers of human volunteers with differing skills, while disaster management requires aggregating information from multiple people and devices to make timely decisions. This thesis introduces efficient and scalable Bayesian inference for decision combination, allowing us to fuse the responses of multiple agents in large, real-world problems and account for the agents’ unreliability in a principled manner. As the behaviour of individual agents can change significantly, for example if agents move in a physical space or learn to perform an analysis task, this work proposes a novel combination method that accounts for these time variations in a fully Bayesian manner using a dynamic generalised linear model. This approach can also be used to augment agents’ responses with continuous feature data, thus permitting decision-making when agents’ responses are in limited supply. Working with information inferred using the proposed Bayesian techniques, an information-theoretic approach is developed for choosing optimal pairs of tasks and agents. This approach is demonstrated by an algorithm that maintains a trustworthy pool of workers and enables efficient learning by selecting informative tasks. The novel methods developed here are compared theoretically and empirically to a range of existing decision combination methods, using both simulated and real data. The results show that the methodology proposed in this thesis improves accuracy and computational efficiency over alternative approaches, and allows for insights to be determined into the behavioural groupings of agents.

Made available in DSpace on 2014-12-17T15:47:44Z (GMT). No. of bitstreams: 1 RaulBP.pdf: 1811907 bytes, checksum: 007d54350318472b95b8e06144b749a5 (MD5) Previous issue date: 2007-07-27 / Although some individual techniques of supervised Machine Learning (ML), also known as classifiers, or algorithms of classification, to supply solutions that, most of the time, are considered efficient, have experimental results gotten with the use of large sets of pattern and/or that they have a expressive amount of irrelevant data or incomplete characteristic, that show a decrease in the efficiency of the precision of these techniques. In other words, such techniques can t do an recognition of patterns of an efficient form in complex problems. With the intention to get better performance and efficiency of these ML techniques, were thought about the idea to using some types of LM algorithms work jointly, thus origin to the term Multi-Classifier System (MCS). The MCS s presents, as component, different of LM algorithms, called of base classifiers, and realized a combination of results gotten for these algorithms to reach the final result. So that the MCS has a better performance that the base classifiers, the results gotten for each base classifier must present an certain diversity, in other words, a difference between the results gotten for each classifier that compose the system. It can be said that it does not make signification to have MCS s whose base classifiers have identical answers to the sames patterns. Although the MCS s present better results that the individually systems, has always the search to improve the results gotten for this type of system. Aim at this improvement and a better consistency in the results, as well as a larger diversity of the classifiers of a MCS, comes being recently searched methodologies that present as characteristic the use of weights, or confidence values. These weights can describe the importance that certain classifier supplied when associating with each pattern to a determined class. These weights still are used, in associate with the exits of the classifiers, during the process of recognition (use) of the MCS s. Exist different ways of calculating these weights and can be divided in two categories: the static weights and the dynamic weights. The first category of weights is characterizes for not having the modification of its values during the classification process, different it occurs with the second category, where the values suffers modifications during the classification process. In this work an analysis will be made to verify if the use of the weights, statics as much as dynamics, they can increase the perfomance of the MCS s in comparison with the individually systems. Moreover, will be made an analysis in the diversity gotten for the MCS s, for this mode verify if it has some relation between the use of the weights in the MCS s with different levels of diversity / Apesar de algumas t?cnicas individuais de Aprendizado de M?quina (AM) supervisionado, tamb?mconhecidos como classificadores, ou algoritmos de classifica??o, fornecerem solu??es que, na maioria das vezes, s?o consideradas eficientes, h? resultados experimentais obtidos com a utiliza??o de grandes conjuntos de padr?es e/ou que apresentam uma quantidade expressiva de dados incompletos ou caracter?sticas irrelevantes, que mostram uma queda na efic?cia da precis?o dessas t?cnicas. Ou seja, tais t?cnicas n?o conseguem realizar um reconhecimento de padr?es de uma forma eficiente em problemas complexos. Com o intuito de obter um melhor desempenho e efic?cia dessas t?cnicas de AM, pensouse na id?ia de fazer com que v?rios tipos de algoritmos de AM consigam trabalhar conjuntamente, dando assim origem ao termo Sistema Multi-Classificador (SMC). Os SMC s apresentam, como componentes, diferentes algoritmos de AM, chamados de classificadores base, e realizam uma combina??o dos resultados obtidos por estes algoritmos para atingir o resultado final. Para que o SMC tenha um desempenho melhor que os classificadores base, os resultados obtidos por cada classificador base devem apresentar uma determinada diversidade, ou seja, uma diferen?a entre os resultados obtidos por cada classificador que comp?em o sistema. Pode-se dizer que n?o faz sentido ter SMC s cujos classificadores base possuam respostas id?nticas aos padr?es apresentados. Apesar dos SMC s apresentarem melhores resultados que os sistemas executados individualmente, h? sempre a busca para melhorar os resultados obtidos por esse tipo de sistema. Visando essa melhora e uma maior consist?ncia nos resultados, assim como uma maior diversidade dos classificadores de um SMC, v?m sendo recentemente pesquisadas metodologias que apresentam como caracter?sticas o uso de pesos, ou valores de con- fian?a. Esses pesos podem descrever a import?ncia que um determinado classificador forneceu ao associar cada padr?o a uma determinada classe. Esses pesos ainda s?o utilizados, em conjunto com as sa?das dos classificadores, durante o processo de reconhecimento (uso) dos SMC s. Existem diferentes maneiras de se calcular esses pesos e podem ser divididas em duas categorias: os pesos est?ticos e os pesos din?micos. A primeira categoria de pesos se caracteriza por n?o haver a modifica??o de seus valores no decorrer do processo de classifica??o, ao contr?rio do que ocorre com a segunda categoria, onde os valores sofrem modifica??es no decorrer do processo de classifica??o. Neste trabalho ser? feito uma an?lise para verificar se o uso dos pesos, tanto est?ticos quanto din?micos, conseguem aumentar o desempenho dos SMC s em compara??o com estes sistemas executados individualmente. Al?m disso, ser? feita uma an?lise na diversidade obtida pelos SMC s, para dessa forma verificar se h? alguma rela??o entre o uso dos pesos nos SMC s com diferentes n?veis de diversidade

Submitted by João Arthur Martins (joao.arthur@ufpe.br) on 2015-03-12T17:38:41Z No. of bitstreams: 2 Dissertaçao Tiago de Lima.pdf: 1469834 bytes, checksum: 95a0326778b3d0f98bd35a7449d8b92f (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Approved for entry into archive by Daniella Sodre (daniella.sodre@ufpe.br) on 2015-03-13T14:23:38Z (GMT) No. of bitstreams: 2 Dissertaçao Tiago de Lima.pdf: 1469834 bytes, checksum: 95a0326778b3d0f98bd35a7449d8b92f (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Made available in DSpace on 2015-03-13T14:23:38Z (GMT). No. of bitstreams: 2 Dissertaçao Tiago de Lima.pdf: 1469834 bytes, checksum: 95a0326778b3d0f98bd35a7449d8b92f (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Previous issue date: 2013-02-26 / In this dissertation, we present a methodology that aims the automatic construction of multi-classifiers systems based on the combination of selection and fusion. The presented method initially finds an optimum number of clusters for training data set and subsequently determines an ensemble for each cluster found. For model evaluation, the testing data set are submitted to clustering techniques and the nearest cluster to data input will emit a supervised response through its associated ensemble. Self-organizing maps were used in the clustering phase and multilayer perceptrons were used in the classification phase. Adaptive differential evolution has been used in this work in order to optimize the parameters and performance of the different techniques used in the classification and clustering phases. The proposed method, called SFJADE - Selection and Fusion (SF) via Adaptive Differential Evolution (JADE), has been tested on data compression of signals generated by artificial nose sensors and well-known classification problems, including cancer, card, diabetes, glass, heart, horse, soybean and thyroid. The experimental results have shown that the SFJADE method has a better performance than some literature methods while significantly outperforming most of the methods commonly used to construct Multi-Classifier Systems. / Nesta dissertação, nós apresentamos uma metodologia que almeja a construção automática de sistemas de múltiplos classificadores baseados em uma combinação de seleção e fusão. O método apresentado inicialmente encontra um número ótimo de grupos a partir do conjunto de treinamento e subsequentemente determina um comitê para cada grupo encontrado. Para avaliação do modelo, os dados de teste são submetidos à técnica de agrupamento e o grupo mais próximo do dado de entrada irá emitir uma resposta supervisionada por meio de seu comitê associado. Mapas Auto Organizáveis foi usado na fase de agrupamento e Perceptrons de múltiplas camadas na fase de classificação. Evolução Diferencial Adaptativa foi utilizada neste trabalho a fim de otimizar os parâmetros e desempenho das diferentes técnicas utilizadas nas fases de classificação e agrupamento de dados. O método proposto, chamado SFJADE – Selection and Fusion (SF) via Adaptive Differential Evolution (JADE), foi testado em dados gerados para sensores de um nariz artificial e problemas de referência em classificação de padrões, que são: cancer, card, diabetes, glass, heart, heartc e horse. Os resultados experimentais mostraram que SFJADE possui um melhor desempenho que alguns métodos da literatura, além de superar a maioria dos métodos geralmente usados para a construção de sistemas de múltiplos classificadores.