Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!dynas!neural!egel
From: egel@neural.dynas.se (Peter Egelberg)
Newsgroups: comp.ai.neural-nets
Subject: Re: testing generalization i NN
Keywords: generalization problems, benchmark problems
Message-ID: <1991Apr11.075213.6845@neural.dynas.se>
Date: 11 Apr 91 07:52:13 GMT
References: <1991Apr4.130549.12904@daimi.aau.dk>
Organization: Neural AB, Sweden
Lines: 28

In article <1991Apr4.130549.12904@daimi.aau.dk> steensj@daimi.aau.dk (Steen Sj|gaard) writes:
>Hi,
>
	.
	.
	.
>I desperately need a "well-sized" generalization problem
>to train and test the different networks on. (By "well-sized" I mean a problem
>which definitely is more complex (and realistic) than xor, parity and similar
>toy-problems, but on the other hand also less complex/time-consuming  than 
>NetTalk, e.g.)
	.
	.
	.

Have you tried the two-spiral problem?

The objective of the problem is to train the network to predict in which
of the two spirals a given point lies in. The input points are given in
XY-coordinates. The spirals start out at the center and spiral outwards.
One spiral starts out pointing to the left and the other starts out
pointing to the right.

-- 
Peter Egelberg			E-mail:	egel@neural.dynas.se
Neural AB			Phone:	+46 46 11 00 90
Otto Lindbladsv. 5		Fax:	+46 46 13 60 85
223 65 LUND, SWEDEN