{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-3044"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-3044","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"HYBRID MIXTURES OF FACTOR ANALYZERS FOR HIGH DIMENSIONAL DATA","abstract":"Factor analysis is a powerful tool for modeling latent structures in high-dimensional data, traditional approaches assume a single global structure, limiting their ability to capture heterogeneity. The Mixture of Factor Analyzers (MFA) extends classical factor analysis by modeling data as a mixture of Gaussian-distributed local subspaces, effectively uncovering cluster-specific latent structures. However, MFA relies on Gaussian mixtures, making it sensitive to outliers and ill-suited for heavy-tailed data. The Mixture of $t$-Factor Analyzers (M$t$FA) addresses these limitations by incorporating multivariate $t$-distributions, improving robustness. Despite their advantages, both MFA and M$t$FA face significant computational challenges in high-dimensional settings, particularly due to costly covariance matrix operations and slow convergence of the Expectation-Maximization (EM) algorithm. In this collection of work, we propose a hybrid approach that integrates a matrix-free algorithm within the EM framework to improve computational efficiency for both MFA and M$t$FA. Our methods preserve the full covariance structure while leveraging matrix-free strategies to optimize computations in high dimensions. This approach maintains the interpretability and flexibility of mixture-based factor models while making them more scalable. Empirical evaluations on synthetic and real-world data reveals that our method significantly improves speed, robustness, while preserving clustering accuracy compared to conventional MFA and M$t$FA models driven by standard EM algorithms. These findings highlight the effectiveness of matrix-free strategies in advancing mixture-based latent variable models for high-dimensional data analysis.","abstract_html":"Factor analysis is a powerful tool for modeling latent structures in high-dimensional data, traditional approaches assume a single global structure, limiting their ability to capture heterogeneity. The Mixture of Factor Analyzers (MFA) extends classical factor analysis by modeling data as a mixture of Gaussian-distributed local subspaces, effectively uncovering cluster-specific latent structures. However, MFA relies on Gaussian mixtures, making it sensitive to outliers and ill-suited for heavy-tailed data. The Mixture of $t$-Factor Analyzers (M$t$FA) addresses these limitations by incorporating multivariate $t$-distributions, improving robustness. Despite their advantages, both MFA and M$t$FA face significant computational challenges in high-dimensional settings, particularly due to costly covariance matrix operations and slow convergence of the Expectation-Maximization (EM) algorithm. In this collection of work, we propose a hybrid approach that integrates a matrix-free algorithm within the EM framework to improve computational efficiency for both MFA and M$t$FA. Our methods preserve the full covariance structure while leveraging matrix-free strategies to optimize computations in high dimensions. This approach maintains the interpretability and flexibility of mixture-based factor models while making them more scalable. Empirical evaluations on synthetic and real-world data reveals that our method significantly improves speed, robustness, while preserving clustering accuracy compared to conventional MFA and M$t$FA models driven by standard EM algorithms. These findings highlight the effectiveness of matrix-free strategies in advancing mixture-based latent variable models for high-dimensional data analysis.","abstract_has_math":true,"creators":["Kareem, Kazeem Abiodun"],"institution":null,"degree_name":"Doctor of Philosophy in Statistics (PhD)","degree_level":"Open Access Dissertation","degree_discipline":"Department of Mathematical Sciences","degree_department":null,"school":null,"contributors":["Fan Dai"],"advisors":[],"committee_chairs":[],"committee_members":["Qiuying Sha","Kui Zhang","Nathir A. Rawashdeh"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:19:20Z","subjects":["factor analysis","clustering","dimensionality reduction","matrix-free computations","expectation-maximization","expectation conditional maximization","Applied Statistics","Bioinformatics","Biostatistics","Data Science","Multivariate Analysis","Statistical Methodology","Statistical Models"],"languages":[],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/1901"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1901","href":"https://digitalcommons.mtu.edu/etdr/1901","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1901","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1901","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.mtu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.mtu.edu%3Aetdr-3044","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Fan Dai"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Qiuying Sha","Kui Zhang","Nathir A. Rawashdeh"]},{"key":"dc:creator","label":"Author","values":["Kareem, Kazeem Abiodun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2026-04-05T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2025-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Open Access Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy in Statistics (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["factor analysis","clustering","dimensionality reduction","matrix-free computations","expectation-maximization","expectation conditional maximization","Applied Statistics","Bioinformatics","Biostatistics","Data Science","Multivariate Analysis","Statistical Methodology","Statistical Models"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights.license","label":"Dc Rights License","values":["http://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/1901","https://digitalcommons.mtu.edu/etdr/1901"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Factor analysis is a powerful tool for modeling latent structures in high-dimensional data, traditional approaches assume a single global structure, limiting their ability to capture heterogeneity. The Mixture of Factor Analyzers (MFA) extends classical factor analysis by modeling data as a mixture of Gaussian-distributed local subspaces, effectively uncovering cluster-specific latent structures. However, MFA relies on Gaussian mixtures, making it sensitive to outliers and ill-suited for heavy-tailed data. The Mixture of $t$-Factor Analyzers (M$t$FA) addresses these limitations by incorporating multivariate $t$-distributions, improving robustness. Despite their advantages, both MFA and M$t$FA face significant computational challenges in high-dimensional settings, particularly due to costly covariance matrix operations and slow convergence of the Expectation-Maximization (EM) algorithm. In this collection of work, we propose a hybrid approach that integrates a matrix-free algorithm within the EM framework to improve computational efficiency for both MFA and M$t$FA. Our methods preserve the full covariance structure while leveraging matrix-free strategies to optimize computations in high dimensions. This approach maintains the interpretability and flexibility of mixture-based factor models while making them more scalable. Empirical evaluations on synthetic and real-world data reveals that our method significantly improves speed, robustness, while preserving clustering accuracy compared to conventional MFA and M$t$FA models driven by standard EM algorithms. These findings highlight the effectiveness of matrix-free strategies in advancing mixture-based latent variable models for high-dimensional data analysis."]},{"key":"dc:title","label":"Title","values":["HYBRID MIXTURES OF FACTOR ANALYZERS FOR HIGH DIMENSIONAL DATA"]}]}],"canonical_facts":{"dc:contributor":["Fan Dai"],"dc:contributor.committeemember":["Qiuying Sha","Kui Zhang","Nathir A. Rawashdeh"],"dc:creator":["Kareem, Kazeem Abiodun"],"dc:date.available":["2026-04-05T07:00:00Z"],"dc:date.created":["2025-01-01T08:00:00Z"],"dc:description.abstract":["Factor analysis is a powerful tool for modeling latent structures in high-dimensional data, traditional approaches assume a single global structure, limiting their ability to capture heterogeneity. The Mixture of Factor Analyzers (MFA) extends classical factor analysis by modeling data as a mixture of Gaussian-distributed local subspaces, effectively uncovering cluster-specific latent structures. However, MFA relies on Gaussian mixtures, making it sensitive to outliers and ill-suited for heavy-tailed data. The Mixture of $t$-Factor Analyzers (M$t$FA) addresses these limitations by incorporating multivariate $t$-distributions, improving robustness. Despite their advantages, both MFA and M$t$FA face significant computational challenges in high-dimensional settings, particularly due to costly covariance matrix operations and slow convergence of the Expectation-Maximization (EM) algorithm. In this collection of work, we propose a hybrid approach that integrates a matrix-free algorithm within the EM framework to improve computational efficiency for both MFA and M$t$FA. Our methods preserve the full covariance structure while leveraging matrix-free strategies to optimize computations in high dimensions. This approach maintains the interpretability and flexibility of mixture-based factor models while making them more scalable. Empirical evaluations on synthetic and real-world data reveals that our method significantly improves speed, robustness, while preserving clustering accuracy compared to conventional MFA and M$t$FA models driven by standard EM algorithms. These findings highlight the effectiveness of matrix-free strategies in advancing mixture-based latent variable models for high-dimensional data analysis."],"dc:identifier":["10.37099/mtu.dc.etdr/1901","https://digitalcommons.mtu.edu/etdr/1901"],"dc:rights.license":["http://creativecommons.org/licenses/by/4.0/"],"dc:subject":["factor analysis","clustering","dimensionality reduction","matrix-free computations","expectation-maximization","expectation conditional maximization","Applied Statistics","Bioinformatics","Biostatistics","Data Science","Multivariate Analysis","Statistical Methodology","Statistical Models"],"dc:title":["HYBRID MIXTURES OF FACTOR ANALYZERS FOR HIGH DIMENSIONAL DATA"],"thesis:degree_discipline":["Department of Mathematical Sciences"],"thesis:degree_level":["Open Access Dissertation"],"thesis:degree_name":["Doctor of Philosophy in Statistics (PhD)"]},"updated_at":"2026-11-19T08:19:20Z"}