Lori Ziegelmeier
Macalester College
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Lori Ziegelmeier.
PRIMUS | 2015
Lori Ziegelmeier; Chad M. Topaz
Abstract Flipping the classroom refers to moving lectures outside of the classroom to incorporate other activities into a class during its standard meeting time. This pedagogical modality has recently gained traction as a way to center the learning on students in mathematics classrooms. In an effort to better understand the efficacy of this approach, we implemented a controlled study at a small liberal arts college. We compared two sections of the entry-level course applied multivariable calculus I, with one section taught in a traditional lecture-based format and the other taught as a flipped classroom. During our study, we collected and analyzed data related to student performance, as well as perceptions of the approach and attitude toward mathematics in general. Students in both classes scored similarly on graded components of the course, and the majority of students were comfortable with the format of each section. However, some student perceptions and study habits differed.
international geoscience and remote sensing symposium | 2015
Sofya Chepushtanova; Michael Kirby; Chris Peterson; Lori Ziegelmeier
We present an application of persistent homology to the detection of chemical plumes in hyperspectral movies. The pixels of the raw hyperspectral data cubes are mapped to the geometric framework of the real Grassmann manifold G(k, n) (whose points parameterize the k-dimensional subspaces of ℝn) where they are analyzed, contrasting our approach with the more standard framework in Euclidean space. An advantage of this approach is that it allows the time slices in a hyperspectral movie to be collapsed to a sequence of points in such a way that some of the key structure within and between the slices is encoded by the points on the Grassmann manifold. This motivates the search for topological structure, associated with the evolution of the frames of a hyperspectral movie, within the corresponding points on the Grassmann manifold. The proposed framework affords the processing of large data sets, such as the hyperspectral movies explored in this investigation, while retaining valuable discriminative information.
Archive | 2018
Ellen Gasparovic; Maria Gommel; Emilie Purvine; Bei Wang; Yusu Wang; Lori Ziegelmeier
Metric graphs are special types of metric spaces used to model and represent simple, ubiquitous, geometric relations in data such as biological networks, social networks, and road networks. We are interested in giving a qualitative description of metric graphs using topological summaries. In particular, we provide a complete characterization of the one-dimensional intrinsic Cech persistence diagrams for finite metric graphs using persistent homology. Together with complementary results by Adamaszek et al., which imply the results on intrinsic Cech persistence diagrams in all dimensions for a single cycle, our results constitute the important steps toward characterizing intrinsic Cech persistence diagrams for arbitrary finite metric graphs across all dimensions.
computational topology in image context | 2016
Sofya Chepushtanova; Michael Kirby; Chris Peterson; Lori Ziegelmeier
The existence of characteristic structure, or shape, in complex data sets has been recognized as increasingly important for mathematical data analysis. This realization has motivated the development of new tools such as persistent homology for exploring topological invariants, or features, in large data sets. In this paper, we apply persistent homology to the characterization of gas plumes in time dependent sequences of hyperspectral cubes, i.e. the analysis of 4-way arrays. We investigate hyperspectral movies of Long-Wavelength Infrared data monitoring an experimental release of chemical simulant into the air. Our approach models regions of interest within the hyperspectral data cubes as points on the real Grassmann manifold Gk,i¾?n whose points parameterize the k-dimensional subspaces of
international conference on conceptual structures | 2017
Lori Ziegelmeier; Michael Kirby; Chris Peterson
Siam Review | 2017
Lori Ziegelmeier; Michael Kirby; Chris Peterson
\mathbb {R}^n
Journal of Machine Learning Research | 2017
Henry Adams; Tegan Emerson; Michael Kirby; Rachel Neville; Chris Peterson; Patrick D. Shipman; Sofya Chepushtanova; Eric M. Hanson; Francis C. Motta; Lori Ziegelmeier
arXiv: Computational Geometry | 2015
Sofya Chepushtanova; Tegan Emerson; Eric M. Hanson; Michael Kirby; Francis C. Motta; Rachel Neville; Chris Peterson; Patrick D. Shipman; Lori Ziegelmeier
Rn, contrasting our approach with the more standard framework in Euclidean space. An advantage of this approach is that it allows a sequence of time slices in a hyperspectral movie to be collapsed to a sequence of points in such a way that some of the key structure within and between the slices is encoded by the points on the Grassmann manifold. This motivates the search for topological features, associated with the evolution of the frames of a hyperspectral movie, within the corresponding points on the Grassmann manifold. The proposed mathematical model affords the processing of large data sets while retaining valuable discriminatory information. In this paper, we discuss how embedding our data in the Grassmann manifold, together with topological data analysis, captures dynamical events that occur as the chemical plume is released and evolves.
symposium on computational geometry | 2018
Michal Adamaszek; Henry Adams; Ellen Gasparovic; Maria Gommel; Emilie Purvine; Bei Wang; Yusu Wang; Lori Ziegelmeier
Abstract The Locally Linear Embedding (LLE) algorithm has proven useful for determining structure preserving, dimension reducing mappings of data on manifolds. We propose a modification to the LLE optimization problem that serves to minimize the number of neighbors required for the representation of each data point. The algorithm is shown to be robust over wide ranges of the sparsity parameter producing an average number of nearest neighbors that is consistent with the best performing parameter selection for LLE. Given the number of non-zero weights may be substantially reduced in comparison to LLE, Sparse LLE can be applied to larger data sets. We provide three numerical examples including a color image, the standard swiss roll, and a gene expression data set to illustrate the behavior of the method in comparison to LLE. The resulting algorithm produces comparatively sparse representations that preserve the neighborhood geometry of the data in the spirit of LLE.
arXiv: Geometric Topology | 2012
Lori Ziegelmeier; Michael Kirby; Chris Peterson
The convex hull of a set of points,