Eastwood, M. and Gabrys, B., 2006. Lambda as a Complexity Control in Negative Correlation Learning. In: NiSIS'2006 Symposium : 2nd European Symposium on Nature-inspired Smart Information Systems, 29 November - 1 December 2006, Puerta de la Cruz, Tenerife, Spain.
Full text available as:
|PDF - Published Version|
Official URL: http://www.nisis.risk-technologies.com/Events/Symp...
The parameter in negative correlation learning (NC) controls the degree of co-operation between individual networks. This paper looks at the way the choice of in the NC algorithm affects the complexity of the function NC can fit, and shows that it acts as a complexity control allowing smooth adjustment of the network between one large back-propagated network, and many independent networks individually trained before combination. The effect of the base complexity of the individual networks, and the number of networks that are trained co-operatively, on the algorithms overall complexity are also empirically investigated. Empirical results are presented from 4 different datatsets. The way in which the performance changes as parameters change, and the point at which over-fitting sets in give us information about the complexity of the model the algorithm can fit at those parameter settings.
|Item Type:||Conference or Workshop Item (Paper)|
|Subjects:||Generalities > Computer Science and Informatics > Artificial Intelligence|
Generalities > Computer Science and Informatics
|Group:||School of Design, Engineering & Computing|
|Deposited By:||INVALID USER|
|Deposited On:||21 Dec 2008 16:07|
|Last Modified:||07 Mar 2013 15:02|
Document DownloadsMore statistics for this item...
|Repository Staff Only -|
|BU Staff Only -|
|Help Guide -||Editing Your Items in BURO|