Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 11 of 11

Full-Text Articles in Engineering

Stability And Classification Performance Of Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar, Qianhui Liang Dec 2011

Stability And Classification Performance Of Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar, Qianhui Liang

Computer Science Faculty Publications

Feature selection techniques can be evaluated based on either model performance or the stability (robustness) of the technique. The ideal situation is to choose a feature selec- tion technique that is robust to change, while also ensuring that models built with the selected features perform well. One domain where feature selection is especially important is software defect prediction, where large numbers of met- rics collected from previous software projects are used to help engineers focus their efforts on the most faulty mod- ules. This study presents a comprehensive empirical ex- amination of seven filter-based feature ranking techniques (rankers) applied to …


Measuring Stability Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar Nov 2011

Measuring Stability Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar

Computer Science Faculty Publications

Feature selection has been applied in many domains, such as text mining and software engineering. Ideally a feature selection technique should produce consistent out- puts regardless of minor variations in the input data. Re- searchers have recently begun to examine the stability (robustness) of feature selection techniques. The stability of a feature selection method is defined as the degree of agreement between its outputs to randomly-selected subsets of the same input data. This study evaluated the stability of 11 threshold-based feature ranking techniques (rankers) when applied to 16 real-world software measurement datasets of different sizes. Experimental results demonstrate that AUC …


Investigating The Effects Of Learning Speeds On Xpilot Agent Evolution, Gary Parker, Phil Fritzsche Oct 2011

Investigating The Effects Of Learning Speeds On Xpilot Agent Evolution, Gary Parker, Phil Fritzsche

Computer Science Faculty Publications

In this paper we present a comparison of the effects of varying play speeds on a genetic algorithm in the space combat game Xpilot. Xpilot-AI, an Xpilot add-on designed for testing learning systems, is used to evolve the controller for an Xpilot combat agent at varying frames per second to determine an optimal speed for learning. The controller is a rule-based system modified to work with a genetic algorithm that learns numeric parameters for the agent’s rule base. The goal of this research is to increase the quality and speed of standard learning algorithms in Xpilot as well as determine …


Fitness Biasing For The Box Pushing Task, Gary Parker, Jim O'Connor Oct 2011

Fitness Biasing For The Box Pushing Task, Gary Parker, Jim O'Connor

Computer Science Faculty Publications

Anytime Learning with Fitness Biasing has been shown in previous works to be an effective tool for evolving hexapod gaits. In this paper, we present the use of Anytime Learning with Fitness Biasing to evolve the controller for a robot learning the box pushing task. The robot that was built for this task, was measured to create an accurate model. The model was used in simulation to test the effectiveness of Anytime Learning with Fitness Biasing for the box pushing task. This work is the first step in new research where an automated system to test the viability of Fitness …


Using Cyclic Genetic Algorithms To Learn Gaits For An Actual Quadruped Robot, Gary Parker, William T. Tarimo Oct 2011

Using Cyclic Genetic Algorithms To Learn Gaits For An Actual Quadruped Robot, Gary Parker, William T. Tarimo

Computer Science Faculty Publications

It is a difficult task to generate optimal walking gaits for mobile legged robots. Generating and coordinating an optimal gait involves continually repeating a series of actions in order to create a sustained movement. In this work, we present the use of a Cyclic Genetic Algorithm (CGA) to learn near optimal gaits for an actual quadruped servo-robot with three degrees of movement per leg. This robot was used to create a simulation model of the movement and states of the robot which included the robot’s unique features and capabilities. The CGA used this model to learn gaits that were optimized …


Measuring Robustness Of Feature Selection Techniques On Software Engineering Datasets, Huanjing Wang, Taghi Khoshgoftaar, Randall Wald Aug 2011

Measuring Robustness Of Feature Selection Techniques On Software Engineering Datasets, Huanjing Wang, Taghi Khoshgoftaar, Randall Wald

Computer Science Faculty Publications

Feature Selection is a process which identifies irrelevant and redundant features from a high-dimensional dataset (that is, a dataset with many features), and removes these before further analysis is performed. Recently, the robustness (e.g., stability) of feature selection techniques has been studied, to examine the sensitivity of these techniques to changes in their input data. In this study, we investigate the robustness of six commonly used feature selection techniques as the magnitude of change to the datasets and the size of the selected feature subsets are varied. All experiments were conducted on 16 datasets from three real-world software projects. The …


Quadruped Gait Learning Using Cyclic Genetic Algorithms, Gary Parker, William T. Tarimo, Michael Cantor Jun 2011

Quadruped Gait Learning Using Cyclic Genetic Algorithms, Gary Parker, William T. Tarimo, Michael Cantor

Computer Science Faculty Publications

Generating walking gaits for legged robots is a challenging task. Gait generation with proper leg coordination involves a series of actions that are continually repeated to create sustained movement. In this paper we present the use of a Cyclic Genetic Algorithm (CGA) to learn gaits for a quadruped servo robot with three degrees of movement per leg. An actual robot was used to generate a simulation model of the movement and states of the robot. The CGA used the robot's unique features and capabilities to develop gaits specific for that particular robot. Tests done in simulation show the success of …


Fitness Biasing For Evolving An Xpilot Combat Agent, Gary Parker, Phil Fritzsche Jun 2011

Fitness Biasing For Evolving An Xpilot Combat Agent, Gary Parker, Phil Fritzsche

Computer Science Faculty Publications

In this paper we present an application of Fitness Biasing, a type of Punctuated Anytime Learning, for learning autonomous agents in the space combat game Xpilot. Fitness Biasing was originally developed as a means of linking the model to the actual robot in evolutionary robotics. We use fitness biasing with a standard genetic algorithm to learn control programs for a video game agent in real-time. Xpilot-AI, an Xpilot add-on designed for testing learning systems, is used to evolve the controller in the background while periodic checks in normal game play are used to compensate for errors produced by running the …


The Effects Of Using A Greedy Factor In Hexapod Gait Learning, Gary Parker, William T. Tarimo Jun 2011

The Effects Of Using A Greedy Factor In Hexapod Gait Learning, Gary Parker, William T. Tarimo

Computer Science Faculty Publications

Various selection schemes have been described for use in genetic algorithms. This paper investigates the effects of adding greediness to the standard roulette-wheel selection. The results of this study are tested on a Cyclic Genetic Algorithm (CGA) used for learning gaits for a hexapod servo-robot. The effectiveness of CGA in learning optimal gaits with selection based on roulette-wheel selection with and without greediness is compared. The results were analyzed based on fitness of the individual gaits, convergence time of the evolution process, and the fitness of the entire population evolved. Results demonstrate that selection with too much greediness tends to …


Comparison Of A Greedy Selection Operator To Tournament Selection And A Hill Climber, Lee Graham, John Borbone, Gary Parker Jun 2011

Comparison Of A Greedy Selection Operator To Tournament Selection And A Hill Climber, Lee Graham, John Borbone, Gary Parker

Computer Science Faculty Publications

A new deterministic greedy genetic algorithm selection operator with very high selection pressure, dubbed the "Jugate Adaptive Method" is examined. Its performance and behavior are compared to thoseof a canonical genetic algorithm with tournament selection, and a random-restarting next-ascent stochastic hill-climber. All three algorithms are tuned using parameter sweeps to optimize their success rates on five combinatorial optimization problems, tuning each algorithm for each problem independently. Results were negative in that the new method was outperformed in nearly all experiments. Experimental data show the hill climber to be the clear winner in four of five test problems.


Vehicular Ad Hoc Networks, Syed R. Rizvi, Stephan Olariu, Christina M. Oinotti, Shaharuddin Salleh, Mona E. Rizvi, Zainab Zaidi Jan 2011

Vehicular Ad Hoc Networks, Syed R. Rizvi, Stephan Olariu, Christina M. Oinotti, Shaharuddin Salleh, Mona E. Rizvi, Zainab Zaidi

Computer Science Faculty Publications

(First paragraph) Vehicular ad hoc networks (VANETs) have recently been proposed as one of the promising ad hoc networking techniques that can provide both drivers and passengers with a safe and enjoyable driving experience. VANETs can be used for many applications with vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications. In the United States, motor vehicle traffic crashes are the leading cause of death for all motorists between two and thirty-four years of age. In 2009, the National Highway Traffic Safety Administration (NHTSA) reported that 33,808 people were killed in motor vehicle traffic crashes. The US Department of Transportation (US-DOT) estimates that …