Utilizing common substructures to speedup tensor factorization for mining dynamic graphs

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 435-444

  Liu, Wei ^a   Chan, Jeffrey ^a   Bailey, James ^a   Leckie, Christopher ^a   Kotagiri, Ramamohanarao ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

dynamic graphs; scalability; tensor factorization

Indexed keywords

CARDINALITIES; COMPUTATIONAL COSTS; CONVENTIONAL METHODS; DYNAMIC GRAPH; GRAPH DATA; HIGH QUALITY; LARGE GRAPHS; NATURAL REPRESENTATION; PUBLICATION NETWORKS; STANDARD FACTORIZATION; TENSOR FACTORIZATION; TIME COMPLEXITY; TIME-PERIODS;

CHEMICAL COMPOUNDS; FACTORIZATION; GRAPHIC METHODS; ITERATIVE METHODS; KNOWLEDGE MANAGEMENT; SCALABILITY;

TENSORS;

EID: 84871042302     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2396818     Document Type: Conference Paper

References (19)

1. B. Bader and T. Kolda. Efficient Matlab computations with sparse and factored tensors. SIAM Journal on Scientific Computing, 30(1):205-231, 2007.
2. J. Bunch and J. Hopcroft. Triangular factorization and inversion by fast matrix multiplication. Mathematics of Computation, pages 231-236, 1974.
3. J. Carroll and J. Chang. Analysis of individual differences in multidimensional scaling via an n-way generalization of "Eckart-Young" decomposition. Psychometrika, 35(3):283-319, 1970.
4. L. De Lathauwer, B. De Moor, and J. Vandewalle. A multilinear singular value decomposition. SIAM Journal on Matrix Analysis and Applications, 21(4):1253-1278, 2000.
5. L. De Lathauwer and D. Nion. Decompositions of a higher-order tensor in block terms. SIAM J. Matrix Analysis and Applications, 30(3):1067-1083, 2008.
6. J. Demšar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, 2006.
7. G. Golub and C. Van Loan. Matrix computations, volume 3. Johns Hopkins Univ Pr, 1996.
8. A. Kapteyn, H. Neudecker, and T. Wansbeek. An approach to n-mode components analysis. Psychometrika, 51(2):269-275, 1986.
9. T. Kolda and B. Bader. Tensor decompositions and applications. SIAM review, 51(3):455, 2009.
10. T. Kolda and J. Sun. Scalable tensor decompositions for multi-aspect data mining. In Proc of ICDM, pages 363-372, 2008.
11. X. Kong and P. Yu. Semi-supervised feature selection for graph classification. In Proc of KDD, pages 793-802, 2010.
12. P. Kroonenberg and J. De Leeuw. Principal component analysis of three-mode data by means of alternating least squares algorithms. Psychometrika, 45(1):69-97, 1980.
13. M. Ley. The DBLP computer science bibliography: evolution, research issues, perspectives. In String Processing and Information Retrieval, pages 481-486. Springer, 2002.
14. K. Ravi Kanth, D. Agrawal, and A. Singh. Dimensionality reduction for similarity searching in dynamic databases. ACM SIGMOD Record, 27(2):166-176, 1998.
15. C. Schifanella, K. Candan, and M. Sapino. Fast metadata-driven multiresolution tensor decomposition. In Proc of CIKM, pages 1275-1284, 2011.
16. J. Sun, S. Papadimitriou, and P. Yu. Window-based tensor analysis on high-dimensional and multi-aspect streams. In Proc of ICDM, pages 1076-1080, 2006.
17. J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: dynamic tensor analysis. In Proc of KDD, pages 374-383, 2006.
18. J. Sun, D. Tao, S. Papadimitriou, P. Yu, and C. Faloutsos. Incremental tensor analysis: theory and applications. ACM Transactions on Knowledge Discovery from Data, 2(3):11, 2008.
19. L. Tucker. Some mathematical notes on three-mode factor analysis. Psychometrika, 31(3):279-311, 1966.