2749970
Layered Learning in Genetic Programming for a Cooperative Robot Soccer Problem
We present an alternative to standard genetic programming (GP) that applies layered learning techniques to decompose a problem. GP is applied to subproblems sequentially, where the population in the last generation of a subproblem is used as the initial population of the next subproblem. This method is applied to evolve agents to play keep-away soccer, a subproblem of robotic soccer that requires cooperation among multiple agents in a dynnamic environment. The layered learning paradigm allows GP to evolve better solutions faster than standard GP. Results show that the layered learning GP outperforms standard GP by evolving a lower fitness faster and an overall better fitness. Results indicate a wide area of future research with layered learning in GP.
6398168
Probabilistic Learning in Bayesian and Stochastic Neural Networks
The goal of this research is to integrate aspects of artificial neural networks (ANNs) with symbolic machine learning methods in a probabilistic reasoning framework. Improved understanding of the semantics of neural nets supports principled integration efforts between seminumerical (so-called "subsymbolic") and symbolic intelligent systems. My dissertation focuses on learning of spatiotemporal (ST) sequences. In recent work, I have investigated architectures for modeling of ST sequences, and dualities between Bayesian networks and ANNs that expose their probabilistic and information theoretic foundations. In addition, I am developing algorithms for automated construction of Bayesian networks (and hybrid models); metrics for comparison of Bayesian networks across architectures; and a quantitative theory of feature construction (in the spirit of the PAC formalism from computational learning theory) for this learning environment. (Haussler 1988) Such methods for pattern prediction will be useful for building advanced knowledge based systems, with diagnostic applications such as intelligent monitoring tools.
28678366
Genetic Wrappers for Constructive Induction in High-Performance Data Mining
We present an application of genetic algorithm-based design to configuration of high-level optimization systems, or wrappers, for relevance determination and constructive induction. Our system combines genetic wrappers with elicited knowledge on attribute relevance and synthesis. We discuss decision support issues in a large-scale commercial data mining project (cost prediction for multiple automobile insurance markets), and report experiments using D2K, a Java-based visual programming system for data mining and information visualization, and several commercial and research tools. Our GA system, Jenesis [HWRC00], is deployed on several network-of-workstation systems (Beowulf clusters). It achieves a linear speedup, due to a high degree of task parallelism, and improved test set accuracy, compared to decision tree learning with only constructive induction and state-space search-based wrappers [KJ97].
18622837
Graph Drawing Heuristics for Path Finding in Large Dimensionless Graphs
This paper presents a heuristic for guiding A*search for approximating the shortest path between two vertices in arbitrarily-sized dimensionless graphs. First we discuss methods by which these dimensionless graphs are laid out into Euclidean drawings. Next, two heuristics are computed based on drawings of the graphs. We compare the performance of an A*-search using these heuristics with breadth-first search on graphs with various topological properties. The results show a large savings in the number of vertices expanded for large graphs.
5371240
A machine learning approach to algorithm selection for 
$\mathcal{NP}$
-hard optimization problems: a case study on the MPE problem
Abstract
Given one instance of an 
$\mathcal{NP}$
-hard optimization problem, can we tell in advance whether it is exactly solvable or not? If it is not, can we predict which approximate algorithm is the best to solve it? Since the behavior of most approximate, randomized, and heuristic search algorithms for 
$\mathcal{NP}$
-hard problems is usually very difficult to characterize analytically, researchers have turned to experimental methods in order to answer these questions. In this paper we present a machine learning-based approach to address the above questions. Models induced from algorithmic performance data can represent the knowledge of how algorithmic performance depends on some easy-to-compute problem instance characteristics. Using these models, we can estimate approximately whether an input instance is exactly solvable or not. Furthermore, when it is classified as exactly unsolvable, we can select the best approximate algorithm for it among a list of candidates. In this paper we use the MPE (most probable explanation) problem in probabilistic inference as a case study to validate the proposed methodology. Our experimental results show that the machine learning-based algorithm selection system can integrate both exact and inexact algorithms and provide the best overall performance comparing to any single candidate algorithm.

11098618
Relational Graphical Models of Computational Workflows for Data Mining
Collaborative recommendation is the problem of analyzing the content of an information retrieval system and actions of its users, to predict additional topics or products a new user may find useful. Developing this capability poses several challenges to machine learning and reasoning under uncertainty. Recent systems such as CiteSeer [1] have succeeded in providing some specialized but comprehensive indices of full documents, but the kind of probabilistic models used in such indexing do not extend easily to information Grid databases and computational Grid workflows. The collection of user data from Grid portals [4] provides a test bed for the underlying IR technology, including learning and inference systems. To model workflows created using the TAVERNA editor [3] and SCUFL description language, the DESCRIBER system, shown in Figure 1, applies score-based structure learning algorithms, including Bayesian model selection and greedy search (cf. the K2 algorithm) adapted to relational graphical models. Figure 2 illustrates how the decision support front-end of DESCRIBER interacts with modules that learn and reason using probabilistic relational models,. The purpose is to discover interrelationships among, and thereby recommend, components used in workflows developed by other Grid users.
39997128
The Clusnet Algorithm And Time Series Prediction
This paper describes a novel neural network architecture named ClusNet. This network is designed to study the trade-offs between the simplicity of instance-based methods and the accuracy of the more computational intensive learning methods. The features that make this network different from existing learning algorithms are outlined. A simple proof of convergence of the ClusNet algorithm is given. Experimental results showing the convergence of the algorithm on a specific problem is also presented. In this paper, ClusNet is applied to predict the temporal continuation of the Mackey-Glass chaotic time series. A comparison between the results obtained with ClusNet and other neural network algorithms is made. For example, ClusNet requires one-tenth the computing resources of the instance-based local linear method for this application while achieving comparable accuracy in this task. The sensitivity of ClusNet prediction accuracies on specific clustering algorithms is examined for an application. The simplicity and fast convergence of ClusNet makes it ideal as a rapid prototyping tool for applications where on-line learning is required.