Skip to main content
SpringerLink
Log in
Book cover

International Conference on Similarity Search and Applications

SISAP 2012: Similarity Search and Applications pp 226–239Cite as

Fast Similarity Computation in Factorized Tensors

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7404))

Abstract

Low-rank factorizations of higher-order tensors have become an invaluable tool for researchers from many scientific disciplines. Tensor factorizations have been successfully applied for moderately sized multimodal data sets involving a small number of modes. However, a significant hindrance to the full realization of the potential of tensor methods is a lack of scalability on the client side: even when low-rank representations are provided by an external agent possessing the necessary computational resources, client applications are quickly rendered infeasible by the space requirements for explicitly storing a (dense) low-rank representation of the input tensor. We consider the problem of efficiently computing common similarity measures between entities expressed by fibers (vectors) or slices (matrices) within a given factorized tensor. We show that after appropriate preprocessing, inner products can be efficiently computed independently of the dimensions of the input tensor.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andersson, C.A., Henrion, R.: A general algorithm for obtaining simple structure of core arrays in n-way PCA with application to fluorometric data. Computational Statistics & Data Analysis 31(3), 255–278 (1999)

    Article  MATH  Google Scholar 

  2. Appellof, C.J., Davidson, E.R.: Strategies for analyzing data from video fluorometric monitoring of liquid chromatographic effluents. Analytical Chemistry 53(13), 2053–2056 (1981)

    Article  Google Scholar 

  3. Bader, B.W., Kolda, T.G.: Efficient MATLAB computations with sparse and factored tensors. SIAM Journal on Scientific Computing 30(1), 205–231 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bader, B.W., Kolda, T.G.: MATLAB Tensor Toolbox Version 2.4 (March 2011), http://csmr.ca.sandia.gov/~tgkolda/TensorToolbox/

  5. Bennett, J., Lanning, S., Netflix: The Netflix Prize. In: KDD Cup and Workshop in conjunction with KDD (2007)

    Google Scholar 

  6. Cantador, I., Brusilovsky, P., Kuflik, T.: 2nd workshop on information heterogeneity and fusion in recommender systems (HetRec 2011). In: Proceedings of the 5th ACM Conference on Recommender Systems, RecSys 2011, ACM (2011)

    Google Scholar 

  7. Carroll, J., Chang, J.-J.: Analysis of individual differences in multidimensional scaling via an n-way generalization of Eckart-Young decomposition. Psychometrika 35, 283–319 (1970)

    Article  MATH  Google Scholar 

  8. Chen, B., Petropulu, A.P., Lathauwer, L.D.: Blind identification of convolutive MIMO systems with 3 sources and 2 sensors. EURASIP Journal on Advances in Signal Processing 5, 487–496 (2002)

    Article  Google Scholar 

  9. Chi, Y., Tseng, B.L., Tatemura, J.: Eigen-trend: trend analysis in the blogosphere based on singular value decompositions. In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management, CIKM, pp. 68–77 (2006)

    Google Scholar 

  10. Comon, P.: Independent component analysis, a new concept? Signal Processing 36(3), 287–314 (1994)

    Article  MATH  Google Scholar 

  11. Dunlavy, D.M., Kolda, T.G., Acar, E.: Temporal link prediction using matrix and tensor factorizations. ACM Transactions on Knowledge Discovery from Data 5(2), Article 10, 27 pages (2011)

    Article  Google Scholar 

  12. Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1, 211–218 (1936)

    Article  MATH  Google Scholar 

  13. GroupLens Research Group. GroupLens Research Data Sets (August 2011), http://www.grouplens.org/node/12

  14. Håstad, J.: Tensor rank is NP-complete. Journal of Algorithms 11(4), 644–654 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  15. Harshman, R.A.: Foundations of the PARAFAC procedure: models and conditions for an explanatory multi-modal factor analysis. UCLA Working Papers in Phonetics 16, 1–84 (1970)

    Google Scholar 

  16. Hitchcock, F.L.: The expression of a tensor or a polyadic as a sum of products. J. Math. 6, 164–189 (1927)

    MATH  Google Scholar 

  17. Kapteyn, A., Neudecker, H., Wansbeek, T.: An approach to n-mode components analysis. Psychometrika 51, 269–275 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  18. Karatzoglou, A., Amatriain, X., Baltrunas, L., Oliver, N.: Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering. In: Proceedings of the 4th ACM Conference on Recommender Systems, pp. 79–86 (2010)

    Google Scholar 

  19. Kolda, T., Bader, B.: The TOPHITS model for higher-order web link analysis. In: Proceedings of the SIAM Data Mining Conference Workshop on Link Analysis, Counterterrorism and Security (2006)

    Google Scholar 

  20. Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Review 51(3), 455–500 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kolda, T.G., Bader, B.W., Kenny, J.P.: Higher-order web link analysis using multilinear algebra. In: ICDM 2005: Proceedings of the 5th IEEE International Conference on Data Mining, pp. 242–249 (November 2005)

    Google Scholar 

  22. Kolda, T.G., Sun, J.: Scalable tensor decompositions for multi-aspect data mining. In: ICDM 2008: Proceedings of the 8th IEEE International Conference on Data Mining, pp. 363–372 (December 2008)

    Google Scholar 

  23. Lin, Z.: Some software packages for partial SVD computation. Computing Research Repository (CoRR) abs/1108.1548 (2011)

    Google Scholar 

  24. Möcks, J.: Topographic components model for event-related potentials and some biophysical considerations. IEEE Transactions on Biomedical Engineering 35(6), 482–484 (1988)

    Article  Google Scholar 

  25. Rendle, S.: Tag recommender (October 2011), http://cms.uni-konstanz.de/informatik/rendle/software/tag-recommender/

  26. Rendle, S., Schmidt-Thieme, L.: Pairwise interaction tensor factorization for personalized tag recommendation. In: WSDM, pp. 81–90 (2010)

    Google Scholar 

  27. Ren, Henrion: N-way principal component analysis theory, algorithms and applications. Chemometrics and Intelligent Laboratory Systems 25(1), 1–23 (1994)

    Article  Google Scholar 

  28. Smilde, A.K., Wang, Y., Kowalski, B.R.: Theory of medium-rank second-order calibration with restricted-Tucker models. Journal of Chemometrics 8(1), 21–36 (1994)

    Article  Google Scholar 

  29. Tucker, L.: Some mathematical notes on three-mode factor analysis. Psychometrika 31, 279–311 (1966)

    Article  MathSciNet  Google Scholar 

  30. Vasilescu, M.A.O., Terzopoulos, D.: Multilinear Analysis of Image Ensembles: TensorFaces. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002, Part I. LNCS, vol. 2350, pp. 447–460. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Informatics, Tokyo, 101-8430, Japan

    Michael E. Houle & Michael Nett

  2. University of Tokyo, Tokyo, 113-8656, Japan

    Hisashi Kashima & Michael Nett

  3. Basic Research Programs PRESTO, Synthesis of Knowledge for Information Oriented Society, Japan

    Hisashi Kashima

Authors
  1. Michael E. Houle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hisashi Kashima
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Nett
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Chile, Chile

    Gonzalo Navarro

  2. Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Avenue, K1N 6N5, Ottawa, ON, Canada

    Vladimir Pestov

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Houle, M.E., Kashima, H., Nett, M. (2012). Fast Similarity Computation in Factorized Tensors. In: Navarro, G., Pestov, V. (eds) Similarity Search and Applications. SISAP 2012. Lecture Notes in Computer Science, vol 7404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32153-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32153-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32152-8

  • Online ISBN: 978-3-642-32153-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation