Back to search

Georgia Institute of Technology

Algorithms for Data Fusion, Representation Learning, and Scalable Clustering based on Constrained Low-Rank Approximation

Abstract

dc:description.abstract

In this dissertation, we address significant challenges in modern data analysis through novel Constrained Low-Rank Approximation (CLRA) algorithms. Contemporary datasets often exhibit complex characteristics: multi-type heterogeneity with interconnected entities, information from diverse sources, inherent sparsity, and massive scale. Traditional methods struggle with these complexities, motivating our development of advanced CLRA techniques that strategically incorporate constraints into matrix factorization. We introduce three primary contributions. First, we develop a Collective Symmetric Nonnegative Matrix Factorization framework for co-embedding multi-type data, constructing an integrated similarity matrix capturing both intra-type and inter-type relationships. We extend this to Multi-Granularity NMF, discovering hierarchical structures across levels via alignment matrices. Second, we propose WellFactor, an integrative framework for robust patient profiling from heterogeneous healthcare data, handling missing diagnoses via matrix masking under an open-world assumption and incorporating semi-supervision. Third, we develop the k-vertices clustering framework, a generalization of k-means to perform soft clustering. We further enhance it with minimum-volume regularization to mitigate vertex ambiguity and proposing a computationally efficient hierarchical algorithm. Through extensive experiments on diverse datasets spanning academic literature, healthcare records, and benchmark collections, we demonstrate that our methods outperform relevant baselines in co-embedding quality, clustering accuracy, prediction performance, and computational efficiency. Our contributions advance CLRA methods for robust data fusion and representation learning, providing practical tools for extracting meaningful insights from complex, multi-type data across various applications including interactive exploration, patient subtyping, and general clustering tasks.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Computational Science and Engineering
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Choi, Dongjin
Advisor dc:contributor.advisor
  • Park, Haesun
Committee members dc:contributor.committeemember
  • Haidarian, Hamid
  • Zhang, Chao
  • Chau, Duen Horng
  • Kang, Sung Ha

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1853/78639

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Choi, Dongjin. Algorithms for Data Fusion, Representation Learning, and Scalable Clustering based on Constrained Low-Rank Approximation. Doctoral thesis, Georgia Institute of Technology, 2025. https://hdl.handle.net/1853/78639