Exploiting geometry, topology, and optimization for knowledge discovery in big data
| dc.contributor.author | Ziegelmeier, Lori Beth, author | |
| dc.contributor.author | Kirby, Michael, advisor | |
| dc.contributor.author | Peterson, Chris, advisor | |
| dc.contributor.author | Liu, Jiangguo (James), committee member | |
| dc.contributor.author | Draper, Bruce, committee member | |
| dc.date.accessioned | 2007-01-03T05:56:10Z | |
| dc.date.available | 2014-09-30T05:54:08Z | |
| dc.date.issued | 2013 | |
| dc.description | Zip file contains supplementary videos. | |
| dc.description.abstract | In this dissertation, we consider several topics that are united by the theme of topological and geometric data analysis. First, we consider an application in landscape ecology using a well-known vector quantization algorithm to characterize and segment the color content of natural imagery. Color information in an image may be viewed naturally as clusters of pixels with similar attributes. The inherent structure and distribution of these clusters serves to quantize the information in the image and provides a basis for classification. A friendly graphical user interface called Biological Landscape Organizer and Semi-supervised Segmenting Machine (BLOSSM) was developed to aid in this classification. We consider four different choices for color space and five different metrics in which to analyze our data, and results are compared. Second, we present a novel topologically driven clustering algorithm that blends Locally Linear Embedding (LLE) and vector quantization by mapping color information to a lower dimensional space, identifying distinct color regions, and classifying pixels together based on both a proximity measure and color content. It is observed that these techniques permit a significant reduction in color resolution while maintaining the visually important features of images. Third, we develop a novel algorithm which we call Sparse LLE that leads to sparse representations in local reconstructions by using a data weighted 1-norm regularization term in the objective function of an optimization problem. It is observed that this new formulation has proven effective at automatically determining an appropriate number of nearest neighbors for each data point. We explore various optimization techniques, namely Primal Dual Interior Point algorithms, to solve this problem, comparing the computational complexity for each. Fourth, we present a novel algorithm that can be used to determine the boundary of a data set, or the vertices of a convex hull encasing a point cloud of data, in any dimension by solving a quadratic optimization problem. In this problem, each point is written as a linear combination of its nearest neighbors where the coefficients of this linear combination are penalized if they do not construct a convex combination, revealing those points that cannot be represented in this way, the vertices of the convex hull containing the data. Finally, we exploit the relatively new tool from topological data analysis, persistent homology, and consider the use of vector bundles to re-embed data in order to improve the topological signal of a data set by embedding points sampled from a projective variety into successive Grassmannians. | |
| dc.format.medium | born digital | |
| dc.format.medium | doctoral dissertations | |
| dc.format.medium | ZIP | |
| dc.format.medium | AVI | |
| dc.identifier | Ziegelmeier_colostate_0053A_11950.pdf | |
| dc.identifier | Ziegelmeier_colostate_0053A_11950_suppl.zip | |
| dc.identifier.uri | http://hdl.handle.net/10217/88343 | |
| dc.language | English | |
| dc.language.iso | eng | |
| dc.publisher | Colorado State University. Libraries | |
| dc.relation.ispartof | 2000-2019 | |
| dc.rights | Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright. | |
| dc.subject | Convex Hull | |
| dc.subject | dimensionality reduction | |
| dc.subject | topology | |
| dc.subject | quantization | |
| dc.subject | optimization | |
| dc.subject | geometry | |
| dc.title | Exploiting geometry, topology, and optimization for knowledge discovery in big data | |
| dc.type | Text | |
| dcterms.rights.dpla | This Item is protected by copyright and/or related rights (https://rightsstatements.org/vocab/InC/1.0/). You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). | |
| thesis.degree.discipline | Mathematics | |
| thesis.degree.grantor | Colorado State University | |
| thesis.degree.level | Doctoral | |
| thesis.degree.name | Doctor of Philosophy (Ph.D.) |