Copertina

Efficient Quantum One-Class Support Vector Machines for Anomaly Detection Using Randomized Measurements and Variable Subsampling

Salvato in:
Pubblicato in:arXiv.org (Jul 30, 2024), p. n/a
Autore principale: Kölle, Michael
Altri autori: Ahouzi, Afrae, Debus, Pascal, Çetiner, Elif, Müller, Robert, Schuman, Daniëlle, Linnhoff-Popien, Claudia
Pubblicazione:
Cornell University Library, arXiv.org
Soggetti:
Testing time
Complexity
Anomalies
Support vector machines
Kernel functions
Variance
Time measurement
Accesso online:Citation/Abstract
Full text outside of ProQuest
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
Abstract:Quantum one-class support vector machines leverage the advantage of quantum kernel methods for semi-supervised anomaly detection. However, their quadratic time complexity with respect to data size poses challenges when dealing with large datasets. In recent work, quantum randomized measurements kernels and variable subsampling were proposed, as two independent methods to address this problem. The former achieves higher average precision, but suffers from variance, while the latter achieves linear complexity to data size and has lower variance. The current work focuses instead on combining these two methods, along with rotated feature bagging, to achieve linear time complexity both to data size and to number of features. Despite their instability, the resulting models exhibit considerably higher performance and faster training and testing times.
ISSN:2331-8422
Fonte:Engineering Database