Abstract
Modeling and characterizing information systems’ observation data (i.e., logs) is fundamental for proper system configuration, security analysis, and monitoring system status. Due to the underlying dynamics of such systems, observations can be viewed as high–dimensional, time–varying, multivariate data. One broad class for concisely modeling systems with such data points is low–rank modeling where the observations manifest themselves in a lower-dimensional subspace. Subspace Tracking plays an important role in many applications, such as signal processing, image tracking and recognition, and machine learning. However, it is not well understood which tracker is suitable for a given information system in a practical setting. In this paper, we present a comprehensive comparative analysis of three state-of-the-art low–rank modeling approaches; GROUSE, PETRELS, and RankMin. These algorithms will be compared in terms of their convergence and stability, parameter sensitivity, and robustness in dealing with missing data for synthetic and real information systems data sets, and then summarize our findings.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Balzano, L., Nowak, R.D., Recht, B.: Online identification and tracking of subspaces from highly incomplete information. In: 48th IEEE Annual Allerton Conference in Communication, Control, and Computing, pp. 704–711 (2010)
Chi, Y., Eldar, C., Calderbank, R.: PETRELS: parallel subspace estimation and tracking by recursive least squares from partial observations. IEEE Trans. Signal Process. 61(23), 5947–5959 (2013)
Mardani, M., Mateos, G., Giannakis, G.B.: Rank minimization for subspace tracking from incomplete data. In: ICASSP (2013)
Oja, E.: Simplified neuron model as a principal component analyzer. J. Math. Biol. 15(3), 267–273 (1982)
Wang, C., Eldar, Y.C., Lu, Y.M.: Subspace estimation from incomplete observations: a high-dimensional analysis. In: Proceedings of the Signal Processing with Adaptive Structured Representatives (SPARS) Workshop, Lisbon, Portugal, 5–8 June 2017 (2017)
Delmas, J.-P.: Subspace Tracking for Signal Processing. Adaptive Signal Processing: Next Generation Solutions, pp. 211–270. Wiley-IEEE Press (2010). ISBN 978-0-470-19517-8
EPANET. https://www.epa.gov/water-research/epanet. Accessed Nov 2018
Zhang, D., Balzano, L.: Convergence of a Grassmannian gradient descent algorithm for subspace estimation from undersampled data (2016). arXiv:1610.00199
Balzano, L., Chi, Y., Lu, Y.M.: Streaming PCA and subspace tracking: the missing data case. Proc. IEEE (2018). arXiv:1806.04609
Acknowledgments
Authors would like to thank Matthew Paulini for his copy editing and proof reading. The implementation of the algorithms and the experiments was developed by the second author while he was employed at AFRL/RI. First author would like to sincerely thank Jim Hanna, Rick Metzger, Dr. Mark Linderman, Steven Farr and Lt. Col. Scott Cunningham at AFRL/RI for their continuous support and guidance.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 This is a U.S. government work and not under copyright protection in the U.S.; foreign copyright protection may apply
About this paper
Cite this paper
Ahmed, N., Hasseler, G. (2019). On the Practicality of Subspace Tracking in Information Systems. In: Rocha, Á., Adeli, H., Reis, L., Costanzo, S. (eds) New Knowledge in Information Systems and Technologies. WorldCIST'19 2019. Advances in Intelligent Systems and Computing, vol 930. Springer, Cham. https://doi.org/10.1007/978-3-030-16181-1_74
Download citation
DOI: https://doi.org/10.1007/978-3-030-16181-1_74
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-16180-4
Online ISBN: 978-3-030-16181-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)