EXAMINING THE IMPLEMENTATION CHALLENGES OF PROJECT-BASED LEARNING: A CASE STUDY

Title of Thesis: Thesis directed by: ABSTRACT EXAMINING THE IMPLEMENTATION CHALLENGES OF PROJECT-BASED LEARNING: A CASE STUDY Stefan Frederick Brooks, Master of Education, 2016 Professor and Chair Francine Hultgren Teaching and Learning, Policy and Leadership Department Project-based learning (PjBL) is a common instructional strategy to consider for educators, scholars, and advocates who focus on education reform. Previous research on PjBL has focused on its effectiveness, but a limited amount of research exists on the implementation challenges. This exploratory case study examines an attempted project- based learning implementation in one chemistry classroom at a private school that fully supports PjBL for most subjects with limited use in mathematics. During the course of the study, the teacher used a modified version of PjBL. Specifically, he implemented some of the elements of PjBL, such as a driving theme and a public presentation of projects, with the support of traditional instructional methods due to the context of the classroom. The findings of this study emphasize the teacher’s experience with implementing some of the PjBL components and how the inherent implementation challenges affected his practice.

Learning Binary Code Representations for Effective and Efficient Image Retrieval

The size of online image datasets is constantly increasing. Considering an image dataset with millions of images, image retrieval becomes a seemingly intractable problem for exhaustive similarity search algorithms. Hashing methods, which encodes high-dimensional descriptors into compact binary strings, have become very popular because of their high efficiency in search and storage capacity. In the first part, we propose a multimodal retrieval method based on latent feature models. The procedure consists of a nonparametric Bayesian framework for learning underlying semantically meaningful abstract features in a multimodal dataset, a probabilistic retrieval model that allows cross-modal queries and an extension model for relevance feedback. In the second part, we focus on supervised hashing with kernels. We describe a flexible hashing procedure that treats binary codes and pairwise semantic similarity as latent and observed variables, respectively, in a probabilistic model based on Gaussian processes for binary classification. We present a scalable inference algorithm with the sparse pseudo-input Gaussian process (SPGP) model and distributed computing. In the last part, we define an incremental hashing strategy for dynamic databases where new images are added to the databases frequently. The method is based on a two-stage classification framework using binary and multi-class SVMs. The proposed method also enforces balance in binary codes by an imbalance penalty to obtain higher quality binary codes. We learn hash functions by an efficient algorithm where the NP-hard problem of finding optimal binary codes is solved via cyclic coordinate descent and SVMs are trained in a parallelized incremental manner. For modifications like adding images from an unseen class, we propose an incremental procedure for effective and efficient updates to the previous hash functions. Experiments on three large-scale image datasets demonstrate that the incremental strategy is capable of efficiently updating hash functions to the same retrieval performance as hashing from scratch.