{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_53110"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_53110","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"SIMILARITY GRAPH-BASED SEMI-SUPERVISED TECHNIQUES FOR MACHINE LEARNING TASKS AND DATA WITH LIMITED LABELED SAMPLES","abstract":"Thesis (Ph.D.)--Michigan State University. Applied Mathematics - Doctor of Philosophy, 2026","abstract_html":"Thesis (Ph.D.)--Michigan State University. Applied Mathematics - Doctor of Philosophy, 2026","abstract_has_math":false,"creators":["Bhusal, Gokul"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Rapinchuk, Ekaterina ER","Wei, GuoWei GW","Iwen, Mark MI","Huang, Longxiu LH"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-18T18:59:37Z","subjects":["Applied mathematics","Mathematics"],"languages":["eng"],"rights":["Attribution 4.0 International"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:53110","local:Bhusal_grad.msu_0128D_22121"],"render_values":[{"text":"etd:53110","href":null,"code":true},{"text":"local:Bhusal_grad.msu_0128D_22121","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/cef7-6b52","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/cef7-6b52","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://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_53110","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Rapinchuk, Ekaterina ER","Wei, GuoWei GW","Iwen, Mark MI","Huang, Longxiu LH"]},{"key":"dc:creator","label":"Author","values":["Bhusal, Gokul"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["text","Electronic dissertations"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Applied mathematics","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution 4.0 International"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:53110","local:Bhusal_grad.msu_0128D_22121","https://doi.org/doi:10.25335/cef7-6b52"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph.D.)--Michigan State University. Applied Mathematics - Doctor of Philosophy, 2026","We present several graph-based algorithms and optimization methods for image processing and classification of high-dimensional data. The first contribution proposes an algebraic topology-based semi-supervised method called persistent Laplacian-enhanced graph MBO by integrating persistent spectral graph theory with the classical Merriman–Bence–Osher (MBO) scheme. Specifically, we use a filtration procedure to generate a sequence of chain complexes and associated families of simplicial complexes, from which we construct a family of persistent Laplacians. The second contribution introduces the Multiclass Active Learning with Auction Dynamics on Graphs (MALADY) algorithm, which leverages an auction dynamics technique on similarity graphs for efficient active learning. In particular, the proposed algorithm incorporates an active learning loop using as its underlying semi-supervised procedure an efficient and effective similarity graph-based auction method consisting of upper and lower bound auctions that integrate class size constraints. In addition, we introduce a novel active learning acquisition function that incorporates the dual variable of the auction algorithm to measure the uncertainty in the classifier to prioritize queries near the decision boundaries between different classes. The third contribution addresses the spectral variability problem in hyperspectral unmixing, where we developed a general framework for hyperspectral unmixing using endmember bundles. In particular, we develop a bundle-based framework that can enforce either inter-group sparsity or sparsity within and across groups (SWAG) on the abundance coefficients. Furthermore, our framework offers the flexibility to incorporate a variety of sparsity-promoting penalties, among which the transformed $\\ell_1$ (TL1) penalty is a novel regularization in the HU literature.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf","1 online resource (124 p.) : ill."]},{"key":"dc:title","label":"Title","values":["SIMILARITY GRAPH-BASED SEMI-SUPERVISED TECHNIQUES FOR MACHINE LEARNING TASKS AND DATA WITH LIMITED LABELED SAMPLES"]}]}],"canonical_facts":{"dc:contributor":["Rapinchuk, Ekaterina ER","Wei, GuoWei GW","Iwen, Mark MI","Huang, Longxiu LH"],"dc:creator":["Bhusal, Gokul"],"dc:date":["2026"],"dc:description":["Thesis (Ph.D.)--Michigan State University. Applied Mathematics - Doctor of Philosophy, 2026","We present several graph-based algorithms and optimization methods for image processing and classification of high-dimensional data. The first contribution proposes an algebraic topology-based semi-supervised method called persistent Laplacian-enhanced graph MBO by integrating persistent spectral graph theory with the classical Merriman–Bence–Osher (MBO) scheme. Specifically, we use a filtration procedure to generate a sequence of chain complexes and associated families of simplicial complexes, from which we construct a family of persistent Laplacians. The second contribution introduces the Multiclass Active Learning with Auction Dynamics on Graphs (MALADY) algorithm, which leverages an auction dynamics technique on similarity graphs for efficient active learning. In particular, the proposed algorithm incorporates an active learning loop using as its underlying semi-supervised procedure an efficient and effective similarity graph-based auction method consisting of upper and lower bound auctions that integrate class size constraints. In addition, we introduce a novel active learning acquisition function that incorporates the dual variable of the auction algorithm to measure the uncertainty in the classifier to prioritize queries near the decision boundaries between different classes. The third contribution addresses the spectral variability problem in hyperspectral unmixing, where we developed a general framework for hyperspectral unmixing using endmember bundles. In particular, we develop a bundle-based framework that can enforce either inter-group sparsity or sparsity within and across groups (SWAG) on the abundance coefficients. Furthermore, our framework offers the flexibility to incorporate a variety of sparsity-promoting penalties, among which the transformed $\\ell_1$ (TL1) penalty is a novel regularization in the HU literature.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."],"dc:format":["application/pdf","1 online resource (124 p.) : ill."],"dc:identifier":["etd:53110","local:Bhusal_grad.msu_0128D_22121","https://doi.org/doi:10.25335/cef7-6b52"],"dc:language":["eng"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["Attribution 4.0 International"],"dc:subject":["Applied mathematics","Mathematics"],"dc:title":["SIMILARITY GRAPH-BASED SEMI-SUPERVISED TECHNIQUES FOR MACHINE LEARNING TASKS AND DATA WITH LIMITED LABELED SAMPLES"],"dc:type":["text","Electronic dissertations"]},"updated_at":"2026-11-18T18:59:37Z"}