Search Constraints

Start Over
Filtering by: Creator Moerman, Kevin M. Remove constraint Creator: Moerman, Kevin M. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • A collaborative filtering algorithm and evaluation metric that accurately model the user experience

    Creator:
    McLaughlin, Matthew
    Abstract:
    "Collaborative filtering algorithms’ performances have been evaluated using a variety of metrics. These metrics, such as Mean Absolute Error and Precision, have often ignored recommendations for which they do not have data. Ignoring these recommendations has provided numbers which do not accurately represent the user experience. Qualitatively we have seen...
    Resource Type:
    Capstone Project
    Full Text:
    like to thank Suzanne, Joe, and Kevin for making college tolerable at the worst of times and highly

  • Explanations and Processes to Enable Humans to Assess AI with Respect to Manipulable Properties

    Creator:
    Dodge, Jonathan E.
    Abstract:
    Assessing AI systems is difficult. Humans rely on AI systems in increasing ways, both visible and invisible, meaning a variety of stakeholders need a variety of assessment tools (e.g., a professional auditor, a developer, and an end user all have different needs). We posit that it is possible to provide...
    Resource Type:
    Dissertation
    Full Text:
    which we could not have proceeded; Kevin McGrath, for keeping me in the PhD program; Forrest Briggs

  • 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:
    AN ABSTRACT OF THE DISSERTATION OF Jeffrey M. Young for

  • The density signature

    Creator:
    Migler-VonDollen, Theresa
    Abstract:
    In real networks, identifying dense regions is of great importance. For example, in a network that represents academic collaboration, authors within the densest component of the graph tend to be the most prolific. Dense subgraphs often identify communities in social networks. And dense subgraphs can be used to discover regulatory...
    Resource Type:
    Dissertation
    Full Text:
    4 Six degrees of Kevin Bacon: the density signature and other graph measures 31 4.1 Basic

  • 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:
    deductive system implemented in LinearFold program. Here δE, δM , ξMij , ξ E ij , ξ H ij , ξ S ij, and ω

  • 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

  • Incorporating User Feedback into Machine Learning Systems

    Creator:
    Das, Shubhomoy
    Abstract:
    Although machine learning systems are often effective in real-world applications, there are situations in which they can be even better when provided with some degree of end user feedback. This is especially true when the machine learning system needs to customize itself to the end user's preferences, such as in...
    Resource Type:
    Dissertation
    Full Text:
    to the 13 training data. The conditional probability for an M-class problem is: Pθ(yi = cj |xi

  • Learning greedy policies for the easy-first framework

    Creator:
    Xie, Jun
    Abstract:
    Easy-first, a search-based structured prediction approach, has been applied to many NLP tasks including dependency parsing and coreference resolution. This approach employs a learned greedy policy (action scoring function) to make easy decisions first, which constrains the remaining decisions and makes them easier. This thesis studies the problem of learning...
    Resource Type:
    Masters Thesis

  • Object Tracking-by-Segmentation in Videos

    Creator:
    Chen, Sheng
    Abstract:
    This thesis focuses on the problem of object tracking. Given a video, the general objective of tracking is to track the location over time of one or more targets in the image sequence. This is a very challenging task as algorithms need to deal with problems such as appearance variations,...
    Resource Type:
    Dissertation
    Full Text:
    cost functions that are expressed as C(Si, l | L) = w · Ψ(Si, l, L), where w is an m-dimensional

  • 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