Shlomo Geva

Shlomo Geva

Auto-generated profile, based on publicly available information

Shlomo Geva

Queensland University of Technology, Brisbane, Australia

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 1991 in IEEE Transactions on Neural Networks
Verified
Journal Article
Closed access
SGS. Geva
S. Geva
JSJ. Sitte
J. Sitte
A variant of nearest-neighbor (NN) pattern classification and supervised learning by learning vector quantization (LVQ) is described. The decision surface mapping method (DSM) is a fast supervised learning algorithm and is a member of the LVQ family of algorithms. A relatively small number of prototypes are selected from a training set of correctly classified samples. The training set is then used to adapt these prototypes to map the decision surface separating the classes. This algorithm is compared with NN pattern classification, learning vector quantization, and a two-layer perceptron trained by error backpropagation. When the class boundaries are sharply defined (i.e., no classification error in the training set), the DSM algorithm outperforms these methods with respect to error rates, learning rates, and the number of prototypes required to describe class boundaries.

1 October 1993 in IEEE Control Systems
Verified
Journal Article
Closed access
SGS. Geva
S. Geva
JSJ. Sitte
J. Sitte
The inverted pendulum problem, i.e., the cartpole, which is often used for demonstrating the success of neural network learning methods, is addressed. It is shown that a random search in weight space can quickly uncover coefficients (weights) for controllers that work over a wide range of initial conditions. This result indicates that success in finding a satisfactory neural controller is not sufficient proof for the effectiveness of unsupervised training methods. By analyzing the dynamics of the linear controller, the cartpole problem is reformulated to make it a more stringent test for neural training methods. A review of the literature on unsupervised training methods for cartpole controllers shows that the published results are difficult to compare and that for most of the methods there is not clear evidence of better performance than the random search method.

1 August 1990 in Metallurgical Transactions B
Verified
Journal Article
Closed access
PDF file
SGS. Geva
S. Geva
MFM. Farren
M. Farren
DJD. H. St. John
D. H. St. John
PHPeter Hayes
Peter Hayes

27 January 2016 in The Asia-Pacific Education Researcher
Verified
Journal Article
Closed access
PDF file
NZNastaran Zanjani
Nastaran Zanjani
SESylvia L. Edwards
Sylvia L. Edwards
SNShaun Nykvist
Shaun Nykvist
SGShlomo Geva
Shlomo Geva

1 August 2002 in Neurocomputing
Verified
Journal Article
Closed access
RARobert Andrews
Robert Andrews
SGShlomo Geva
Shlomo Geva

1 January 2009 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
JKJaap Kamps
Jaap Kamps
SGShlomo Geva
Shlomo Geva
ATAndrew Trotman
Andrew Trotman
AWAlan Woodley
Alan Woodley
MKMarijn Koolen
Marijn Koolen