Direct robust matrix factorization for anomaly detection

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 844-853

  Xiong, Liang ^a   Chen, Xi ^a   Schneider, Jeff ^b  

^a Carnegie Mellon University ^*  (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Anomaly detection; Matrix factorization; Robust

Indexed keywords

ANOMALY DETECTION; CARDINALITIES; CONVEX RELAXATION; DATA MINING TASKS; DATA SETS; DIRECT SOLUTION; EMPIRICAL RESULTS; MATRIX; MATRIX APPROXIMATION; MATRIX FACTORIZATIONS; ROBUST; ROBUST MODELING; STATE-OF-THE-ART METHODS; STRUCTURAL KNOWLEDGE;

ALGORITHMS; DATA MINING; RELAXATION PROCESSES;

STATISTICS;

EID: 84863134807     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.52     Document Type: Conference Paper

References (32)

1. P. Bloomfield and W. L. Steiger, Least Absolute Deviations: Theory, Applications, and Algorithms (Progress in Probability). Birkh́'auser Boston, Mass, USA, 1983.
2. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander, "Lof: Identifying density-based local outliers," in ACM SIGMOD Record, 2000.
3. E. Candes, X. Li, Y. Ma, and J. Wright, "Robust principal component analysis?" preprint, 2009.
4. E. J. Candès and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," IEEE Trans. Information Theory, vol. 56(5), pp. 2053-2080, 2009.
5. V. Chandola, A. Banerjee, and V. Kumar, "Anomaly detection: A survey," ACM Computing Surveys, vol. 41(3), pp. 1-72, 2009.
6. C. Ding, T. Li, and M. I. Jordan, "Convex and seminonnegative matrix factorizations," IEEE T-PAMI, vol. 32(1), pp. 45-55, 2010.
7. D. L. Donoho, "Breakdown properties of multivariate location estimators," Ph.D. dissertation, Harvard University, 1982.
8. C. Eckart and G. Young, "The approximation of one matrix by another of lower rank," Psychometrika, vol. 1, pp. 211- 218, 1936.
9. A. Ganesh, Z. Lin, J. Wright, L. Wu, M. Chen, and Y. Ma, "Fast algorithms for recovering a corrupted low-rank matrix," in International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2009.
10. D. M. Hawkins, L. Liu, and S. S. Young, "Robust singular value decomposition," National Institute of Statistical Sciences, Tech. Rep., 2001.
11. Huber and P. J., "Robust estimation of a location parameter," Annals of Statistics, vol. 53, pp. 73-101, 1964.
12. Q. Ke and T. Kanade, "Robust l1 norm factorization in the presence of outliers and missing data by alternative convex programming," in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2005.
13. H.-P. Kriegel, P. Kroger, E. Schubert, and A. Zimek, "A general framework for increasing the robustness of pca-based correlation clustering algorithms," in Scientific and Statistical Database Management Conference (SSDBM), 2008.
14. F. D. la Torre and M. J. Black, "A framework for robust subspace learning," International Journal of Computer Vision, vol. 54, pp. 117-142, 2003.
15. R. M. Larsen, "Propack - software for large and sparse svd calculations." [Online]. Available: http://soi.stanford.edu/~rmunk/PROPACK
16. D. D. Lee and H. S. Seung, "Learning the parts of objects by non-negative matrix factorization," Nature, vol. 401, pp. 788-791, 1999.
17. G. Li and Z. Chen, "Projection-pursuit approach to robust dispersion matrices and principal components: Primary theory and monte carlo," J. of American Statistical Association, vol. 80, no. 391, pp. 759 - 766, 1985.
18. L. Li, W. Huang, I. Y.-H. Gu, and Q. Tian, "Statistical modeling of complex backgrounds," IEEE Trans. Image Processing, vol. 13, no. 11, pp. 1459-1472, 2004.
19. J. Liu, S. Ji, and J. Ye, "Multi-task feature learning via efficient l2,1-norm minimization," in The Twenty-fifth Conference on Uncertainty in Artificial Intelligence (UAI), 2009.
20. Z. Lu and Y. Zhang, "Penalty decomposition methods for l0-norm minimization," Department of Mathematics, Simon Fraser University, Tech. Rep., 2010.
21. S. Ma, D. Goldfarb, and L. Chen, "Fixed point and bregman iterative methods for matrix rank minimization," Math. Program., Ser. A, to appear.
22. R. Mazumder, T. Hastie, and R. Tibshirani, "Spectral regularization algorithms for learning large incomplete matrices," Journal of Machine Learning Research, 2009.
23. M. H. Nguyen and F. D. la Torre, "Robust kernel principal components analysis," in NIPS, 2009.
24. N. H. Nguyen, T. T. Do, and T. D. Tran, "A fast and efficient algorithm for low-rank approximation of a matrix," in STOC, 2009.
25. J. D. M. Rennie and N. Srebro, "Fast maximum margin matrix factorization for collaborative prediction," in ICML, 2005.
26. R. Salakhutdinov and A. Minh, "Probabilistic matrix factorization," in NIPS, 2007.
27. H. Xu, C. Caramanis, and S. Mannor, "Principal component analysis with contaminated data: The high dimensional case," in Annual Conference on Learning Theory (CoLT), 2010.
28. H. Xu, C. Caramanis, and S. Sanghavi, "Robust pca via outlier pursuit," in NIPS, 2010.
29. M. Yuan and Y. Lin, "Model selection and estimation in regression with grouped variables," Journal of the Royal Statistical Society, Series B, vol. 68, pp. 49-67, 2006.
30. M. Zhao and V. Saligrama, "Anomaly detection with score functions based on nearest neighbor graphs," in NIPS, 2009.
31. T. Zhou and D. Tao, "Godec: Randomized low-rank & sparse matrix decomposition in noisy case," in International Conference on Machine Learning, 2011.
32. Z. Zhou, X. Li, J. Wright, E. Candès, and Y. Ma, "Stable principal component pursuit," in International Symposium on Information Theory, 2010.