Name
Title | ||
|---|---|---|
Batch quadratic programming network with maximum entropy constraint for anomaly detection |
Abstract | ||
|---|---|---|
The difficulty of anomaly detection lies in balancing the impact of noise on the network (noise suppression) and distinguishing the real anomaly from the noise (abnormal exposure). So, a deep anomaly detector Batch Quadratic Programming (BQP) network with Maximum Entropy Constraint is proposed. It imposes quadratic programming constraints on Support Vector Data Description through the BQP output layer to achieve noise suppression. In BQP network processes' batch data, Maximum Entropy Constraint is used to balance abnormal samples and noise. The experiment compared the shallow method with the currently popular deep method on MNIST and CIFAR-10 data sets and proved that the BQP network with Maximum Entropy Constraint has excellent performance. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1049/cvi2.12082 | IET COMPUTER VISION |
Keywords | DocType | Volume |
information theory, pattern clustering, quadratic programming | Journal | 16 |
Issue | ISSN | Citations |
3 | 1751-9632 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Di Zhou | 1 | 2 | 1.38 |
| Weigang Chen | 2 | 0 | 0.34 |
| Chunsheng Guo | 3 | 7 | 4.59 |
| Zhongfei (Mark) Zhang | 4 | 2451 | 164.30 |