Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
PavyDissertationUpdated.pdf (2.61 MB)
ETD Abstract Container
Abstract Header
SV-Means: A Fast One-Class Support Vector Machine-Based Level Set Estimator
Author Info
Pavy, Anne M.
ORCID® Identifier
http://orcid.org/0000-0002-1925-7231
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=wright1516047120200949
Abstract Details
Year and Degree
2017, Doctor of Philosophy (PhD), Wright State University, Electrical Engineering.
Abstract
In this dissertation, a novel algorithm, SV-Means, is developed motivated by the many functions needed to perform radar waveform classification in an evolving, contested environment. Important functions include the ability to: reject classes not in the library, provide confidence in the classification decision, adapt the decision boundary on-the-fly, discover new classes, and quickly add new classes to the library. The SV-Means approach addresses these functions by providing a fast algorithm that can be used for anomaly detection, density estimation, open set classification, and clustering, within a Bayesian generative framework. The SV-Means algorithm extends the quantile one-class support vector machine (q-OCSVM) density estimation algorithm into a classification formulation with inspiration from k-means and stochastic gradient descent principles. In addition, the algorithm can be trained at least an order of magnitude faster than the q-OCSVM and other OCSVM algorithms. SV-Means has been thoroughly tested with a phase-modulated radar waveform data set, and several data sets from the University of California Irvine (UCI) machine learning repository, in each application area except clustering. In clustering, a novel algorithm, SV-Means Level Set Clustering, was formulated using the SV-Means algorithm as a first step to determine the number of clusters per level set and distinguish overlapping clusters. Finally, an end-to-end demonstration from training, to testing, to clustering, to adding a new class to the library, was demonstrated using the SV-Means algorithm.
Committee
Brian Rigling, Ph.D. (Advisor)
Fred Garber, Ph.D. (Committee Member)
Kefu Xue, Ph.D. (Committee Member)
Michael Bryant, Ph.D. (Committee Member)
Randolph Moses, Ph.D. (Committee Member)
Pages
103 p.
Subject Headings
Electrical Engineering
Keywords
open set classification
;
one-class support vector machine
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Pavy, A. M. (2017).
SV-Means: A Fast One-Class Support Vector Machine-Based Level Set Estimator
[Doctoral dissertation, Wright State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=wright1516047120200949
APA Style (7th edition)
Pavy, Anne.
SV-Means: A Fast One-Class Support Vector Machine-Based Level Set Estimator.
2017. Wright State University, Doctoral dissertation.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=wright1516047120200949.
MLA Style (8th edition)
Pavy, Anne. "SV-Means: A Fast One-Class Support Vector Machine-Based Level Set Estimator." Doctoral dissertation, Wright State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1516047120200949
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
wright1516047120200949
Download Count:
832
Copyright Info
© 2017, all rights reserved.
This open access ETD is published by Wright State University and OhioLINK.