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

Digital Commons Network

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

Computer Sciences

Theses/Dissertations

Machine learning

Institution
Publication Year
Publication
File Type

Articles 601 - 630 of 665

Full-Text Articles in Entire DC Network

A Study Of Localization And Latency Reduction For Action Recognition, Syed Zain Masood Jan 2012

A Study Of Localization And Latency Reduction For Action Recognition, Syed Zain Masood

Electronic Theses and Dissertations

The success of recognizing periodic actions in single-person-simple-background datasets, such as Weizmann and KTH, has created a need for more complex datasets to push the performance of action recognition systems. In this work, we create a new synthetic action dataset and use it to highlight weaknesses in current recognition systems. Experiments show that introducing background complexity to action video sequences causes a significant degradation in recognition performance. Moreover, this degradation cannot be fixed by fine-tuning system parameters or by selecting better feature points. Instead, we show that the problem lies in the spatio-temporal cuboid volume extracted from the interest point …


Ensemble Methods For Malware Diagnosis Based On One-Class Svms, Xing An Jan 2012

Ensemble Methods For Malware Diagnosis Based On One-Class Svms, Xing An

LSU Master's Theses

Malware diagnosis is one of today’s most popular topics of machine learning. Instead of simply applying all the classical classification algorithms to the problem and claim the highest accuracy as the result of prediction, which is the typical approach adopted by studies of this kind, we stick to the Support Vector Machine (SVM) classifier and based on our observation of some principles of learning, characteristics of statistics and the behavior of SVM, we employed a number of the potential preprocessing or ensemble methods including rescaling, bagging and clustering that may enhance the performance to the classical algorithm. We implemented the …


Implementation Of A New Sigmoid Function In Backpropagation Neural Networks., Jeffrey A. Bonnell Aug 2011

Implementation Of A New Sigmoid Function In Backpropagation Neural Networks., Jeffrey A. Bonnell

Electronic Theses and Dissertations

This thesis presents the use of a new sigmoid activation function in backpropagation artificial neural networks (ANNs). ANNs using conventional activation functions may generalize poorly when trained on a set which includes quirky, mislabeled, unbalanced, or otherwise complicated data. This new activation function is an attempt to improve generalization and reduce overtraining on mislabeled or irrelevant data by restricting training when inputs to the hidden neurons are sufficiently small. This activation function includes a flattened, low-training region which grows or shrinks during back-propagation to ensure a desired proportion of inputs inside the low-training region. With a desired low-training proportion of …


Development Of Advanced Algorithms To Detect, Characterize And Forecast Solar Activities, Yuan Yuan May 2011

Development Of Advanced Algorithms To Detect, Characterize And Forecast Solar Activities, Yuan Yuan

Dissertations

Study of the solar activity is an important part of space weather research. It is facing serious challenges because of large data volume, which requires application of state-of-the-art machine learning and computer vision techniques. This dissertation targets at two essential aspects in space weather research: automatic feature detection and forecasting of eruptive events.

Feature detection includes solar filament detection and solar fibril tracing. A solar filament consists of a mass of gas suspended over the chromosphere by magnetic fields and seen as a dark, ribbon-shaped feature on the bright solar disk in Hα (Hydrogen-alpha) full-disk solar images. In this dissertation, …


Narrative Analysis And Computational Model To Predict Interestingness Of Narratives, Laxman Thapa May 2011

Narrative Analysis And Computational Model To Predict Interestingness Of Narratives, Laxman Thapa

Theses and Dissertations - UTB/UTPA

In this research, I present results demonstrating the classification of the specially generated narratives by a machine agent by listening to human subject describing the same sets of the events. These classifications are based on human ratings of interestingness for many different recountings of the same stories. The classification is performed on various features selected after analyzing the different possible feature that affect on the interestingness of narratives. The features were extracted from the surface text as well as from annotations of how each narration relates to the content of the known story. I present the annotation process and resulting …


Learning Local Features Using Boosted Trees For Face Recognition, Rajkiran Gottumukkal Apr 2011

Learning Local Features Using Boosted Trees For Face Recognition, Rajkiran Gottumukkal

Electrical & Computer Engineering Theses & Dissertations

Face recognition is fundamental to a number of significant applications that include but not limited to video surveillance and content based image retrieval. Some of the challenges which make this task difficult are variations in faces due to changes in pose, illumination and deformation. This dissertation proposes a face recognition system to overcome these difficulties. We propose methods for different stages of face recognition which will make the system more robust to these variations. We propose a novel method to perform skin segmentation which is fast and able to perform well under different illumination conditions. We also propose a method …


Effective Task Transfer Through Indirect Encoding, Phillip Verbancsics Jan 2011

Effective Task Transfer Through Indirect Encoding, Phillip Verbancsics

Electronic Theses and Dissertations

An important goal for machine learning is to transfer knowledge between tasks. For example, learning to play RoboCup Keepaway should contribute to learning the full game of RoboCup soccer. Often approaches to task transfer focus on transforming the original representation to fit the new task. Such representational transformations are necessary because the target task often requires new state information that was not included in the original representation. In RoboCup Keepaway, changing from the 3 vs. 2 variant of the task to 4 vs. 3 adds state information for each of the new players. In contrast, this dissertation explores the idea …


Assessing Data Quality In A Sensor Network For Environmental Monitoring, Gesuri Ramirez Jan 2011

Assessing Data Quality In A Sensor Network For Environmental Monitoring, Gesuri Ramirez

Open Access Theses & Dissertations

Assessing the quality of sensor data in environmental monitoring applications is important, as erroneous readings produced by malfunctioning sensors, calibration drift, and problematic climatic conditions, such as icing or dust, are common.Traditional data quality checking and correction is a painstaking manual process, so the development of automatic systems for this task is highly desirable.

This study investigates machine learning methods to identify and clean incorrect data from a real-world environmental sensor network, the Jornada Experimental Range, located in Southern New Mexico. We evaluated several learning algorithms and data replacement schemes, and developed a method to identify the problematic sensor. The …


Algorithms For Training Large-Scale Linear Programming Support Vector Regression And Classification, Pablo Rivas Perea Jan 2011

Algorithms For Training Large-Scale Linear Programming Support Vector Regression And Classification, Pablo Rivas Perea

Open Access Theses & Dissertations

The main contribution of this dissertation is the development of a method to train a Support Vector Regression (SVR) model for the large-scale case where the number of training samples supersedes the computational resources. The proposed scheme consists of posing the SVR problem entirely as a Linear Programming (LP) problem and on the development of a sequential optimization method based on variables decomposition, constraints decomposition, and the use of primal-dual interior point methods. Experimental results demonstrate that the proposed approach has comparable performance with other SV-based classifiers. Particularly, experiments demonstrate that as the problem size increases, the sparser the solution …


Data Mining Based Learning Algorithms For Semi-Supervised Object Identification And Tracking, Michael P. Dessauer Jan 2011

Data Mining Based Learning Algorithms For Semi-Supervised Object Identification And Tracking, Michael P. Dessauer

Doctoral Dissertations

Sensor exploitation (SE) is the crucial step in surveillance applications such as airport security and search and rescue operations. It allows localization and identification of movement in urban settings and can significantly boost knowledge gathering, interpretation and action. Data mining techniques offer the promise of precise and accurate knowledge acquisition techniques in high-dimensional data domains (and diminishing the “curse of dimensionality” prevalent in such datasets), coupled by algorithmic design in feature extraction, discriminative ranking, feature fusion and supervised learning (classification). Consequently, data mining techniques and algorithms can be used to refine and process captured data and to detect, recognize, classify, …


Combining Natural Language Processing And Statistical Text Mining: A Study Of Specialized Versus Common Languages, Jay Jarman Jan 2011

Combining Natural Language Processing And Statistical Text Mining: A Study Of Specialized Versus Common Languages, Jay Jarman

USF Tampa Graduate Theses and Dissertations

This dissertation focuses on developing and evaluating hybrid approaches for analyzing free-form text in the medical domain. This research draws on natural language processing (NLP) techniques that are used to parse and extract concepts based on a controlled vocabulary. Once important concepts are extracted, additional machine learning algorithms, such as association rule mining and decision tree induction, are used to discover classification rules for specific targets. This multi-stage pipeline approach is contrasted with traditional statistical text mining (STM) methods based on term counts and term-by-document frequencies. The aim is to create effective text analytic processes by adapting and combining individual …


An Exploration Of Multi-Agent Learning Within The Game Of Sheephead, Brady Brau Jan 2011

An Exploration Of Multi-Agent Learning Within The Game Of Sheephead, Brady Brau

All Graduate Theses, Dissertations, and Other Capstone Projects

In this paper, we examine a machine learning technique presented by Ishii et al. used to allow for learning in a multi-agent environment and apply an adaptation of this learning technique to the card game Sheephead. We then evaluate the effectiveness of our adaptation by running simulations against rule-based opponents. Multi-agent learning presents several layers of complexity on top of a single-agent learning in a stationary environment. This added complexity and increased state space is just beginning to be addressed by researchers. We utilize techniques used by Ishii et al. to facilitate this multi-agent learning. We model the environment of …


Event-Driven Similarity And Classification Of Scanpaths, Thomas Grindinger Aug 2010

Event-Driven Similarity And Classification Of Scanpaths, Thomas Grindinger

All Dissertations

Eye tracking experiments often involve recording the pattern of deployment of visual attention over the stimulus as viewers perform a given task (e.g., visual search). It is useful in training applications, for example, to make available an expert's sequence of eye movements, or scanpath, to novices for their inspection and subsequent learning. It may also be potentially useful to be able to assess the conformance of the novice's scanpath to that of the expert. A computational tool is proposed that provides a framework for performing such classification, based on the use of a probabilistic machine learning algorithm. The approach was …


Practical Improvements In Applied Spectral Learning, Adam C. Drake Jun 2010

Practical Improvements In Applied Spectral Learning, Adam C. Drake

Theses and Dissertations

Spectral learning algorithms, which learn an unknown function by learning a spectral representation of the function, have been widely used in computational learning theory to prove many interesting learnability results. These algorithms have also been successfully used in real-world applications. However, previous work has left open many questions about how to best use these methods in real-world learning scenarios. This dissertation presents several significant advances in real-world spectral learning. It presents new algorithms for finding large spectral coefficients (a key sub-problem in spectral learning) that allow spectral learning methods to be applied to much larger problems and to a wider …


Transformation Learning: Modeling Transferable Transformations In High-Dimensional Data, Christopher R. Wilson May 2010

Transformation Learning: Modeling Transferable Transformations In High-Dimensional Data, Christopher R. Wilson

Theses and Dissertations

The goal of learning transfer is to apply knowledge gained from one problem to a separate related problem. Transformation learning is a proposed approach to computational learning transfer that focuses on modeling high-level transformations that are well suited for transfer. By using a high-level representation of transferable data, transformation learning facilitates both shallow transfer (intra-domain) and deep transfer (inter-domain) scenarios. Transformations can be discovered in data using manifold learning to order data instances according to the transformations they represent. For high-dimensional data representable with coordinate systems, such as images and sounds, data instances can be decomposed into small sub-instances based …


A Comparative Study On Text Categorization, Aditya Chainulu Karamcheti May 2010

A Comparative Study On Text Categorization, Aditya Chainulu Karamcheti

UNLV Theses, Dissertations, Professional Papers, and Capstones

Automated text categorization is a supervised learning task, defined as assigning category labels to new documents based on likelihood suggested by a training set of labeled documents. Two examples of methodology for text categorizations are Naive Bayes and K-Nearest Neighbor.

In this thesis, we implement two categorization engines based on Naive Bayes and K-Nearest Neighbor methodology. We then compare the effectiveness of these two engines by calculating standard precision and recall for a collection of documents. We will further report on time efficiency of these two engines.


Segmentation And Fracture Detection In X-Ray Images For Traumatic Pelvic Injury, Rebecca Smith Apr 2010

Segmentation And Fracture Detection In X-Ray Images For Traumatic Pelvic Injury, Rebecca Smith

Theses and Dissertations

Due to the risk of complications such as hemorrhage, severe pelvic trauma is associated with a high mortality rate. Prompt medical treatment is therefore vital. However, the complexity of the injuries can make successful diagnosis and treatment challenging. By generating predictions and recommendations based on patient data, computer-aided decision support systems have the potential to assist physicians in improving outcomes. However, no current system considers features automatically extracted from medical images. This dissertation describes a system to extract diagnostic features from pelvic X-ray images that can be used as input to the prediction process; specifically, the presence of fracture and …


A Bayesian Decision Theoretical Approach To Supervised Learning, Selective Sampling, And Empirical Function Optimization, James Lamond Carroll Mar 2010

A Bayesian Decision Theoretical Approach To Supervised Learning, Selective Sampling, And Empirical Function Optimization, James Lamond Carroll

Theses and Dissertations

Many have used the principles of statistics and Bayesian decision theory to model specific learning problems. It is less common to see models of the processes of learning in general. One exception is the model of the supervised learning process known as the "Extended Bayesian Formalism" or EBF. This model is descriptive, in that it can describe and compare learning algorithms. Thus the EBF is capable of modeling both effective and ineffective learning algorithms. We extend the EBF to model un-supervised learning, semi-supervised learning, supervised learning, and empirical function optimization. We also generalize the utility model of the EBF to …


Predicting Flavonoid Ugt Regioselectivity With Graphical Residue Models And Machine Learning., Arthur Rhydon Jackson Dec 2009

Predicting Flavonoid Ugt Regioselectivity With Graphical Residue Models And Machine Learning., Arthur Rhydon Jackson

Electronic Theses and Dissertations

Machine learning is applied to a challenging and biologically significant protein classification problem: the prediction of flavonoid UGT acceptor regioselectivity from primary protein sequence. Novel indices characterizing graphical models of protein residues are introduced. The indices are compared with existing amino acid indices and found to cluster residues appropriately. A variety of models employing the indices are then investigated by examining their performance when analyzed using nearest neighbor, support vector machine, and Bayesian neural network classifiers. Improvements over nearest neighbor classifications relying on standard alignment similarity scores are reported.


Noninvasive Estimation Of Pulmonary Artery Pressure Using Heart Sound Analysis, Aaron W. Dennis Dec 2009

Noninvasive Estimation Of Pulmonary Artery Pressure Using Heart Sound Analysis, Aaron W. Dennis

Theses and Dissertations

Right-heart catheterization is the most accurate method for estimating pulmonary artery pressure (PAP). Because it is an invasive procedure it is expensive, exposes patients to the risk of infection, and is not suited for long-term monitoring situations. Medical researchers have shown that PAP influences the characteristics of heart sounds. This suggests that heart sound analysis is a potential noninvasive solution to the PAP estimation problem. This thesis describes the development of a prototype system, called PAPEr, which estimates PAP noninvasively using heart sound analysis. PAPEr uses patient data with machine learning algorithms to build models of how PAP affects heart …


Integrating Information Theory Measures And A Novel Rule-Set-Reduction Tech-Nique To Improve Fuzzy Decision Tree Induction Algorithms, Nael Mohammed Abu-Halaweh Dec 2009

Integrating Information Theory Measures And A Novel Rule-Set-Reduction Tech-Nique To Improve Fuzzy Decision Tree Induction Algorithms, Nael Mohammed Abu-Halaweh

Computer Science Dissertations

Machine learning approaches have been successfully applied to many classification and prediction problems. One of the most popular machine learning approaches is decision trees. A main advantage of decision trees is the clarity of the decision model they produce. The ID3 algorithm proposed by Quinlan forms the basis for many of the decision trees’ application. Trees produced by ID3 are sensitive to small perturbations in training data. To overcome this problem and to handle data uncertainties and spurious precision in data, fuzzy ID3 integrated fuzzy set theory and ideas from fuzzy logic with ID3. Several fuzzy decision trees algorithms and …


A Neural Network Approach To Border Gateway Protocol Peer Failure Detection And Prediction, Cory B. White Dec 2009

A Neural Network Approach To Border Gateway Protocol Peer Failure Detection And Prediction, Cory B. White

Master's Theses

The size and speed of computer networks continue to expand at a rapid pace, as do the corresponding errors, failures, and faults inherent within such extensive networks. This thesis introduces a novel approach to interface Border Gateway Protocol (BGP) computer networks with neural networks to learn the precursor connectivity patterns that emerge prior to a node failure. Details of the design and construction of a framework that utilizes neural networks to learn and monitor BGP connection states as a means of detecting and predicting BGP peer node failure are presented. Moreover, this framework is used to monitor a BGP network …


Automatic Red Tide Detection Using Modis Satellite Images, Wijian Cheng Jun 2009

Automatic Red Tide Detection Using Modis Satellite Images, Wijian Cheng

USF Tampa Graduate Theses and Dissertations

Red tides pose a significant economic and environmental threat in the Gulf of Mexico. Detecting red tide is important for understanding this phenomenon. In this thesis, machine learning approaches based on Random Forests, Support Vector Machines and K-Nearest Neighbors have been evaluated for red tide detection from MODIS satellite images. Detection results using machine learning algorithms were compared to ship collected ground truth red tide data. This work has three major contributions. First, machine learning approaches outperformed two of the latest thresholding red tide detection algorithms based on bio-optical characterization by more than 10% in terms of F measure and …


Predictive Decoding Of Neural Data, Yaroslav O. Halchenko May 2009

Predictive Decoding Of Neural Data, Yaroslav O. Halchenko

Dissertations

In the last five decades the number of techniques available for non-invasive functional imaging has increased dramatically. Researchers today can choose from a variety of imaging modalities that include EEG, MEG, PET, SPECT, MRI, and fMRI.

This doctoral dissertation offers a methodology for the reliable analysis of neural data at different levels of investigation. By using statistical learning algorithms the proposed approach allows single-trial analysis of various neural data by decoding them into variables of interest. Unbiased testing of the decoder on new samples of the data provides a generalization assessment of decoding performance reliability. Through consecutive analysis of the …


Concept Learning By Example Decomposition, Sameer Joshi Jan 2009

Concept Learning By Example Decomposition, Sameer Joshi

Electronic Theses and Dissertations

For efficient understanding and prediction in natural systems, even in artificially closed ones, we usually need to consider a number of factors that may combine in simple or complex ways. Additionally, many modern scientific disciplines face increasingly large datasets from which to extract knowledge (for example, genomics). Thus to learn all but the most trivial regularities in the natural world, we rely on different ways of simplifying the learning problem. One simplifying technique that is highly pervasive in nature is to break down a large learning problem into smaller ones; to learn the smaller, more manageable problems; and then to …


Machine Learned Melody Matching Using Strictly Relative Musical Abstractions, Michael Joseph Kolta Jan 2009

Machine Learned Melody Matching Using Strictly Relative Musical Abstractions, Michael Joseph Kolta

Legacy Theses & Dissertations (2009 - 2024)

We implement and evaluate a machine learning approach to improve systems for searching a database of music via melodic sample. We explore symbolic and aural input queries and test our prototypes with extensive user surveys. Our main contribution is to combine the following four elements. First is to create a unique musical abstraction that accounts for both pitch and rhythm in a relative manner. Second, our system allows for approximate matching of imperfect queries via the utilization of the Smith-Waterman algorithm that was originally designed for approximate matching of molecular subsequences, such as DNA samples. Third is to design our …


Bootstrapping Events And Relations From Text, Ting Liu Jan 2009

Bootstrapping Events And Relations From Text, Ting Liu

Legacy Theses & Dissertations (2009 - 2024)

Information Extraction (IE) is a technique for automatically extracting structured data from text documents. One of the key analytical tasks is extraction of important and relevant information from textual sources. While information is plentiful and readily available, from the Internet, news services, media, etc., extracting the critical nuggets that matter to business or to national security is a cognitively demanding and time consuming task. Intelligence and business analysts spend many hours poring over endless streams of text documents pulling out reference to entities of interest (people, locations, organizations) as well as their relationships as reported in text. Such extracted "information …


Real-Time Automatic Price Prediction For Ebay Online Trading, Ilya Igorevitch Raykhel Nov 2008

Real-Time Automatic Price Prediction For Ebay Online Trading, Ilya Igorevitch Raykhel

Theses and Dissertations

While Machine Learning is one of the most popular research areas in Computer Science, there are still only a few deployed applications intended for use by the general public. We have developed an exemplary application that can be directly applied to eBay trading. Our system predicts how much an item would sell for on eBay based on that item's attributes. We ran our experiments on the eBay laptop category, with prior trades used as training data. The system implements a feature-weighted k-Nearest Neighbor algorithm, using genetic algorithms to determine feature weights. Our results demonstrate an average prediction error of 16%; …


Machine Learning And Graph Theory Approaches For Classification And Prediction Of Protein Structure, Gulsah Altun Apr 2008

Machine Learning And Graph Theory Approaches For Classification And Prediction Of Protein Structure, Gulsah Altun

Computer Science Dissertations

Recently, many methods have been proposed for the classification and prediction problems in bioinformatics. One of these problems is the protein structure prediction. Machine learning approaches and new algorithms have been proposed to solve this problem. Among the machine learning approaches, Support Vector Machines (SVM) have attracted a lot of attention due to their high prediction accuracy. Since protein data consists of sequence and structural information, another most widely used approach for modeling this structured data is to use graphs. In computer science, graph theory has been widely studied; however it has only been recently applied to bioinformatics. In this …


Improving Liquid State Machines Through Iterative Refinement Of The Reservoir, R David Norton Mar 2008

Improving Liquid State Machines Through Iterative Refinement Of The Reservoir, R David Norton

Theses and Dissertations

Liquid State Machines (LSMs) exploit the power of recurrent spiking neural networks (SNNs) without training the SNN. Instead, a reservoir, or liquid, is randomly created which acts as a filter for a readout function. We develop three methods for iteratively refining a randomly generated liquid to create a more effective one. First, we apply Hebbian learning to LSMs by building the liquid with spike-time dependant plasticity (STDP) synapses. Second, we create an eligibility based reinforcement learning algorithm for synaptic development. Third, we apply principles of Hebbian learning and reinforcement learning to create a new algorithm called separation driven synaptic modification …