The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Scalable Tensor Decompositions for Multi-aspect Data Mining
Abstract
Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensionalities. Tensors (i.e., multi-way arrays) provide a natural representation for such data. Consequently, tensor decompositions such as Tucker become important tools for summarization and analysis. One major challenge is how to deal with high-dimensional, sparse data. In other words, how do we compute decompositions of tensors where most of the entries of the tensor are zero. Specialized techniques are needed for computing the Tucker decompositions for sparse tensors because standard algorithms do not account for the sparsity of the data. As a result, a surprising phenomenon is observed by practitioners: Despite the fact that there is enough memory to store both the input tensors and the factorized output tensors, memory overflows occur during the tensor factorization process. To address this intermediate blowup problem, we propose Memory-Efficient Tucker (MET). Based on the available memory, MET adaptively selects the right execution strategy during the decomposition. We provide quantitative and qualitative evaluation of MET on real tensors. It achieves over 1000X space reduction without sacrificing speed; it also allows us to work with much larger tensors that were too big to handle before. Finally, we demonstrate a data mining case-study using MET.
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
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Self-citationCarroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Harshman, R. A. (1970) · Cited by 2,255
On 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
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
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-citationMultilinear operators for higher-order decompositions.
Kolda, T. (2006) · doi:10.2172/923081 · Cited by 365
Self-citationCubeSVD: a novel approach to personalized Web search
Sun, J.-T., Zeng, H.-J., Liu, H., Lu, Y., & Chen, Z. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060803 · Cited by 338
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
Self-citationHandwritten digit classification using higher order singular value decomposition
Savas, B., & Eldén, L. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2006.08.004 · Cited by 207
Modeling and Multiway Analysis of Chatroom Tensors
Acar, E., Camtepe, S. A., Krishnamoorthy, M. S., & Yener, B. (2005) · Lecture notes in computer science · doi:10.1007/11427995_21 · Cited by 170
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-citationCollective Sampling and Analysis of High Order Tensors for Chatroom Communications
Acar, E., Camtepe, S. A., & Yener, B. (2006) · Lecture notes in computer science · doi:10.1007/11760146_19 · Cited by 75
Chi, Y., Tseng, B. L., & Tatemura, J. (2006) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1183614.1183628 · Cited by 55
Cited by
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
“These methods have been used to extract communities [104], to rank nodes [109,110] and to perform data mining [103,111,112].”
MethodDistributional Memory: A General Framework for Corpus-Based Semantics
Baroni, M., & Lenci, A. (2010) · Computational Linguistics · doi:10.1162/coli_a_00016 · Cited by 659
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.14 · Cited by 628
Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
Semerci, O., Hao, N., Kilmer, M. E., & Miller, E. L. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2305840 · Cited by 389
Anomaly detection in dynamic networks: a survey
Ranshous, S., Shen, S., Koutra, D., Harenberg, S., Faloutsos, C., & Samatova, N. F. (2015) · WIREs Computational Statistics · doi:10.1002/wics.1347 · Cited by 379
Metadata
- Authors
- Kolda, T. G., & Sun, J.
- Venue
- 2008 Eighth IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2008-12
- Pages
- 363-372
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2119511382
- Cited by
- 358
- References
- 15
- FWCI
- 10.98
- 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.