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

Physical Sciences and Mathematics Commons

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

Machine learning

Discipline
Institution
Publication Year
Publication
Publication Type
File Type

Articles 2041 - 2070 of 2160

Full-Text Articles in Physical Sciences and Mathematics

A Machine Learning Approach To Diagnosis Of Parkinson’S Disease, Sumaiya F. Hashmi Jan 2013

A Machine Learning Approach To Diagnosis Of Parkinson’S Disease, Sumaiya F. Hashmi

CMC Senior Theses

I will investigate applications of machine learning algorithms to medical data, adaptations of differences in data collection, and the use of ensemble techniques.

Focusing on the binary classification problem of Parkinson’s Disease (PD) diagnosis, I will apply machine learning algorithms to a primary dataset consisting of voice recordings from healthy and PD subjects. Specifically, I will use Artificial Neural Networks, Support Vector Machines, and an Ensemble Learning algorithm to reproduce results from [MS12] and [GM09].

Next, I will adapt a secondary regression dataset of PD recordings and combine it with the primary binary classification dataset, testing various techniques to consolidate …


Artificial Intelligence And Data Mining: Algorithms And Applications, Jianhong Xia, Fuding Xie, Yong Zhang, Craig Caulfield Jan 2013

Artificial Intelligence And Data Mining: Algorithms And Applications, Jianhong Xia, Fuding Xie, Yong Zhang, Craig Caulfield

Research outputs 2013

Artificial intelligence and data mining techniques have been used in many domains to solve classification, segmentation, association, diagnosis, and prediction problems. The overall aim of this special issue is to open a discussion among researchers actively working on algorithms and applications. The issue covers a wide variety of problems for computational intelligence, machine learning, time series analysis, remote sensing image mining, and pattern recognition. After a rigorous peer review process, 20 papers have been selected from 38 submissions. The accepted papers in this issue addressed the following topics: (i) advanced artificial intelligence and data mining techniques; (ii) computational intelligence in …


On Identifying Critical Nuggets Of Information During Classification Task, David Sathiaraj Jan 2013

On Identifying Critical Nuggets Of Information During Classification Task, David Sathiaraj

LSU Doctoral Dissertations

In large databases, there may exist critical nuggets - small collections of records or instances that contain domain-specific important information. This information can be used for future decision making such as labeling of critical, unlabeled data records and improving classification results by reducing false positive and false negative errors. In recent years, data mining efforts have focussed on pattern and outlier detection methods. However, not much effort has been dedicated to finding critical nuggets within a data set. This work introduces the idea of critical nuggets, proposes an innovative domain-independent method to measure criticality, suggests a heuristic to reduce the …


Automated Detection Of Vehicles With Machine Learning, Michael N. Johnstone, Andrew Woodward Jan 2013

Automated Detection Of Vehicles With Machine Learning, Michael N. Johnstone, Andrew Woodward

Australian Information Security Management Conference

Considering the significant volume of data generated by sensor systems and network hardware which is required to be analysed and intepreted by security analysts, the potential for human error is significant. This error can lead to consequent harm for some systems in the event of an adverse event not being detected. In this paper we compare two machine learning algorithms that can assist in supporting the security function effectively and present results that can be used to select the best algorithm for a specific domain. It is suggested that a naive Bayesian classiifer (NBC) and an artificial neural network (ANN) …


Concept Drift Datasets, Patrick Lindstrom Jan 2013

Concept Drift Datasets, Patrick Lindstrom

Doctoral

This zip file contains the datasets used in the PhD thesis:

Lindstrom, P., 2013. Handling Concept Drift in the Context of Expensive Labels. Technological University Dublin. For more information about the datasets please see the README file and the aforementioned thesis.


Human Intention Recognition Based Assisted Telerobotic Grasping Of Objects In An Unstructured Environment, Karan Hariharan Khokar Jan 2013

Human Intention Recognition Based Assisted Telerobotic Grasping Of Objects In An Unstructured Environment, Karan Hariharan Khokar

USF Tampa Graduate Theses and Dissertations

In this dissertation work, a methodology is proposed to enable a robot to identify an object to be grasped and its intended grasp configuration while a human is teleoperating a robot towards the desired object. Based on the detected object and grasp configuration, the human is assisted in the teleoperation task. The environment is unstructured and consists of a number of objects, each with various possible grasp configurations. The identification of the object and the grasp configuration is carried out in real time, by recognizing the intention of the human motion. Simultaneously, the human user is assisted to preshape over …


Computationally Efficient Confidence Intervals For Cross-Validated Area Under The Roc Curve Estimates, Erin Ledell, Maya L. Petersen, Mark J. Van Der Laan Dec 2012

Computationally Efficient Confidence Intervals For Cross-Validated Area Under The Roc Curve Estimates, Erin Ledell, Maya L. Petersen, Mark J. Van Der Laan

U.C. Berkeley Division of Biostatistics Working Paper Series

In binary classification problems, the area under the ROC curve (AUC), is an effective means of measuring the performance of your model. Most often, cross-validation is also used, in order to assess how the results will generalize to an independent data set. In order to evaluate the quality of an estimate for cross-validated AUC, we must obtain an estimate for its variance. For massive data sets, the process of generating a single performance estimate can be computationally expensive. Additionally, when using a complex prediction method, calculating the cross-validated AUC on even a relatively small data set can still require a …


Identification Of Tcp Protocols, Juan Shao Dec 2012

Identification Of Tcp Protocols, Juan Shao

School of Computing: Dissertations, Theses, and Student Research

Recently, many new TCP algorithms, such as BIC, CUBIC, and CTCP, have been deployed in the Internet. Investigating the deployment statistics of these TCP algorithms is meaningful to study the performance and stability of the Internet. Currently, there is a tool named Congestion Avoidance Algorithm Identification (CAAI) for identifying the TCP algorithm of a web server and then for investigating the TCP deployment statistics. However, CAAI using a simple k-NN algorithm can not achieve a high identification accuracy. In this thesis, we comprehensively study the identification accuracy of five popular machine learning models. We find that the random forest model …


Bayesian Test Analytics For Document Collections, Daniel David Walker Nov 2012

Bayesian Test Analytics For Document Collections, Daniel David Walker

Theses and Dissertations

Modern document collections are too large to annotate and curate manually. As increasingly large amounts of data become available, historians, librarians and other scholars increasingly need to rely on automated systems to efficiently and accurately analyze the contents of their collections and to find new and interesting patterns therein. Modern techniques in Bayesian text analytics are becoming wide spread and have the potential to revolutionize the way that research is conducted. Much work has been done in the document modeling community towards this end,though most of it is focused on modern, relatively clean text data. We present research for improved …


A Confidence-Prioritization Approach To Data Processing In Noisy Data Sets And Resulting Estimation Models For Predicting Streamflow Diel Signals In The Pacific Northwest, Nathaniel Lee Gustafson Aug 2012

A Confidence-Prioritization Approach To Data Processing In Noisy Data Sets And Resulting Estimation Models For Predicting Streamflow Diel Signals In The Pacific Northwest, Nathaniel Lee Gustafson

Theses and Dissertations

Streams in small watersheds are often known to exhibit diel fluctuations, in which streamflow oscillates on a 24-hour cycle. Streamflow diel fluctuations, which we investigate in this study, are an informative indicator of environmental processes. However, in Environmental Data sets, as well as many others, there is a range of noise associated with individual data points. Some points are extracted under relatively clear and defined conditions, while others may include a range of known or unknown confounding factors, which may decrease those points' validity. These points may or may not remain useful for training, depending on how much uncertainty they …


On The K-Mer Frequency Spectra Of Organism Genome And Proteome Sequences With A Preliminary Machine Learning Assessment Of Prime Predictability, Nathan O. Schmidt Aug 2012

On The K-Mer Frequency Spectra Of Organism Genome And Proteome Sequences With A Preliminary Machine Learning Assessment Of Prime Predictability, Nathan O. Schmidt

Boise State University Theses and Dissertations

A regular expression and region-specific filtering system for biological records at the National Center for Biotechnology database is integrated into an object oriented sequence counting application, and a statistical software suite is designed and deployed to interpret the resulting k-mer frequencies|with a priority focus on nullomers. The proteome k-mer frequency spectra of ten model organisms and the genome k-mer frequency spectra of two bacteria and virus strains for the coding and non-coding regions are comparatively scrutinized. We observe that the naturally-evolved (NCBI/organism) and the artificially-biased (randomly-generated) sequences exhibit a clear deviation from the artificially-unbiased (randomly-generated) histogram distributions. …


On The Automatic Recognition Of Human Activities Using Heterogeneous Wearable Sensors, Oscar David Lara Yejas Jun 2012

On The Automatic Recognition Of Human Activities Using Heterogeneous Wearable Sensors, Oscar David Lara Yejas

USF Tampa Graduate Theses and Dissertations

Delivering accurate and opportune information on people's activities and behaviors has become one of the most important tasks within pervasive computing. Its wide spectrum of potential applications in medical, entertainment, and tactical scenarios, motivates further

research and development of new strategies to improve accuracy, pervasiveness, and eciency.

This dissertation addresses the recognition of human activities (HAR) with wearable sensors in three main regards: In the rst place, physiological signals have been incorporated as a new source of information to improve the recognition accuracy achieved by conventional approaches, which rely on accelerometer signals solely. A new HAR system, Centinela, was born …


Bayesian And Related Methods: Techniques Based On Bayes' Theorem, Mehmet Vurkaç May 2012

Bayesian And Related Methods: Techniques Based On Bayes' Theorem, Mehmet Vurkaç

Systems Science Friday Noon Seminar Series

Bayes' theorem is a simple algebraic consequence of conditional probability. Yet, its consequences are critical to philosophy, society, and technology. Starting from its simple derivation, we will show how its interpretation in terms of base rates (priors) and class-conditional likelihoods illuminates everyday problems in medicine and law, and provides signal processing, communications, machine learning, model selection, and other applications of statistics with powerful classification and estimation tools. Next, we will briefly examine some of the ways in which this theorem can be adopted to include multiple attributes, contexts, hypotheses, and levels of risk. Methods derived from or related to Bayes’ …


The Glass Is Half-Full: Overestimating The Quality Of A Novel Environment Is Advantageous, Oded Berger-Tal, Tal Avgar Apr 2012

The Glass Is Half-Full: Overestimating The Quality Of A Novel Environment Is Advantageous, Oded Berger-Tal, Tal Avgar

Wildland Resources Faculty Publications

According to optimal foraging theory, foraging decisions are based on the forager's current estimate of the quality of its environment. However, in a novel environment, a forager does not possess information regarding the quality of the environment, and may make a decision based on a biased estimate. We show, using a simple simulation model, that when facing uncertainty in heterogeneous environments it is better to overestimate the quality of the environment (to be an “optimist”) than underestimate it, as optimistic animals learn the true value of the environment faster due to higher exploration rate. Moreover, we show that when the …


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 …


Software Process Evaluation: A Machine Learning Approach, Ning Chen, Steven C. H. Hoi, Xiaokui Xiao Nov 2011

Software Process Evaluation: A Machine Learning Approach, Ning Chen, Steven C. H. Hoi, Xiaokui Xiao

Research Collection School Of Computing and Information Systems

Software process evaluation is essential to improve software development and the quality of software products in an organization. Conventional approaches based on manual qualitative evaluations (e.g., artifacts inspection) are deficient in the sense that (i) they are time-consuming, (ii) they suffer from the authority constraints, and (iii) they are often subjective. To overcome these limitations, this paper presents a novel semi-automated approach to software process evaluation using machine learning techniques. In particular, we formulate the problem as a sequence classification task, which is solved by applying machine learning algorithms. Based on the framework, we define a new quantitative indicator to …


Active Multiple Kernel Learning For Interactive 3d Object Retrieval Systems, Steven C. H. Hoi, Rong Jin Oct 2011

Active Multiple Kernel Learning For Interactive 3d Object Retrieval Systems, Steven C. H. Hoi, Rong Jin

Research Collection School Of Computing and Information Systems

An effective relevance feedback solution plays a key role in interactive intelligent 3D object retrieval systems. In this work, we investigate the relevance feedback problem for interactive intelligent 3D object retrieval, with the focus on studying effective machine learning algorithms for improving the user's interaction in the retrieval task. One of the key challenges is to learn appropriate kernel similarity measure between 3D objects through the relevance feedback interaction with users. We address this challenge by presenting a novel framework of Active multiple kernel learning (AMKL), which exploits multiple kernel learning techniques for relevance feedback in interactive 3D object retrieval. …


Active Multiple Kernel Learning For Interactive 3d Object Retrieval Systems, Steven C. H. Hoi, Rong Jin Oct 2011

Active Multiple Kernel Learning For Interactive 3d Object Retrieval Systems, Steven C. H. Hoi, Rong Jin

Research Collection School Of Computing and Information Systems

An effective relevance feedback solution plays a key role in interactive intelligent 3D object retrieval systems. In this work, we investigate the relevance feedback problem for interactive intelligent 3D object retrieval, with the focus on studying effective machine learning algorithms for improving the user's interaction in the retrieval task. One of the key challenges is to learn appropriate kernel similarity measure between 3D objects through the relevance feedback interaction with users. We address this challenge by presenting a novel framework of Active multiple kernel learning (AMKL), which exploits multiple kernel learning techniques for relevance feedback in interactive 3D object retrieval. …


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, …


Hardware Acceleration Of Inference Computing: The Numenta Htm Algorithm, Dan Hammerstrom May 2011

Hardware Acceleration Of Inference Computing: The Numenta Htm Algorithm, Dan Hammerstrom

Systems Science Friday Noon Seminar Series

In this presentation I will describe the latest version of the Numenta HTM Cortical Learning Algorithm and why it is interesting for doing research into radical new computer architectures. Then I will discuss the hardware acceleration research we are doing, and briefly look at some preliminary applications development.


Empirical Methods For Predicting Student Retention- A Summary From The Literature, Matt Bogard May 2011

Empirical Methods For Predicting Student Retention- A Summary From The Literature, Matt Bogard

Economics Faculty Publications

The vast majority of the literature related to the empirical estimation of retention models includes a discussion of the theoretical retention framework established by Bean, Braxton, Tinto, Pascarella, Terenzini and others (see Bean, 1980; Bean, 2000; Braxton, 2000; Braxton et al, 2004; Chapman and Pascarella, 1983; Pascarell and Ternzini, 1978; St. John and Cabrera, 2000; Tinto, 1975) This body of research provides a starting point for the consideration of which explanatory variables to include in any model specification, as well as identifying possible data sources. The literature separates itself into two major camps including research related to the hypothesis testing …


Empirical Methods-A Review: With An Introduction To Data Mining And Machine Learning, Matt Bogard May 2011

Empirical Methods-A Review: With An Introduction To Data Mining And Machine Learning, Matt Bogard

Economics Faculty Publications

This presentation was part of a staff workshop focused on empirical methods and applied research. This includes a basic overview of regression with matrix algebra, maximum likelihood, inference, and model assumptions. Distinctions are made between paradigms related to classical statistical methods and algorithmic approaches. The presentation concludes with a brief discussion of generalization error, data partitioning, decision trees, and neural networks.


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 …


On The Effect Of Criticality And Topology On Learning In Random Boolean Networks, Alireza Goudarzi Jan 2011

On The Effect Of Criticality And Topology On Learning In Random Boolean Networks, Alireza Goudarzi

Systems Science Friday Noon Seminar Series

Random Boolean networks (RBN) are discrete dynamical systems composed of N automata with a binary state, each of which interacts with other automata in the network. RBNs were originally introduced as simplified models of gene regulation. In this presentation, I will present recent work done conjointly with Natali Gulbahce (UCSF), Thimo Rohlf (MPI, CNRS), and Christof Teuscher (PSU). We extend the study of learning in feedforward Boolean networks to random Boolean networks (RBNs) and systematically explore the relationship between the learning capability, the network topology, the system size N, the training sample T, and the complexity of the computational task. …


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, …


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 …


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 …