Search Constraints

Start Over
Filtering by: Alternative title ssim No. 15 Remove constraint Alternative title ssim: No. 15 Advisor Dietterich, Thomas G. Remove constraint Advisor: Dietterich, Thomas G. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Protein secondary structure prediction using conditional random fields and profiles

    Creator:
    Shen, Rongkun
    Abstract:
    Protein secondary structure prediction plays a pivotal role in predicting protein folding in three-dimensions. Its task is to assign each residue one of the three secondary structure classes helix, strand, or random coil. This is an instance of the problem of sequential supervised learning in machine learning. This thesis describes...
    Resource Type:
    Masters Thesis
    Full Text:
    window size of 15 residues, and 3 rounds of PSI-BLAST searching. The mean three-state prediction

  • Shrunken learning rates do not improve AdaBoost on benchmark datasets

    Creator:
    Forrest, Daniel L. K.
    Abstract:
    Recent work has shown that AdaBoost can be viewed as an algorithm that maximizes the margin on the training data via functional gradient descent. Under this interpretation, the weight computed by AdaBoost, for each hypothesis generated, can be viewed as a step size parameter in a gradient descent search. Friedman...
    Resource Type:
    Masters Thesis
    Full Text:
    on 28 benchmark datasets. The results show that reduced learning rates provide no statistically

  • Evaluation functions in aerial image segmentation

    Creator:
    Langford, William T.
    Abstract:
    Remote sensing is the most practical way to acquire large amounts of land cover data for monitoring and understanding environmental change, so it is important to be able to map land cover from imagery. Maps defining land cover patches as polygons rather than pixels greatly improve processing efficiency in models...
    Resource Type:
    Dissertation
    Full Text:
    generated from images is generally specified in terms of classification accuracy with no specification of

  • Improving automated email tagging with implicit feedback

    Creator:
    Sorower, Mohammad Shahed
    Abstract:
    Machine learning systems are generally trained offline using ground truth data that has been labeled by experts. However, these batch training methods are not a good fit for many applications, especially in the cases where complete ground truth data is not available for offline training. In addition, batch methods do...
    Resource Type:
    Dissertation
    Full Text:
    Baseline Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.3.1 No Implicit

  • Simulator-Defined MDP Planning with Applications in Natural Resource Management

    Creator:
    Alkaee Taleghan, Majid
    Abstract:
    This work is inspired by problems in natural resource management centered on the challenge of invasive species. Computing optimal management policies for maintaining ecosystem sustainable is challenging. Many ecosystem management problems can be formulated as MDP (Markov Decision Process) planning problems. In a simulator-defined MDP, the Markovian dynamics and rewards...
    Resource Type:
    Dissertation
    Full Text:
    Good-Turing confidence intervals. Values are the mean of 15 in- dependent trials. Error bars (which are

  • 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:
    . . . . . . . . . . . . . . . . . . . . . . . . 15 2.5 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.5.1

  • Machine learning in engineering : techniques to speed up numerical optimization

    Creator:
    Cerbone, G. (Giuseppe)
    Abstract:
    Many important application problems in engineering can be formalized as nonlinear optimization tasks. However, numerical methods for solving such problems are brittle and do not scale well. For example, these methods depend critically on choosing a good starting point from which to perform the optimization search. In high-dimensional spaces, numerical...
    Resource Type:
    Dissertation
    Full Text:
    . 51 15. Sample speedup curve 62 16. Sample learning curve. 63 17. Sample tradeoff curve. 65

  • A Benchmarking Study of Unsupervised Anomaly Detection Algorithms

    Creator:
    Emmott, Andrew F.
    Abstract:
    It is common practice in the unsupervised anomaly detection literature to create experimental benchmarks by sampling from existing supervised learning datasets. We seek to improve this practice by identifying four dimensions important to real-world anomaly detection applications --- point difficulty, clusteredness of anomalies, relevance of features, and relative frequency of...
    Resource Type:
    Masters Thesis
    Full Text:
    (lift)) . 130 G.15 Algorithm Performance When Contrasting ncs and ncc (log(lift)) . . 130 G.16

  • Learning MDP action models via discrete mixture trees

    Creator:
    Wynkoop, Michael S.
    Abstract:
    This thesis addresses the problem of learning dynamic Bayesian network (DBN) models to support reinforcement learning. It focuses on learning regression tree models of the conditional probability distributions of the DBNs. Existing algorithms presume that the stochasticity in the domain can be modeled as a deterministic function with additive noise....
    Resource Type:
    Masters Thesis
    Full Text:
    pre-pruning in our tree growth algorithm. First, 15 no split can be made from a node that contains

  • Monte Carlo Tree Search with Fixed and Adaptive Abstractions

    Creator:
    Hostetler, Jesse A.
    Abstract:
    Monte Carlo tree search (MCTS) is a class of online planning algorithms for Markov decision processes (MDPs) and related models that has found success in challenging applications. In the online planning approach, the agent makes a decision in the current state by performing a limited forward search over possible futures...
    Resource Type:
    Dissertation
    Full Text:
    functions µ 6= µ∗. Edge labels denote transition probabilities. . . . . . . . . . . . . . . . . . . . . . 15