{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/32455"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/32455","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Depth and Local Depth in Clustering: Algorithms and Applications with Minimal Assumptions","abstract":"Clustering is a fundamental problem in data analysis, but classical methods are often constrained by assumptions about cluster shape and require user-specified parameters. This dissertation advances clustering methodology by integrating statistical depth and local depth concepts, yielding a unified and flexible framework for a wide range of clustering challenges. The first contribution introduces depth-based local center clustering (DLCC), which can address both convex and non-convex cluster shapes, accommodate balanced or unbalanced cluster sizes, and perform well with both well-separated and overlapping clusters. The second part develops a novel local depth measure, -integrated local depth ( -ILD), to robustly quantify local centrality. Its properties are analyzed in detail. The third contribution presents an automatic version of DLCC that leverages -ILD for local center selection and employs adaptive merging strategies, achieving strong performance on both synthetic and high-dimensional real datasets without the need for parameter tuning. Taken together, these contributions provide a practical and theoretically grounded approach for applying data depth in clustering tasks, opening new directions for clustering complex data with minimal prior assumptions and knowledge about data structure. iv","abstract_html":"Clustering is a fundamental problem in data analysis, but classical methods are often constrained by assumptions about cluster shape and require user-specified parameters. This dissertation advances clustering methodology by integrating statistical depth and local depth concepts, yielding a unified and flexible framework for a wide range of clustering challenges. The first contribution introduces depth-based local center clustering (DLCC), which can address both convex and non-convex cluster shapes, accommodate balanced or unbalanced cluster sizes, and perform well with both well-separated and overlapping clusters. The second part develops a novel local depth measure, -integrated local depth ( -ILD), to robustly quantify local centrality. Its properties are analyzed in detail. The third contribution presents an automatic version of DLCC that leverages -ILD for local center selection and employs adaptive merging strategies, achieving strong performance on both synthetic and high-dimensional real datasets without the need for parameter tuning. Taken together, these contributions provide a practical and theoretically grounded approach for applying data depth in clustering tasks, opening new directions for clustering complex data with minimal prior assumptions and knowledge about data structure. iv","abstract_has_math":false,"creators":["Wang, Siyi"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics and Statistics","school":null,"contributors":[],"advisors":["McNicholas, Paul","Leblanc, Alexandre"],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025","date_published":"2025","updated_at":"2026-11-18T19:32:55Z","subjects":["Clustering","Data Depth","Local Depth","Unsupervised learning"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/12809"],"render_values":[{"text":"https://doi.org/10.71548/12809","href":"https://doi.org/10.71548/12809","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/32455","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/32455","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F32455","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["McNicholas, Paul","Leblanc, Alexandre"]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics and Statistics"]},{"key":"dc:creator","label":"Author","values":["Wang, Siyi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-10-01T14:21:48Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2025-10-01T14:21:48Z"]},{"key":"dc:date.issued","label":"Date","values":["2025"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation","Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Clustering","Data Depth","Local Depth","Unsupervised learning"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/32455","https://doi.org/10.71548/12809"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Clustering is a fundamental problem in data analysis, but classical methods are often constrained by assumptions about cluster shape and require user-specified parameters. This dissertation advances clustering methodology by integrating statistical depth and local depth concepts, yielding a unified and flexible framework for a wide range of clustering challenges. The first contribution introduces depth-based local center clustering (DLCC), which can address both convex and non-convex cluster shapes, accommodate balanced or unbalanced cluster sizes, and perform well with both well-separated and overlapping clusters. The second part develops a novel local depth measure, -integrated local depth ( -ILD), to robustly quantify local centrality. Its properties are analyzed in detail. The third contribution presents an automatic version of DLCC that leverages -ILD for local center selection and employs adaptive merging strategies, achieving strong performance on both synthetic and high-dimensional real datasets without the need for parameter tuning. Taken together, these contributions provide a practical and theoretically grounded approach for applying data depth in clustering tasks, opening new directions for clustering complex data with minimal prior assumptions and knowledge about data structure. iv"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["Depth and Local Depth in Clustering: Algorithms and Applications with Minimal Assumptions"]},{"key":"others:access_status","label":"Others Access Status","values":["embargo"]}]}],"canonical_facts":{"dc:contributor.advisor":["McNicholas, Paul","Leblanc, Alexandre"],"dc:contributor.department":["Mathematics and Statistics"],"dc:creator":["Wang, Siyi"],"dc:date.accessioned":["2025-10-01T14:21:48Z"],"dc:date.available":["2025-10-01T14:21:48Z"],"dc:date.issued":["2025"],"dc:description.abstract":["Clustering is a fundamental problem in data analysis, but classical methods are often constrained by assumptions about cluster shape and require user-specified parameters. This dissertation advances clustering methodology by integrating statistical depth and local depth concepts, yielding a unified and flexible framework for a wide range of clustering challenges. The first contribution introduces depth-based local center clustering (DLCC), which can address both convex and non-convex cluster shapes, accommodate balanced or unbalanced cluster sizes, and perform well with both well-separated and overlapping clusters. The second part develops a novel local depth measure, -integrated local depth ( -ILD), to robustly quantify local centrality. Its properties are analyzed in detail. The third contribution presents an automatic version of DLCC that leverages -ILD for local center selection and employs adaptive merging strategies, achieving strong performance on both synthetic and high-dimensional real datasets without the need for parameter tuning. Taken together, these contributions provide a practical and theoretically grounded approach for applying data depth in clustering tasks, opening new directions for clustering complex data with minimal prior assumptions and knowledge about data structure. iv"],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.uri":["http://hdl.handle.net/11375/32455","https://doi.org/10.71548/12809"],"dc:language.iso":["en"],"dc:subject":["Clustering","Data Depth","Local Depth","Unsupervised learning"],"dc:title":["Depth and Local Depth in Clustering: Algorithms and Applications with Minimal Assumptions"],"dc:type":["Dissertation","Thesis"],"others:access_status":["embargo"]},"updated_at":"2026-11-18T19:32:55Z"}