Search Constraints

Start Over
Filtering by: Creator Welter, Stephen C. Remove constraint Creator: Welter, Stephen C. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Variant Annotation

    Creator:
    He, Jun
    Abstract:
    With the development of technologies in genome sequencing and variant detection, a huge number of variants are detected. To further analyze the variants, it requires an efficient tool to annotate the functional effect of variants. This project managed to develop an efficient program to annotate the functional effect of variants...
    Resource Type:
    Capstone Project
    Full Text:
    approved: Stephen Ramsey With the development of technologies in genome sequencing and variant detection

  • Analytical Methods for Improving Causal Inference

    Creator:
    Sinha, Meghamala
    Abstract:
    Causal inference is an important analytical tool to bridge the gap between prediction and decision-making. However, learning a causal network solely from data is a challenging task. In this work, various techniques have been explored for a better and improved causal network learning from data. Firstly, the problem of learning...
    Resource Type:
    Dissertation
    Full Text:
    : Analytical Methods for Improving Causal Inference Abstract approved: Stephen A. Ramsey Causal inference is

  • Deep Learning for Human and Biological Languages

    Creator:
    Hong, Junki
    Abstract:
    We explore the application of deep learning to the disparate fields of natural language processing and computational biology. Both the sentences uttered by humans as well as the RNA and protein sequences found within the cells of their bodies can be considered formal languages in computer science, as sets of...
    Resource Type:
    Dissertation
    Full Text:
    Adenine (A) prefers to bind with Uracil (U) and Cytosine (C) prefers to bind with Guanine (G). The

  • Learning with Limited Labeled Data in Natural Language Processing

    Creator:
    Obeidat, Rasha
    Abstract:
    The advent of deep learning models leads to a substantial improvement in a wide range of NLP tasks, achieving state-of-art performances without any hand-crafted features. However, training deep models requires a massive amount of labeled data. Labeling new data as a new task or domain emerges consumes time and efforts...
    Resource Type:
    Dissertation
    Full Text:
    . Liang Huang, Prof Stephen A Ramsey, Prof. Brett Tyler, and Prof. Sushma Naithani, for their insight

  • Interpretable Machine Learning: Applications in Biology and Genomics

    Creator:
    Danaee, Padideh
    Abstract:
    Machine learning (ML) and deep learning (DL) models impact our daily lives with applications in natural language modeling, image analysis, healthcare, genomics, and bioinformatics. The exponential growth of biological sequence data necessitates accompanying advances in computational methods. Although deep learning is highly effective for detecting and classifying biological sequences, challenges...
    Resource Type:
    Dissertation
    Full Text:
    applicable more broadly to other areas of data science. c�Copyright by Padideh Danaee December 6, 2019

  • Learning with Partial Supervision for Clustering and Classification

    Creator:
    Pei, Yuanli
    Abstract:
    In the field of machine learning, clustering and classification are two fundamental tasks. Traditionally, clustering is an unsupervised method, where no supervision about the data is available for learning; classification is a supervised task, where fully-labeled data are collected for training a classifier. In some scenarios, however, we may not...
    Resource Type:
    Dissertation
    Full Text:
    triplets respectively; c) active learning of pairwise constraints for clustering, where the goal is to

  • A SAT-based planning framework for optimizing resource production

    Creator:
    Ventura, Christopher
    Abstract:
    Domain-independent automated planning is concerned with computing a sequence of actions that can transform an initial state into a desired goal state. Resource production domains form an interesting class of such problems, in that they typically require reasoning about concurrent durative-actions with continuous effects while minimizing some cost function. Although...
    Resource Type:
    Masters Thesis
    Full Text:
    C:/Documents and Settings/Chris Ventura/Desktop/thesis/thesis.dvi

  • Variational Satisfiability Solving

    Creator:
    Young, Jeffrey M.
    Abstract:
    Over the last two decades, satisfiability and satisfiability-modulo theory (SAT/SMT) solvers have grown powerful enough to be general purpose reasoning engines throughout software engineering and computer science. However, most practical use cases of SAT/SMT solvers require not just solving a single SAT/SMT problem, but solving sets of related SAT/SMT problems....
    Resource Type:
    Dissertation
    Full Text:
    incremental SAT program which is suitable for execution on an incremental SAT solver. (c) A formal

  • Representationally Robust and Scalable Learning over Relational Databases

    Creator:
    Picado Leiva, Jose Manuel
    Abstract:
    Learning novel concepts from relational databases is an important problem with applications in several disciplines, such as data management, natural language processing, and bioinformatics. For a learning algorithm to be effective, the input data should be clean and in some desired representation. However, real-world data is usually heterogeneous – the...
    Resource Type:
    Dissertation
    Full Text:
    wrangling with robust learning algorithms. c©Copyright by Jose Manuel Picado Leiva May 28, 2019 All

  • Computational Approaches for RNA Structure Prediction with Dynamic Programming and Deep Neural Networks

    Creator:
    Deng, Dezhong
    Abstract:
    Our goal is to build a system to model the RNA sequences that reveals their structural information by using efficient dynamic programming algorithms and deep learning approaches. We aim to 1) achieve linear-time for RNA secondary structure prediction based on existing minimum free energy models; 2) utilize deep neural networks...
    Resource Type:
    Dissertation
    Full Text:
    visualization purposes. c©Copyright by Dezhong Deng December 10, 2019 All Rights Reserved Computational