{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:33:34Z","timestamp":1743154414278,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030609351"},{"type":"electronic","value":"9783030609368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60936-8_16","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:05:52Z","timestamp":1602669952000},"page":"203-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Noise Adaptive Tensor Train Decomposition for Low-Rank Embedding of Noisy Data"],"prefix":"10.1007","author":[{"given":"Xinsheng","family":"Li","sequence":"first","affiliation":[]},{"given":"K. Sel\u00e7uk","family":"Candan","sequence":"additional","affiliation":[]},{"given":"Maria Luisa","family":"Sapino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Acar, E., et al.: Multiway analysis of epilepsy tensors. Bioinformatics, 10\u201318 (2007)","DOI":"10.1093\/bioinformatics\/btm210"},{"issue":"12","key":"16_CR2","first-page":"993","volume":"9","author":"Z Abedjan","year":"2016","unstructured":"Abedjan, Z., et al.: Detecting data errors: where are we and what needs to be done? PVLDB 9(12), 993\u20131004 (2016)","journal-title":"PVLDB"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0169-7439(00)00071-X","volume":"52","author":"CA Andersson","year":"2000","unstructured":"Andersson, C.A., Bro, R.: The N-way toolbox for MATLAB. Chemom. Intell. Lab. Syst. 52(1), 1\u20134 (2000)","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"16_CR4","unstructured":"Bader, B.W., Kolda, T.G., et al.: MATLAB tensor toolbox version 2.5, January 2012. http:\/\/www.sandia.gov\/~tgkolda\/TensorToolbox"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Bader, B.W., et al.: Temporal analysis of social networks using three-way DEDICOM. Sandia National Laboratories TR SAND2006-2161 (2006)","DOI":"10.2172\/887253"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Balakrishnan, R., Kambhampati, S.: SourceRank: relevance and trust assessment for deep web sources based on inter-source agreement. In: WWW, pp. 1055\u20131056 (2010)","DOI":"10.1145\/1772690.1772801"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.laa.2011.08.010","volume":"438","author":"J Ballani","year":"2013","unstructured":"Ballani, J., Grasedyck, L., Kluge, M.: Black box approximation of tensors in hierarchical Tucker format. Linear Algebra Appl. 438, 639\u2013657 (2013)","journal-title":"Linear Algebra Appl."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/nla.1818","volume":"20","author":"J Ballani","year":"2013","unstructured":"Ballani, J., Grasedyck, L.: A projection method to solve linear systems in tensor format. Numer. Linear Algebra Appl. 20, 27\u201343 (2013)","journal-title":"Numer. Linear Algebra Appl."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Brin, S., et al.: The anatomy of a large-scale hypertextual web search engine. In: WWW 1998 (1998)","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S.: Dynamic personalized PageRank in entity-relation graphs. In: WWW 2007 (2007)","DOI":"10.1145\/1242572.1242650"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Chen, X., et al.: LWI-SVD: low-rank, windowed, incremental singular value decompositions on time-evolving data sets. In: KDD 2014 (2014)","DOI":"10.1145\/2623330.2623671"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Chi, E.C., Kolda, T.G.: Making tensor factorizations robust to non-Gaussian noise. Technical report. arXiv: 1010.3043v1 (2010)","DOI":"10.2172\/1011706"},{"key":"16_CR13","unstructured":"Chu, W., Ghahramani, Z.: Probabilistic models for incomplete multi-dimensional arrays. In: AISTATS 2009 (2009)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Chu, X., et al.: RuleMiner: data quality rules discovery. In: CDE 2014 (2014)","DOI":"10.1109\/ICDE.2014.6816746"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1561\/2200000059","volume":"9","author":"A Cichocki","year":"2016","unstructured":"Cichocki, A., et al.: Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions Found. Trends Mach. Learn. 9, 249\u2013429 (2016)","journal-title":"Trends Mach. Learn."},{"key":"16_CR16","unstructured":"Harshman, R.A.: Foundations of the PARAFAC procedure: model and conditions for an explanatory multi-mode factor analysis. In: UCLA Working Papers in Phonetics, pp. 16:1\u201384 (1970)"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Hinton, G.E., Van, C.: Keeping the neural networks simple by minimizing the description length of the weights. In: COLT, pp. 5\u201313 (1993)","DOI":"10.1145\/168304.168306"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"A683","DOI":"10.1137\/100818893","volume":"34","author":"S Holtz","year":"2012","unstructured":"Holtz, S., et al.: The alternating linear scheme for tensor optimization in the tensor train format. SIAM J. Sci. Comput. 34, A683\u2013A713 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-32153-5_16","volume-title":"Similarity Search and Applications","author":"ME Houle","year":"2012","unstructured":"Houle, M.E., Kashima, H., Nett, M.: Fast similarity computation in factorized tensors. In: Navarro, G., Pestov, V. (eds.) SISAP 2012. LNCS, vol. 7404, pp. 226\u2013239. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32153-5_16"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.2478\/cmam-2011-0016","volume":"3","author":"L Grasedyck","year":"2011","unstructured":"Grasedyck, L., et al.: An introduction to hierarchical (H-) rank and TT-rank of tensors with examples. Comput. Methods Appl. Math 3, 291\u2013304 (2011)","journal-title":"Comput. Methods Appl. Math"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Jeon, I., Papalexakis, E., Kang, U., Faloutsos, C.: HaTen2: billionscale tensor decompositions. In: ICDE 2015 (2015)","DOI":"10.1109\/ICDE.2015.7113355"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Jeon, B., et al.: SCouT: scalable coupled matrix-tensor factorization - algorithm and discoveries. In: ICDE 2016 (2016)","DOI":"10.1109\/ICDE.2016.7498292"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1007665907178","volume":"37","author":"MI Jordan","year":"1999","unstructured":"Jordan, M.I., Ghahramani, Z., Jaakkola, T.S., Saul, L.K.: An introduction to variational methods for graphical models. Mach. Learn. 37, 183 (1999)","journal-title":"Mach. Learn."},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Kang, U., et al.: GigaTensor: scaling tensor analysis up by 100 times algorithms and discoveries. In: KDD 2012 (2012)","DOI":"10.1145\/2339530.2339583"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF02293599","volume":"45","author":"PM Kroonenberg","year":"1980","unstructured":"Kroonenberg, P.M., et al.: Principal component analysis of three-mode data by means of alternating least squares algorithms. Psychometrika 45, 69\u201397 (1980)","journal-title":"Psychometrika"},{"issue":"2","key":"16_CR26","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/07069239X","volume":"30","author":"H Kim","year":"2008","unstructured":"Kim, H., Park, H.: Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J. Matrix Anal. Appl. 30(2), 713\u2013730 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Kim, M., Candan, K.S.: Efficient static and dynamic in-database tensor decompositions on chunk-based array stores. In: CIKM 2014 (2014)","DOI":"10.1145\/2661829.2661864"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Li, X., et al.: Focusing decomposition accuracy by personalizing tensor decomposition (PTD). In: CIKM 2014 (2014)","DOI":"10.1145\/2661829.2662051"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Li, X., et al.: 2PCP: two-phase CP decomposition for billion-scale dense tensors. In: ICDE 2016 (2016)","DOI":"10.1109\/ICDE.2016.7498294"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Li, X., et al.: nTD: noise adaptive tensor decomposition. In: WWW 2017 (2017)","DOI":"10.1145\/3038912.3052641"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Li, X., et al.: M2TD: multi-task tensor decomposition for sparse ensemble simulations. In: ICDE 2018 (2018)","DOI":"10.1109\/ICDE.2018.00106"},{"key":"16_CR32","first-page":"2295","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM 33, 2295\u20132317 (2011)","journal-title":"SIAM"},{"key":"16_CR33","unstructured":"Salakhutdinov, R., et al.: Probabilistic matrix factorization. In: NIPS 2007 (2007)"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Sun, J., Papadimitriou, S., Yu, P.S.: Window based tensor analysis on high dimensional and multi aspect streams. In: ICDM, pp. 1076\u20131080 (2006)","DOI":"10.1109\/ICDM.2006.169"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Tjandra, A., Sakti, S., Nakamura, S.: Compressing recurrent neural network with tensor train. In: NIPS 2017 (2017)","DOI":"10.1109\/IJCNN.2017.7966420"},{"key":"16_CR36","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"L Tucker","year":"1966","unstructured":"Tucker, L.: Some mathematical notes on three-mode factor analysis. Psychometrika 31, 279\u2013311 (1966)","journal-title":"Psychometrika"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Xiong, L. et al.: Temporal collaborative filtering with Bayesian probabilistic tensor factorization. In: SDM 2010 (2010)","DOI":"10.1137\/1.9781611972801.19"},{"key":"16_CR38","unstructured":"Yang, Y., Krompass, D., Tresp, V.: Tensor-train recurrent neural networks for video classification. In: ICML 2017 (2017)"},{"key":"16_CR39","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.inffus.2015.07.002","volume":"28","author":"R Zafarani","year":"2016","unstructured":"Zafarani, R., Liu, H.: Users joining multiple sites: friendship and popularity variations across sites. Inf. Fusion 28, 83\u201389 (2016)","journal-title":"Inf. Fusion"},{"key":"16_CR40","unstructured":"Neal, R.: Probabilistic inference using Markov chain Monte Carlo methods. Technical Report CRG-TR-93-1, University of Toronto (1993)"},{"key":"16_CR41","unstructured":"http:\/\/grouplens.org\/datasets\/movielens\/"},{"key":"16_CR42","unstructured":"http:\/\/www2.informatik.uni-freiburg.de\/cziegler\/BX\/"},{"key":"16_CR43","unstructured":"http:\/\/www.public.asu.edu\/~jtang20\/datasetcode\/truststudy.htm"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60936-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:43:28Z","timestamp":1710251008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60936-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030609351","9783030609368"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60936-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 short papers accepted for the SISAP 2020 Doctoral Symposium are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}