Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/26653
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | McNicholas, Paul D. | - |
dc.contributor.author | Tait, Peter A. | - |
dc.date.accessioned | 2021-07-12T01:30:54Z | - |
dc.date.available | 2021-07-12T01:30:54Z | - |
dc.date.issued | 2021 | - |
dc.identifier.uri | http://hdl.handle.net/11375/26653 | - |
dc.description.abstract | Clustering is the process of finding underlying group structure in data. As the scale of data collection continues to grow, this “big data” phenomenon results in more complex data structures. These data structures are not always compatible with traditional clustering methods, making their use problematic. This thesis presents methodology for analyzing samples of four-way and higher data, examples of these more complex data types. These data structures consist of samples of continuous data arranged in multidimensional arrays. A large emphasis is placed on clustering this data using mixture models that leverage tensor-variate distributions to model the data. Parameter estimation for all these methods are based on the expectation-maximization algorithm. Both simulated and real data are used for illustration. | en_US |
dc.language.iso | en | en_US |
dc.subject | Mixture models | en_US |
dc.subject | Tensors | en_US |
dc.subject | Skewed probability distributions | en_US |
dc.subject | EM algorithm | en_US |
dc.subject | Multidimensional arrays | en_US |
dc.title | Analysis of Four and Five-Way Data and Other Topics in Clustering | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | Statistics | en_US |
dc.description.degreetype | Thesis | en_US |
dc.description.degree | Doctor of Science (PhD) | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tait_peter_a_20216_phd.pdf | Peter Tait's PhD thesis | 2.49 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.