Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0925-2312(96)00032-X
Title: Inductive neural logic network and the SCM algorithm
Authors: Tan, A.-H. 
Teow, L.-N. 
Keywords: incremental clustering
supervised learning
template matching
Issue Date: 5-Feb-1997
Citation: Tan, A.-H., Teow, L.-N. (1997-02-05). Inductive neural logic network and the SCM algorithm. Neurocomputing 14 (2) : 157-176. ScholarBank@NUS Repository. https://doi.org/10.1016/S0925-2312(96)00032-X
Abstract: Neural Logic Network (NLN) is a class of neural network models that performs both pattern processing and logical inferencing. This article presents a procedure for NLN to learn multi-dimensional mapping of both binary and analog data. The procedure, known as the Supervised Clustering and Matching (SCM) algorithm, provides a means of inferring inductive knowledge from databases. In contrast to gradient descent error correction methods, pattern mapping is learned by an inductive NLN using fast and incremental clustering of input and output patterns. In addition, learning/encoding only takes place when both the input and output match criteria are satisfied in a template matching process. To handle sparse and/or noisy data sets, we also present a weighted voting scheme whereby distributed cluster activities combine to produce a final output. The performance of the SCM algorithm, compared with alternative systems, is illustrated on three benchmark problems: (1) mushroom classification, (2) sonar return signal recognition, and (3) sunspot time series prediction.
Source Title: Neurocomputing
URI: http://scholarbank.nus.edu.sg/handle/10635/111182
ISSN: 09252312
DOI: 10.1016/S0925-2312(96)00032-X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

9
checked on Sep 13, 2019

WEB OF SCIENCETM
Citations

5
checked on Sep 13, 2019

Page view(s)

52
checked on Sep 6, 2019

Google ScholarTM

Check

Altmetric


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