Direct Robust Matrix Factorizatoin for Anomaly Detection
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Matrix factorization methods are extremely useful in many data mining tasks, yet their performances are often degraded by outliers. In this paper, we propose a novel robust matrix factorization algorithm that is insensitive to outliers. We directly formulate robust factorization as a matrix approximation problem with constraints on the rank of the matrix and the cardinality of the outlier set. Then, unlike existing methods that resort to convex relaxations, we solve this problem directly and efficiently. In addition, structural knowledge about the outliers can be incorporated to find outliers more effectively. We applied this method in anomaly detection tasks on various data sets. Empirical results show that this new algorithm is effective in robust modeling and anomaly detection, and our direct solution achieves superior performance over the state-of-the-art methods based on the L1-norm and the nuclear norm of matrices.
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
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687 · cited 1×
“For a survey of the outlier detection field readers can refer to [5].”
BackgroundModel Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Robust estimation of a location parameter
Huber, P. J. (1964) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177703732 · Cited by 7,228
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
Li, G., & Chen, Z. (1985) · Journal of the American Statistical Association · doi:10.1080/01621459.1985.10478181 · Cited by 314
Cited by
Machine Learning for Anomaly Detection: A Systematic Review
Nassif, A. B., Talib, M. A., Nasir, Q., & Dakalbab, F. M. (2021) · IEEE Access · doi:10.1109/access.2021.3083060 · Cited by 748
Traditional and recent approaches in background modeling for foreground detection: An overview
Bouwmans, T. (2014) · Computer Science Review · doi:10.1016/j.cosrev.2014.04.001 · Cited by 676
Robust Deep Learning Methods for Anomaly Detection
Chalapathy, R., Khoa, N. L. D., & Chawla, S. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3406704 · Cited by 502
Zhang, Y., Du, B., Zhang, L., & Wang, S. (2016) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2015.2479299 · Cited by 485
Generative Adversarial Active Learning for Unsupervised Outlier Detection
Liu, Y., Li, Z., Zhou, C., Jiang, Y., Sun, J., Wang, M., & He, X. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2905606 · Cited by 335
Bouwmans, T., Sobral, A., Javed, S., Jung, S. K., & Zahzah, E.-H. (2017) · Computer Science Review · doi:10.1016/j.cosrev.2016.11.001 · Cited by 267
Root cause detection in a service-oriented architecture
Kim, M., Sumbaly, R., & Shah, S. (2013) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2494232.2465753 · Cited by 138
Outlying property detection with numerical attributes
Angiulli, F., Fassetti, F., Manco, G., & Palopoli, L. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0458-x · Cited by 33
“, [10,35,41]), where data points are embedded into a lower dimensional subspace in terms of linear relationships and outliers are modeled as data points exhibiting large residuals; proximity-based models (e.”
Background
Metadata
- Authors
- Xiong, L., Chen, X., & Schneider, J.
- Venue
- 2011 IEEE 11th International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2011-12
- Pages
- 844-853
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2034518400
- Cited by
- 107
- References
- 5
- FWCI
- 4.27
- Type
- conference paper
- 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.