IDR Logo

Please use this identifier to cite or link to this item: http://idr.iitbbs.ac.in/jspui/handle/2008/168
Title: Greedy polynomial neural network for classification task in data mining
Authors: Dash R.
Dash P.K.
Misra B.B.
Panda G.
Keywords: Classification
Data mining
Polynomial Neural Network
Issue Date: 2012
Abstract: In this paper, a greedy polynomial neural network (GPNN) for the task of classification is proposed. Classification task is one of the most studied tasks of data mining. In solving classification task of data mining, the classical algorithm such as Polynomial Neural Network (PNN) takes large computation time because the network grows over the training period i.e. the partial descriptions (PDs) in each layer grows in successive generations. Unlike PNN this proposed work restricts the growth of partial descriptions to a single layer. A greedy technique is then used to select a subset of PDs those who can best map the input-output relation in general. Performance of this model is compared with the results obtained from PNN. Simulation result shows that the performance of GPNN is encouraging for harnessing its power in data mining area and also better in terms of processing time than the PNN model. � 2012 IEEE.
URI: http://dx.doi.org/10.1109/WICT.2012.6409136
http://10.10.32.48:8080/jspui/handle/2008/168
Appears in Collections:Research Publications

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


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