메뉴 건너뛰기




Volumn 2015-May, Issue , 2015, Pages 1047-1058

HaTen2: Billion-scale tensor decompositions

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING;

EID: 84940879259     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2015.7113355     Document Type: Conference Paper
Times cited : (127)

References (32)
  • 3
    • 80052744565 scopus 로고    scopus 로고
    • Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysis
    • K. Maruhashi, F. Guo, and C. Faloutsos, "Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysis," in ASONAM, 2011.
    • (2011) ASONAM
    • Maruhashi, K.1    Guo, F.2    Faloutsos, C.3
  • 4
    • 67049083427 scopus 로고    scopus 로고
    • Window-based tensor analysis on high-dimensional and multi-aspect streams
    • J. Sun, S. Papadimitriou, and P. S. Yu, "Window-based tensor analysis on high-dimensional and multi-aspect streams," in ICDM, 2006.
    • (2006) ICDM
    • Sun, J.1    Papadimitriou, S.2    Yu, P.S.3
  • 5
    • 67049173946 scopus 로고    scopus 로고
    • Scalable tensor decompositions for multi-aspect data mining
    • T. G. Kolda and J. Sun, "Scalable tensor decompositions for multi-aspect data mining," in ICDM, 2008, pp. 363-372.
    • (2008) ICDM , pp. 363-372
    • Kolda, T.G.1    Sun, J.2
  • 7
    • 85030321143 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • Dec.
    • J. Dean and S. Ghemawat, "Mapreduce: Simplified data processing on large clusters," OSDI'04, Dec. 2004.
    • (2004) OSDI'04
    • Dean, J.1    Ghemawat, S.2
  • 8
  • 9
    • 0002740437 scopus 로고
    • Foundations of the parafac procedure: Model and conditions for an explanatory multi-mode factor analysis
    • R. Harshman, "Foundations of the parafac procedure: model and conditions for an explanatory multi-mode factor analysis," UCLA working papers in phonetics, vol. 16, pp. 1-84, 1970.
    • (1970) UCLA Working Papers in Phonetics , vol.16 , pp. 1-84
    • Harshman, R.1
  • 10
    • 30144444694 scopus 로고    scopus 로고
    • A comparison of algorithms for fitting the parafac model
    • G. Tomasi and R. Bro, "A comparison of algorithms for fitting the parafac model," Computational Statistics & Data Analysis, vol. 50, no. 7, pp. 1700-1734, 2006.
    • (2006) Computational Statistics & Data Analysis , vol.50 , Issue.7 , pp. 1700-1734
    • Tomasi, G.1    Bro, R.2
  • 11
    • 0013953617 scopus 로고    scopus 로고
    • Some mathematical notes on three-mode factor analysis
    • 1966c
    • L. R. Tucker, "Some mathematical notes on three-mode factor analysis," Psychometrika, vol. 31, pp. 279-311, 1966c.
    • Psychometrika , vol.31 , pp. 279-311
    • Tucker, L.R.1
  • 15
    • 82255176534 scopus 로고    scopus 로고
    • Triplerank: Ranking semantic web data by tensor decomposition
    • T. Franz, A. Schultz, S. Sizov, and S. Staab, "Triplerank: Ranking semantic web data by tensor decomposition," in In ISWC, 2009.
    • (2009) ISWC
    • Franz, T.1    Schultz, A.2    Sizov, S.3    Staab, S.4
  • 18
    • 84890850521 scopus 로고    scopus 로고
    • Do more views of a graph help? Community detection and clustering in multi-graphs
    • E. E. Papalexakis, L. Akoglu, and D. Ienco, "Do more views of a graph help? community detection and clustering in multi-graphs," in Information Fusion (FUSION), 2013.
    • (2013) Information Fusion (FUSION)
    • Papalexakis, E.E.1    Akoglu, L.2    Ienco, D.3
  • 20
    • 67049173946 scopus 로고    scopus 로고
    • Scalable tensor decompositions for multi-aspect data mining
    • T. G. Kolda, "Scalable tensor decompositions for multi-aspect data mining," in ICDM, 2008.
    • (2008) ICDM
    • Kolda, T.G.1
  • 21
    • 84905701581 scopus 로고    scopus 로고
    • Multi-relational latent semantic analysis
    • K.-W. Chang, W.-t. Yih, and C. Meek, "Multi-relational latent semantic analysis. " in EMNLP, 2013, pp. 1602-1612.
    • (2013) EMNLP , pp. 1602-1612
    • Chang, K.-W.1    Yih, W.-T.2    Meek, C.3
  • 23
    • 34250676942 scopus 로고    scopus 로고
    • Cubesvd: A novel approach to personalized web search
    • J. Sun, H. Zeng, H. Liu, Y. Lu, and Z. Chen, "Cubesvd: a novel approach to personalized web search," in WWW, 2005.
    • (2005) WWW
    • Sun, J.1    Zeng, H.2    Liu, H.3    Lu, Y.4    Chen, Z.5
  • 24
    • 84944415516 scopus 로고    scopus 로고
    • Multilinear analysis of image ensembles: Tensorfaces
    • M. Vasilescu and D. Terzopoulos, "Multilinear analysis of image ensembles: Tensorfaces," Computer Vision ECCV 2002, pp. 447-460, 2002.
    • (2002) Computer Vision ECCV 2002 , pp. 447-460
    • Vasilescu, M.1    Terzopoulos, D.2
  • 25
    • 84863069279 scopus 로고    scopus 로고
    • Discriminative high order svd: Adaptive tensor subspace selection for image classification, clustering, and retrieval
    • D. Luo, H. Huang, and C. Ding, "Discriminative high order svd: Adaptive tensor subspace selection for image classification, clustering, and retrieval," in ICCV, 2011.
    • (2011) ICCV
    • Luo, D.1    Huang, H.2    Ding, C.3
  • 26
    • 49749096526 scopus 로고    scopus 로고
    • Efficient MATLAB computations with sparse and factored tensors
    • December
    • B. W. Bader and T. G. Kolda, "Efficient MATLAB computations with sparse and factored tensors," SIAM Journal on Scientific Computing, vol. 30, no. 1, pp. 205-231, December 2007.
    • (2007) SIAM Journal on Scientific Computing , vol.30 , Issue.1 , pp. 205-231
    • Bader, B.W.1    Kolda, T.G.2
  • 27
    • 84866052446 scopus 로고    scopus 로고
    • Gigatensor: Scaling tensor analysis up by 100 times-algorithms and discoveries
    • U. Kang, E. E. Papalexakis, A. Harpale, and C. Faloutsos, "Gigatensor: scaling tensor analysis up by 100 times-algorithms and discoveries," in KDD, 2012, pp. 316-324.
    • (2012) KDD , pp. 316-324
    • Kang, U.1    Papalexakis, E.E.2    Harpale, A.3    Faloutsos, C.4
  • 31
    • 84940870591 scopus 로고    scopus 로고
    • Decomposition-by-normalization (dbn): Leveraging approximate functional dependencies for efficient tensor decomposition
    • M. Kim and K. S. Candan, "Decomposition-by-normalization (dbn): leveraging approximate functional dependencies for efficient tensor decomposition," in CIKM, 2012.
    • (2012) CIKM
    • Kim, M.1    Candan, K.S.2
  • 32
    • 84940854109 scopus 로고    scopus 로고
    • Scalable boolean tensor factorizations using random walks
    • abs/1310. 4843
    • D. Erdös and P. Miettinen, "Scalable boolean tensor factorizations using random walks," CoRR, vol. Abs/1310. 4843, 2013.
    • (2013) CoRR
    • Erdös, D.1    Miettinen, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.