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

Physical Sciences and Mathematics Commons

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

LSU Doctoral Dissertations

Computer Sciences

Machine learning

Articles 1 - 7 of 7

Full-Text Articles in Physical Sciences and Mathematics

Visual Analytics And Modeling Of Materials Property Data, Diwas Bhattarai Jan 2023

Visual Analytics And Modeling Of Materials Property Data, Diwas Bhattarai

LSU Doctoral Dissertations

Due to significant advancements in experimental and computational techniques, materials data are abundant. To facilitate data-driven research, it calls for a system for managing and sharing data and supporting a set of tools for effective data analysis and modeling. Generally, a given material property M can be considered as a multivariate data problem. The dimensions of M are the values of the property itself, the conditions (pressure P, temperature T, and multi-component composition X) that control the concerned property, and relevant metadata I (source, date).

Here we present a comprehensive database considering both experimental and computational sources …


Machine Learning Methods For Depression Detection Using Smri And Rs-Fmri Images, Marzieh Sadat Mousavian May 2021

Machine Learning Methods For Depression Detection Using Smri And Rs-Fmri Images, Marzieh Sadat Mousavian

LSU Doctoral Dissertations

Major Depression Disorder (MDD) is a common disease throughout the world that negatively influences people’s lives. Early diagnosis of MDD is beneficial, so detecting practical biomarkers would aid clinicians in the diagnosis of MDD. Having an automated method to find biomarkers for MDD is helpful even though it is difficult. The main aim of this research is to generate a method for detecting discriminative features for MDD diagnosis based on Magnetic Resonance Imaging (MRI) data.

In this research, representational similarity analysis provides a framework to compare distributed patterns and obtain the similarity/dissimilarity of brain regions. Regions are obtained by either …


Seavipers - Computer Vision And Inertial Position Reference Sensor System (Cviprss), Justin Lee Erdman Jan 2015

Seavipers - Computer Vision And Inertial Position Reference Sensor System (Cviprss), Justin Lee Erdman

LSU Doctoral Dissertations

This work describes the design and development of an optical, Computer Vision (CV) based sensor for use as a Position Reference System (PRS) in Dynamic Positioning (DP). Using a combination of robotics and CV techniques, the sensor provides range and heading information to a selected reference object. The proposed optical system is superior to existing ones because it does not depend upon special reflectors nor does it require a lengthy set-up time. This system, the Computer Vision and Inertial Position Reference Sensor System (CVIPRSS, pronounced \nickname), combines a laser rangefinder, infrared camera, and a pan--tilt unit with the robust TLD …


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 …


Knowledge-Based Methods For Automatic Extraction Of Domain-Specific Ontologies, Janardhana R. Punuru Jan 2007

Knowledge-Based Methods For Automatic Extraction Of Domain-Specific Ontologies, Janardhana R. Punuru

LSU Doctoral Dissertations

Semantic web technology aims at developing methodologies for representing large amount of knowledge in web accessible form. The semantics of knowledge should be easy to interpret and understand by computer programs, so that sharing and utilizing knowledge across the Web would be possible. Domain specific ontologies form the basis for knowledge representation in the semantic web. Research on automated development of ontologies from texts has become increasingly important because manual construction of ontologies is labor intensive and costly, and, at the same time, large amount of texts for individual domains is already available in electronic form. However, automatic extraction of …


Learning Discrete Hidden Markov Models From State Distribution Vectors, Luis G. Moscovich Jan 2005

Learning Discrete Hidden Markov Models From State Distribution Vectors, Luis G. Moscovich

LSU Doctoral Dissertations

Hidden Markov Models (HMMs) are probabilistic models that have been widely applied to a number of fields since their inception in the late 1960’s. Computational Biology, Image Processing, and Signal Processing, are but a few of the application areas of HMMs. In this dissertation, we develop several new efficient learning algorithms for learning HMM parameters. First, we propose a new polynomial-time algorithm for supervised learning of the parameters of a first order HMM from a state probability distribution (SD) oracle. The SD oracle provides the learner with the state distribution vector corresponding to a query string. We prove the correctness …


Machine Learning Techniques For Efficient Query Processing In Kowledge Base Systems, Kevin Paul Grant Jan 2003

Machine Learning Techniques For Efficient Query Processing In Kowledge Base Systems, Kevin Paul Grant

LSU Doctoral Dissertations

In this dissertation we propose a new technique for efficient query processing in knowledge base systems. Query processing in knowledge base systems poses strong computational challenges because of the presence of combinatorial explosion. This arises because at any point during query processing there may be too many subqueries available for further exploration. Overcoming this difficulty requires effective mechanisms for choosing from among these subqueries good subqueries for further processing. Inspired by existing works on stochastic logic programs, compositional modeling and probabilistic heuristic estimates we create a new, nondeterministic method to accomplish the task of subquery selection for query processing. Specifically, …