Browsing by Author "Olsen, David"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Comparisons After Planting of Jack Pine Grown for Varying Time Periods in Different Container Systems
    (St. Paul, Minn. : School of Forestry, University of Minnesota, 1982-08-01) Alm, A.A.; Olsen, David; Lacky, Michelle
  • Thumbnail Image
    Item
    Data supporting: Automated Object Detection in Mobile Eye-Tracking Research: Comparing Manual Coding with Tag Detection, Shape Detection, Matching, and Machine Learning
    (2024-06-20) Segijn, Claire M.; Menheer, Pernu; Lee, Garim; Kim, Eunah; Olsen, David; Hofelich Mohr, Alicia; segijn@umn.edu; Segijn, Claire
    The goal of the current study is to compare the different methods for automated object detection (i.e., tag detection, shape detection, matching, and machine learning) with manual coding on different types of objects (i.e., static, dynamic, and dynamic with human interaction) and describe the advantages and limitations of each method. We tested the methods in an experiment that utilizes mobile eye tracking because of the importance of attention in communication science and the challenges this type of data poses to analyze different objects because visual parameters are consistently changing within and between participants. Python scripts, processed videos, R scripts, and processed data files are included for each method.
  • Thumbnail Image
    Item
    The INCLude (InterNodal Complete Linkage) Hierarchical Clustering Method
    (2015-02) Olsen, David
    The goal of this project was to develop a general, complete linkage hierarchical clustering method that 1) substantially improves upon the accuracy of the standard complete linkage method and 2) can be fully automated or used with minimal operator supervision. For the first part of the project, a new, complete linkage hierarchical clustering method was developed. The INCLude (InterNodal Complete Linkage) hierarchical clustering method unwinds the assumptions that underlie the standard complete linkage method. Further, evaluating pairs of data points for linkage is decoupled from constructing cluster sets, and cluster sets are constructed de novo instead of updating previously constructed cluster sets. Thus, it is possible to construct only the cluster sets for select, possibly noncontiguous levels of an n(n - 1)/2 + 1-level hierarchical sequence. However, by unwinding the assumptions that underlie the standard complete linkage method, the size of a hierarchical sequence reverts back from n levels to n(n - 1)/2 + 1 levels, and the time complexity to construct cluster sets becomes O(n 4). For the second part of the project, a means was developed for finding meaningful levels of an n(n-1)/2 + 1-level hierarchical sequence prior to performing a cluster analysis. The means includes constructing at least one distance graph, which is visually examined for features that correlate with meaningful levels of the corresponding hierarchical sequence. Thus, it is possible to know which cluster sets to construct and construct only these cluster sets. This reduces the time complexity to construct cluster sets from O(n4) to O(ln2), where l is the number of meaningful levels. The second part also looked at how increasing the dimensionality of the data points helps reveal inherent structure in noisy data, which is necessary for finding meaningful levels. The third part of the project resolved how to mathematically capture the graphical relationships that underlie the above-described features and integrate the means into the new clustering method. By doing so, the new method becomes self-contained and incurs almost no extra cost to determine which cluster sets should be constructed and which should not. Empirical results from nine experiments are included.