De, Rajat K. ; Pal, Sankar K. (2001) A connectionist model for selection of cases Information Sciences, 132 (1-4). pp. 179-194. ISSN 0020-0255
![]()
|
PDF
- Publisher Version
301kB |
Official URL: http://linkinghub.elsevier.com/retrieve/pii/S00200...
Related URL: http://dx.doi.org/10.1016/S0020-0255(01)00070-6
Abstract
The present article describes a method of designing a connectionist model for selection of cases for decision-making problems. The notion of fuzzy similarity is used for selecting the same from overlapping regions. Cases are stored as network parameters. The architecture of the network is adaptively determined through growing and pruning of hidden nodes under supervised training. The effectiveness of the cases, thus selected by the network, is demonstrated for pattern classification problem using 1-NN rule with the cases as the prototypes. Results, along with comparisons, are presented for various artificial and real life data for different parameter values of the similarity function, controlling the number of cases.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Elsevier Science. |
Keywords: | Case-based Reasoning; Fuzzy Similarity; Classification; Node Growing; Node Pruning |
ID Code: | 26128 |
Deposited On: | 06 Dec 2010 13:03 |
Last Modified: | 17 May 2016 09:28 |
Repository Staff Only: item control page