Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/82220
Type: Artigo de periódico
Title: Morphological perceptrons with competitive learning: Lattice-theoretical framework and constructive learning algorithm
Author: Sussner, P
Esmi, EL
Abstract: A morphological neural network is generally defined as a type of artificial neural network that performs an elementary operation of mathematical morphology at every node, possibly followed by the application of an activation function. The underlying framework of mathematical morphology can be found in lattice theory. With the advent of granular computing, lattice-based neurocomputing models such as morphological neural networks and fuzzy lattice neurocomputing models are becoming increasingly important since many information granules such as fuzzy sets and their extensions, intervals, and rough sets are lattice ordered. In this paper, we present the lattice-theoretical background and the learning algorithms for morphological perceptrons with competitive learning which arise by incorporating a winner-take-all output layer into the original morphological perceptron model. Several well-known classification problems that are available on the internet are used to compare our new model with a range of classifiers such as conventional multi-layer perceptrons, fuzzy lattice neurocomputing models, k-nearest neighbors, and decision trees. (C) 2010 Elsevier Inc. All rights reserved.
Subject: Computational intelligence
Lattice theory
Mathematical morphology
Minimax algebra
Morphological neural network
Morphological perceptron
Competitive neuron
Pattern recognition
Classification
Country: EUA
Editor: Elsevier Science Inc
Rights: fechado
Identifier DOI: 10.1016/j.ins.2010.03.016
Date Issue: 2011
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000288833300011.pdf856.55 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.