Complete lattice projection autoassociative memories

Orientador: Marcos Eduardo Ribeiro do Valle MesquitaTese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação CientíficaResumo: A capacidade do cérebro humano de armazenar e recordar informações por associação tem inspirado o desenvolvimento de modelos matemáticos referidos na literatura como memórias associativas. Em primeiro lugar, esta tese apresenta um conjunto de memórias autoassociativas (AMs) que pertecem à ampla classe das memórias morfológicas autoassociativas (AMMs). Especificamente, as memórias morfológicas autoassociativas de projeção max-plus e min-plus (max-plus e min-plus PAMMs), bem como suas composições, são introduzidas nesta tese. Tais modelos podem ser vistos como versões não distribuídas das AMMs propostas por Ritter e Sussner. Em suma, a max-plus PAMM produz a maior combinação max-plus das memórias fundamentais que é menor ou igual ao padrão de entrada. Dualmente, a min-plus PAMM projeta o padrão de entrada no conjunto de todas combinações min-plus. Em segundo, no contexto da teoria dos conjuntos fuzzy, esta tese propõe novas memórias autoassociativas fuzzy, referidas como classe das max-C e min-D FPAMMs. Uma FPAMM representa uma rede neural morfológica fuzzy com uma camada oculta de neurônios que é concebida para o armazenamento e recordação de conjuntos fuzzy ou vetores num hipercubo. Experimentos computacionais relacionados à classificação de padrões e reconhecimento de faces indicam possíveis aplicações dos novos modelos acima mencionadosAbstract: The human brain¿s ability to store and recall information by association has inspired the development various mathematical models referred to in the literature as associative memories. Firstly, this thesis presents a set of autoassociative memories (AMs) that belong to the broad class of autoassociative morphological memories (AMMs). Specifically, the max-plus and min-plus projection autoassociative morphological memories (max-plus and min-plus PAMMs), as well as their compositions, are introduced in this thesis. These models are non-distributed versions of the AMM models developed by Ritter and Sussner. Briefly, the max-plus PAMM yields the largest max-plus combination of the stored vectors which is less than or equal to the input pattern. Dually, the min-plus PAMM projects the input pattern into the set of all min-plus combinations. In second, in the context of fuzzy set theory, this thesis proposes new fuzzy autoassociative memories mentioned as class of the max-C and min-D FPAMMs. A FPAMM represents a fuzzy morphological neural network with a hidden layer of neurons that is designed for the storage and retrieval of fuzzy sets or vectors on a hypercube. Computational experiments concerning pattern classification and face recognition indicate possible applications of the aforementioned new AM modelsDoutoradoMatematica AplicadaDoutor em Matemática AplicadaCAPE

Induction of formal concepts by lattice computing techniques for tunable classification

This work proposes an enhancement of Formal Concept Analysis (FCA) by Lattice Computing (LC) techniques. More specifically, a novel Galois connection is introduced toward defining tunable metric distances as well as tunable inclusion measure functions between formal concepts induced from hybrid (i.e., nominal and numerical) data. An induction of formal concepts is pursued here by a novel extension of the Karnaugh map, or K-map for short, technique from digital electronics. In conclusion, granular classification can be pursued. The capacity of a classifier based on formal concepts is demonstrated here with promising results. The formal concepts are interpreted as descriptive decisionmaking knowledge (rules) induced from the training data

Quantale-based autoassociative memories with an application to the storage of color images

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)In recent years, lattice computing has emerged as a new paradigm for processing lattice ordered data such as intervals, Type-1 and Type-2 fuzzy sets, vectors, images, symbols, graphs, etc. Here, the word "lattice" refers to a mathematical structure that is defined as a special type of a partially ordered set (poset). In particular, a complete lattice is a poset that contains the infimum as well as the supremum of each of its subsets. In this paper, we introduce the quantale-based associative memory (QAM), where the notion of a quantale is defined as a complete lattice together with a binary operation that commutes with the supremum operator. We show that QAMs can be effectively used for the storage and the recall of color images. (C) 2013 Elsevier B.V. All rights reserved.3414SI15891601Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Fundacao AraucariaConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)CNPq [304240/2011-7, 309608/2009-0]FAPESP [2011/10014-3