Distributed Online One-Class Support Vector Machine for Anomaly Detection Over Networks
The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
Anomaly detection has attracted much attention in recent years since it plays a crucial role in many domains. Various anomaly detection approaches have been proposed, among which one-class support vector machine (OCSVM) is a popular one. In practice, data used for anomaly detection can be distributively collected via wireless sensor networks. Besides, as the data usually arrive at the nodes sequentially, online detection method that can process streaming data is preferred. In this paper, we formulate a distributed online OCSVM for anomaly detection over networks and get a decentralized cost function. To get the decentralized implementation without transmitting the original data, we use a random approximate function to replace the kernel function. Furthermore, to find an appropriate approximate dimension, we add a sparse constraint into the decentralized cost function to get another one. Then we minimize these two cost functions by stochastic gradient descent and derive two distributed algorithms. Some theoretical analysis and experiments are performed to show the effectiveness of the proposed algorithms. Experimental results on both synthetic and real datasets reveal that both of the proposed algorithms achieve low misdetection rates and high true positive rates. Compared with other state-of-the-art anomaly detection methods, the proposed distributed algorithms not only show good anomaly detection performance, but also require relatively short running time and low CPU memory consumption.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 1×
“Owing to these advantages, many distributed algorithms over WSNs have been proposed, such as diffusion-based [10], [11], consensus-based [12], [13], and gossip-based [14], [15] algorithms.”
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687 · cited 1×
“In literature, many anomaly detection algorithms have been proposed [2], [24], [25], among which kernel-based and network-based algorithms are related to this paper.”
BackgroundGene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954 · cited 1×
“Support vector machine (SVM) [32] is a classical machine learning method and widely used for classification [33], [34].”
MethodEstimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 2×
“So, we can separate the abnormal data from the normal data by finding a hyperplane w T Based on the above reasoning, Schölkopf et al. [5] have formulated the OCSVM as the following optimization problem: where C is the penalty parameter, and ξ n are slack variables that are penalized in the objective…”
MethodLarge-Scale Machine Learning with Stochastic Gradient Descent
Bottou, L. (2010) · Proceedings of COMPSTAT'2010 · doi:10.1007/978-3-7908-2604-3_16 · Cited by 5,795
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149 · cited 1×
“They are Gaussian model method (GM), k -NN method [21], local out-lier factor algorithm (LOF) [22], kernel principal component analysis method (KPCA) [26], and hyperspherical cluster-based scheme (HSCBS) [30].”
MethodA Survey of Outlier Detection Methodologies
Hodge, V., & Austin, J. (2004) · Artificial Intelligence Review · doi:10.1007/s10462-004-4304-y · Cited by 3,596
Directed diffusion for wireless sensor networking
Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., & Silva, F. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808417 · Cited by 2,359 · cited 1×
“Besides, to achieve the consensus of w j and b j at different nodes, the local results are combined using the diffusion cooperation [41].”
MethodEfficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335437 · Cited by 1,171 · cited 1×
“They are Gaussian model method (GM), k-NN method [21], local outlier factor algorithm (LOF) [22], kernel principal component analysis method (KPCA) [26], and hyperspherical clusterbased scheme (HSCBS) [30].”
MethodA comprehensive survey of numeric and symbolic outlier mining techniques
Agyemang, M., Barker, K., & Alhajj, R. (2006) · Intelligent Data Analysis · doi:10.3233/ida-2006-10604 · Cited by 164 · cited 1×
“In literature, many anomaly detection algorithms have been proposed [2], [24], [25], among which kernel-based and network-based algorithms are related to this paper.”
Background
Cited by
Interpretable Anomaly Detection with DIFFI: Depth-based feature importance of Isolation Forest
Carletti, M., Terzi, M., & Susto, G. A. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105730 · Cited by 118
Stacked one-class broad learning system for intrusion detection in industry 4.0
Yang, K., Shi, Y., Yu, Z., Yang, Q., Sangaiah, A. K., & Zeng, H. (2023) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2022.3157727 · Cited by 75
“Miao et al. [13] proposed an online distributed OC-SVM for network anomaly detection.”
BackgroundPower System Anomaly Detection Based on Ocsvm Optimized by Improved Particle Swarm Optimization
Wang, Z., Fu, Y., Song, C., Zeng, P., & Qiao, L. (2019) · IEEE Access · doi:10.1109/access.2019.2959699 · Cited by 47
Metadata
- Authors
- Miao, X., Liu, Y., Zhao, H., & Li, C.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2019-04
- Volume
- 49
- Issue
- 4
- Pages
- 1475-1488
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2793988933
- Cited by
- 185
- References
- 12
- FWCI
- 10.18
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.