This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to find a good oblique split (in the form of a hyperplane) at each node of a decision tree. Oblique decision tree methods are tuned especially for domains in which the attributes are numeric, although they can be adapted to symbolic or mixed symbolic/numeric attributes. We present extensive empirical studies, using both real and artificial data, that analyze OC1's ability to construct oblique trees that are smaller and more accurate than their axis-parallel counterparts. We also examine the benefits of randomization for the construction of oblique decision trees.

However, extended object-oriented oday, object-oriented programming important and powerful programming Italy, Sweden, the United languages and systems have paradigm, especially for Kingdom, and the United States were been developed that are adequate to the development of complex systems, invited to the workshop. This article handle AI applications. AI, raised and the major points made programming, a case of objectoriented however, is looking for knowledge during the presentations of the eight programming that has a representation and programming papers in the workshop's four sessions. AI, does not satisfy distributed AI applications and uses constructs (for The workshop started with an requirements because it lacks representation, example, frames) and notions (for introduction by Ibrahim in which he communication, and organization. Ibrahim posed a to the object-based concurrent The one-day workshop entitled number of questions related to the programming paradigm to close the Objects and AI, held in Sydney, Australia, theme of the workshop and asked gap with distributed AI, such as the on 25 August 1991 in conjunction the participants to address some of introduction of more powerful object with the 1991 International these questions during their talks and representations, a social theory of Joint Conference on Artificial Intelligence, discussion.

The Fifth International Conference on Genetic Algorithms was held at the University of Illinois at Urbana-Champaign from 17-21 July 1993. Approximately 350 participants attended the multitrack conference, which covered a wide range of topics, including genetic operators, mathematical analysis of genetic algorithms, parallel genetic algorithms, classifier systems, and genetic programming. This article highlights the major themes of the conference by discussing a few papers in detail.

We recommend doesn't carry the day. The robot swallow something that's not particularly that those inclined to study must be able to use Q to arrive at its savory: a contradiction.

He knew the challenges opinion, as one of the premier natural language were great and would require the research groups in the world. He gave efforts of many people. He had a genius for one of us (Barbara Grosz) her first AI job, even bringing these people together. In doing so, he took a of people who had known Don over the risk of a magnitude that she fully appreciated years to send us reminiscences. Although only years later when she herself was hiring each person's story differed, a striking commonality research associates.

Science deals with knowledge of the material world based on objective reality. It is under constant attack by those who need magic, that is, concepts based on imagination and desire, with no basis in objective reality. A convenient target for such people is speculation on the machinery and method of operation of the human mind, questions that are still obscure in 1994. In The Emperor's New Mind, Roger Penrose attempts to look beyond objective reality for possible answers, using, in his argument, the theory that computers will never be able to duplicate the human experience. This article attempts to show where Penrose is in error by reviewing the evolution of men and computers and, based on this review, speculates about where computers might and might not imitate human perception. It then warns against the dangers of passive acceptance when respected scientists venture into the occult.

In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no direct information about features is available. However the available information is usually sufficient to highly constrain the outputs. We discuss Bayesian techniques for extracting class probabilities given partial data. The optimal solution involves integrating over the missing dimensions weighted by the local probability densities. We show how to obtain closed-form approximations to the Bayesian solution using Gaussian basis function networks. The framework extends naturally to the case of noisy features.

Many techniques for model selection in the field of neural networks correspond to well established statistical methods. The method of'stopped training', on the other hand, in which an oversized network is trained until the error on a further validation set of examples deteriorates, then training is stopped, is a true innovation, since model selection doesn't require convergence of the training process. In this paper we show that this performance can be significantly enhanced by extending the'non convergent model selection method' of stopped training to include dynamic topology modifications (dynamic weight pruning) and modified complexity penalty term methods in which the weighting of the penalty term is adjusted during the training process. 1 INTRODUCTION One of the central topics in the field of neural networks is that of model selection. Both the theoretical and practical side of this have been intensively investigated and a vast array of methods have been suggested to perform this task. A widely used class of techniques starts by choosing an'oversized' network architecture then either removing redundant elements based on some measure of saliency (pruning), adding a further term to the cost function penalizing complexity (penalty terms), and finally, observing the error on a further validation set of examples, then stopping training as soon as this performance begins to deteriorate (stopped training).

This paper examines and extends the work of Linsker (1986) on self organising feature detectors. Linsker concentrates on the visual processing system, but infers that the weak assumptions made will allow the model to be used in the processing of other sensory information. This claim is examined here, with special attention paid to the auditory system, where there is much lower connectivity and therefore more statistical variability. Online training is utilised, to obtain an idea of training times. These are then compared to the time available to prenatal mammals for the formation of feature sensitive cells. 1 INTRODUCTION Within the last thirty years, a great deal of research has been carried out in an attempt to understand the development of cells in the pathways between the sensory apparatus and the cortex in mammals. For example, theories for the development of feature detectors were forwarded by Nass and Cooper (1975), by Grossberg (1976) and more recently Obermayer et al (1990). Hubel and Wiesel (1961) established the existence of several different types of feature sensitive cell in the visual cortex of cats. Various subsequent experiments have 1007 1008 Walton and Bisset shown that a considerable amount of development takes place before birth (i.e.

A model of the hippocampus as a central element in rat navigation is presented.