Incremental tensor analysis: Theory and applications
The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Abstract
How do we find patterns in author-keyword associations, evolving over time? Or in data cubes (tensors), with product-branchcustomer sales information? And more generally, how to summarize high-order data cubes (tensors)? How to incrementally update these patterns over time? Matrix decompositions, like principal component analysis (PCA) and variants, are invaluable tools for mining, dimensionality reduction, feature selection, rule identification in numerous settings like streaming data, text, graphs, social networks, and many more settings. However, they have only two orders (i.e., matrices, like author and keyword in the previous example). We propose to envision such higher-order data as tensors, and tap the vast literature on the topic. However, these methods do not necessarily scale up, let alone operate on semi-infinite streams. Thus, we introduce a general framework, incremental tensor analysis (ITA), which efficiently computes a compact summary for high-order and high-dimensional data, and also reveals the hidden correlations. Three variants of ITA are presented: (1) dynamic tensor analysis (DTA); (2) streaming tensor analysis (STA); and (3) window-based tensor analysis (WTA). In paricular, we explore several fundamental design trade-offs such as space efficiency, computational cost, approximation accuracy, time dependency, and model complexity. We implement all our methods and apply them in several real settings, such as network anomaly detection, multiway latent semantic indexing on citation networks, and correlation study on sensor measurements. Our empirical studies show that the proposed methods are fast and accurate and that they find interesting patterns and outliers on the real datasets.
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Rogers, S. (1996) · Control Engineering Practice · doi:10.1016/0967-0661(96)82838-3 · Cited by 9,278
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
Mining high-speed data streams
Domingos, P., & Hulten, G. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347107 · Cited by 2,185
Adaptive filter theory (2nd ed.)
Haykin, S. (1991) · Prentice-Hall, Inc eBooks · Cited by 1,892
A Framework for Clustering Evolving Data Streams
Aggarwal, C. C., Yu, P. S., Han, J., & Wang, J. (2003) · Proceedings 2003 VLDB Conference · doi:10.1016/b978-012722442-8/50016-1 · Cited by 1,808
Self-citationOn the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898346995 · Cited by 1,567
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
Self-citationMulti‐Way Analysis with Applications in the Chemical Sciences
Smilde, A., Bro, R., & Geladi, P. (2004) · Wiley eBooks · doi:10.1002/0470012110 · Cited by 1,176
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition
Tao, D., Li, X., Wu, X., & Maybank, S. J. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1096 · Cited by 1,140
Self-citationThe ubiquitous Kronecker product
Loan, C. F. V. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00393-9 · Cited by 981
Clustering data streams: theory and practice
Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198387 · Cited by 882
Latent semantic indexing: a probabilistic analysis
Papadimitriou, C. H., Tamaki, H., Raghavan, P., & Vempala, S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275505 · Cited by 863
Multilinear Analysis of Image Ensembles: TensorFaces
Vasilescu, M. A. O., & Terzopoulos, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_30 · Cited by 836
Principal Component Analysis of Three-Mode Data by Means of Alternating Least Squares Algorithms
Kroonenberg, P. M., & de Leeuw, J. (1980) · Psychometrika · doi:10.1007/bf02293599 · Cited by 724
Zhu, Y., & Shasha, D. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50039-1 · Cited by 656
Personalized information delivery: an analysis of information filtering methods
Foltz, P. W., & Dumais, S. T. (1992) · Communications of the ACM · doi:10.1145/138859.138866 · Cited by 500
Beyond streams and graphs: dynamic tensor analysis
Sun, J., Tao, D., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150445 · Cited by 462
Self-citationGeneralized Low Rank Approximations of Matrices
Ye, J. (2005) · Machine Learning · doi:10.1007/s10994-005-3561-6 · Cited by 428
Three-mode principal component analysis : theory and applications
Kroonenberg, P. M. (1983) · Leiden Repository (Leiden University) · Cited by 410
On clusterings-good, bad and spectral
Kannan, R., Vempala, S., & Veta, A. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892125 · Cited by 372
Multilinear operators for higher-order decompositions.
Kolda, T. (2006) · doi:10.2172/923081 · Cited by 365
He, X., Cai, D., & Niyogi, P. (2005) · Cited by 360
Streaming Pattern Discovery in Multiple Time-Series
Papadimitriou, S., Sun, J., & Faloutsos, C. (2018) · doi:10.1184/r1/6609941 · Cited by 348
Self-citationHigher-Order Web Link Analysis Using Multilinear Algebra
Kolda, T. G., Bader, B. W., & Kenny, J. P. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.77 · Cited by 252
Three-Mode Principal Component Analysis.
Everitt, B. S., & Kroonenberg, P. M. (1986) · Biometrics · doi:10.2307/2531268 · Cited by 227
TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data
Zhao, L., & Zaki, M. J. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066236 · Cited by 209
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches
Indyk, P., Koudas, N., & Muthukrishnan, S. (2000) · Very Large Data Bases · Cited by 208
Linear image coding for regression and classification using the tensor-rank principle
Shashua, A., & Levin, A. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990454 · Cited by 193
Online data mining for co-evolving time sequences
Yi, B.-K., Sidiropoulos, N. D., Johnson, T., Jagadish, H. V., Faloutsos, C., & Biliris, A. (2002) · Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073) · doi:10.1109/icde.2000.839383 · Cited by 169
Self-citationBRAID: stream mining through group lag correlations
Sakurai, Y., Papadimitriou, S., & Faloutsos, C. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066226 · Cited by 166
Self-citationMining data streams under block evolution
Ganti, V., Gehrke, J. E., & Ramakrishnan, R. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/507515.507517 · Cited by 133
Adaptive, Hands-Off Stream Mining
Papadimitriou, S., Brockwell, A., & Faloutsos, C. (2003) · Elsevier eBooks · doi:10.1016/b978-012722442-8/50056-2 · Cited by 128
Self-citationXu, D., Yan, S., Zhang, L., Zhang, H.-J., Liu, Z., & Shum, H. (2005) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2005.107 · Cited by 90
Window-based Tensor Analysis on High-dimensional and Multi-aspect Streams
Sun, J., Papadimitriou, S., & Yu, P. S. (2006) · Proceedings · doi:10.1109/icdm.2006.169 · Cited by 88
Self-citation2-Dimensional Singular Value Decomposition for 2D Maps and Images
Ding, C. H. Q., & Ye, J. (2005) · doi:10.1137/1.9781611972757.4 · Cited by 75
(2008) · Springer eBooks · doi:10.1007/978-1-4020-5614-7_2779 · Cited by 53
Cited by
A survey of multilinear subspace learning for tensor data
Lu, H., Plataniotis, K. N., & Venetsanopoulos, A. N. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2011.01.004 · Cited by 357
Evolutionary Network Analysis: A Survey
Aggarwal, C., & Subbian, K. (2014) · ACM Computing Surveys · doi:10.1145/2601412 · Cited by 313
Metadata
- Authors
- Sun, J., Tao, D., Papadimitriou, S., Yu, P. S., & Faloutsos, C.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2008-10
- Volume
- 2
- Issue
- 3
- Pages
- 1-37
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W1993589664
- Cited by
- 254
- References
- 42
- FWCI
- 4.46
- 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.