Title
Morphological perceptrons with competitive learning: Lattice-theoretical framework and constructive learning algorithm
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.
Year
DOI
Venue
2011
10.1016/j.ins.2010.03.016
Inf. Sci.
Keywords
Field
DocType
morphological neural network,fuzzy set,lattice theory,constructive learning algorithm,morphological perceptrons,fuzzy lattice,competitive learning,lattice-based neurocomputing model,lattice-theoretical framework,artificial neural network,mathematical morphology,original morphological perceptron model,computational intelligence,multi layer perceptron,decision tree,rough set,granular computing,pattern recognition,neural network,winner take all,k nearest neighbor,classification,activation function
Competitive learning,Computational intelligence,Activation function,Algorithm,Fuzzy set,Rough set,Granular computing,Artificial intelligence,Artificial neural network,Perceptron,Machine learning,Mathematics
Journal
Volume
Issue
ISSN
181
10
0020-0255
Citations 
PageRank 
References 
50
1.17
38
Authors
2
Name
Order
Citations
PageRank
Peter Sussner188059.25
Estevão Laureano Esmi29012.01