{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd-2760"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd-2760","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"A Kernel Based Approach to Determine Atypicality","abstract":"This dissertation outlines the development and use for a new probabilistic measure for categorization, referred to as atypicality. Given a set of known source objects, we can create a corresponding set of similarity scores between them. Assuming the set of scores has a normal distribution, we can estimate its parameters. Then, we can introduce new trace objects to the problem, and compute similarity scores for them. The main goal of the atypicality score is to determine if the new trace objects are similar to the source objects. To do this, we bootstrap many new scores using the estimated parameters (from the source scores), and compare the likelihood of these new scores to the scores belonging to the trace objects. We then make note of how often the trace objects have a higher likelihood value. The bootstrap result will be a number between zero and one, with smaller values indicating that the trace objects are not similar to the source objects. This is the atypicality value. We can use this as a p-value in a hypothesis test where the null hypothesis states that the trace objects are similar to the source objects. This can be used in a variety of applications, especially where we have multiple trace objects in multi-dimensional space. This dissertation will outline the development and use of the atypicality measure, show the results when the objects and scores are not normal, discuss the power of atypicality, and provide a comparison to support vector machines.","abstract_html":"This dissertation outlines the development and use for a new probabilistic measure for categorization, referred to as atypicality. Given a set of known source objects, we can create a corresponding set of similarity scores between them. Assuming the set of scores has a normal distribution, we can estimate its parameters. Then, we can introduce new trace objects to the problem, and compute similarity scores for them. The main goal of the atypicality score is to determine if the new trace objects are similar to the source objects. To do this, we bootstrap many new scores using the estimated parameters (from the source scores), and compare the likelihood of these new scores to the scores belonging to the trace objects. We then make note of how often the trace objects have a higher likelihood value. The bootstrap result will be a number between zero and one, with smaller values indicating that the trace objects are not similar to the source objects. This is the atypicality value. We can use this as a p-value in a hypothesis test where the null hypothesis states that the trace objects are similar to the source objects. This can be used in a variety of applications, especially where we have multiple trace objects in multi-dimensional space. This dissertation will outline the development and use of the atypicality measure, show the results when the objects and scores are not normal, discuss the power of atypicality, and provide a comparison to support vector machines.","abstract_has_math":false,"creators":["O'Brien, Austin"],"institution":null,"degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation - Open Access","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Christopher P. Saunders"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:58:07Z","subjects":["atypicality","kernel","similarity scores","Statistics and Probability"],"languages":["en"],"rights":[],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd/1711","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd/1711","record_label":"Repository record","record_kind":"record","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://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd-2760","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Christopher P. Saunders"]},{"key":"dc:creator","label":"Author","values":["O'Brien, Austin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2017-09-05T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2017-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation - Open Access"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["atypicality","kernel","similarity scores","Statistics and Probability"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd/1711"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This dissertation outlines the development and use for a new probabilistic measure for categorization, referred to as atypicality. Given a set of known source objects, we can create a corresponding set of similarity scores between them. Assuming the set of scores has a normal distribution, we can estimate its parameters. Then, we can introduce new trace objects to the problem, and compute similarity scores for them. The main goal of the atypicality score is to determine if the new trace objects are similar to the source objects. To do this, we bootstrap many new scores using the estimated parameters (from the source scores), and compare the likelihood of these new scores to the scores belonging to the trace objects. We then make note of how often the trace objects have a higher likelihood value. The bootstrap result will be a number between zero and one, with smaller values indicating that the trace objects are not similar to the source objects. This is the atypicality value. We can use this as a p-value in a hypothesis test where the null hypothesis states that the trace objects are similar to the source objects. This can be used in a variety of applications, especially where we have multiple trace objects in multi-dimensional space. This dissertation will outline the development and use of the atypicality measure, show the results when the objects and scores are not normal, discuss the power of atypicality, and provide a comparison to support vector machines."]},{"key":"dc:title","label":"Title","values":["A Kernel Based Approach to Determine Atypicality"]}]}],"canonical_facts":{"dc:contributor":["Christopher P. Saunders"],"dc:creator":["O'Brien, Austin"],"dc:date.available":["2017-09-05T07:00:00Z"],"dc:date.created":["2017-01-01T08:00:00Z"],"dc:description.abstract":["This dissertation outlines the development and use for a new probabilistic measure for categorization, referred to as atypicality. Given a set of known source objects, we can create a corresponding set of similarity scores between them. Assuming the set of scores has a normal distribution, we can estimate its parameters. Then, we can introduce new trace objects to the problem, and compute similarity scores for them. The main goal of the atypicality score is to determine if the new trace objects are similar to the source objects. To do this, we bootstrap many new scores using the estimated parameters (from the source scores), and compare the likelihood of these new scores to the scores belonging to the trace objects. We then make note of how often the trace objects have a higher likelihood value. The bootstrap result will be a number between zero and one, with smaller values indicating that the trace objects are not similar to the source objects. This is the atypicality value. We can use this as a p-value in a hypothesis test where the null hypothesis states that the trace objects are similar to the source objects. This can be used in a variety of applications, especially where we have multiple trace objects in multi-dimensional space. This dissertation will outline the development and use of the atypicality measure, show the results when the objects and scores are not normal, discuss the power of atypicality, and provide a comparison to support vector machines."],"dc:identifier":["https://openprairie.sdstate.edu/etd/1711"],"dc:language":["en"],"dc:rights":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["atypicality","kernel","similarity scores","Statistics and Probability"],"dc:title":["A Kernel Based Approach to Determine Atypicality"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Dissertation - Open Access"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-11-19T08:58:07Z"}