{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T02:07:16Z","timestamp":1777342036858,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Agriculture and Food Research Initiative Competitive Grant","award":["no. 2020-69012-31914"],"award-info":[{"award-number":["no. 2020-69012-31914"]}]},{"name":"University Transportation Center for Railway Safety (UTCRS) at UTRGV through the USDOT UTC Program under Grant","award":["no. 69A3552348340"],"award-info":[{"award-number":["no. 69A3552348340"]}]},{"name":"National Science Foundation under CAREER grant","award":["no. IIS 2046086"],"award-info":[{"award-number":["no. IIS 2046086"]}]},{"name":"CREST Center for Multidisciplinary Research Excellence in Cyber-Physical Infrastructure Systems (MECIS) grant","award":["no. 2112650"],"award-info":[{"award-number":["no. 2112650"]}]},{"name":"Combat Capabilities Development Command Army Research Laboratory and was accomplished under Cooperative Agreement","award":["Number W911NF-13-2-0045 (ARL Cyber Security CRA)"],"award-info":[{"award-number":["Number W911NF-13-2-0045 (ARL Cyber Security CRA)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,21]]},"DOI":"10.1145\/3627673.3679833","type":"proceedings-article","created":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T19:34:11Z","timestamp":1729452851000},"page":"14-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Neural Additive Tensor Decomposition for Sparse Tensors"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9268-4058","authenticated-orcid":false,"given":"Dawon","family":"Ahn","sequence":"first","affiliation":[{"name":"University of California, Riverside, Riverside, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8561-5527","authenticated-orcid":false,"given":"Uday Singh","family":"Saini","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3411-8483","authenticated-orcid":false,"given":"Evangelos E.","family":"Papalexakis","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4054-2958","authenticated-orcid":false,"given":"Ali","family":"Payani","sequence":"additional","affiliation":[{"name":"Cisco Systems Inc., San Jose, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16811"},{"key":"e_1_3_2_1_3_1","volume-title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets. arxiv","author":"Agarwal Rishabh","year":"2004","unstructured":"Rishabh Agarwal, Levi Melnick, Nicholas Frosst, Xuezhou Zhang, Ben Lengerich, Rich Caruana, and Geoffrey Hinton. 2021. Neural Additive Models: Interpretable Machine Learning with Neural Nets. arxiv: 2004.13912 [cs.LG]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00649-4"},{"key":"e_1_3_2_1_5_1","volume-title":"Tucker: Tensor factorization for knowledge graph completion. arXiv preprint arXiv:1901.09590","author":"Balavzevi\u0107 Ivana","year":"2019","unstructured":"Ivana Balavzevi\u0107, Carl Allen, and Timothy M Hospedales. 2019. Tucker: Tensor factorization for knowledge graph completion. arXiv preprint arXiv:1901.09590 (2019)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/339"},{"key":"e_1_3_2_1_8_1","volume-title":"Temporal link prediction using matrix and tensor factorizations. ACM Transactions on Knowledge Discovery from Data (TKDD)","author":"Dunlavy Daniel M","year":"2011","unstructured":"Daniel M Dunlavy, Tamara G Kolda, and Evrim Acar. 2011. Temporal link prediction using matrix and tensor factorizations. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 5, 2 (2011), 1--27."},{"key":"e_1_3_2_1_9_1","volume-title":"international conference on learning representations.","author":"Fan Jicong","year":"2021","unstructured":"Jicong Fan. 2021. Multi-mode deep matrix and tensor factorization. In international conference on learning representations."},{"key":"e_1_3_2_1_10_1","volume-title":"Functional Bayesian Tucker Decomposition for Continuous-indexed Tensor Data. arXiv preprint arXiv:2311.04829","author":"Fang Shikai","year":"2023","unstructured":"Shikai Fang, Xin Yu, Zheng Wang, Shibo Li, Mike Kirby, and Shandian Zhe. 2023. Functional Bayesian Tucker Decomposition for Continuous-indexed Tensor Data. arXiv preprint arXiv:2311.04829 (2023)."},{"key":"e_1_3_2_1_11_1","volume-title":"The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis)","author":"Maxwell Harper F","year":"2015","unstructured":"F Maxwell Harper and Joseph A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis), Vol. 5, 4 (2015), 1--19."},{"key":"e_1_3_2_1_12_1","unstructured":"Richard A Harshman et al. 1970. Foundations of the PARAFAC procedure: Models and conditions for an\" explanatory\" multimodal factor analysis. (1970)."},{"key":"e_1_3_2_1_13_1","volume-title":"Generalized additive models","author":"Hastie Trevor","unstructured":"Trevor Hastie and Robert Tibshirani. 1990. Generalized additive models. Wiley Online Library."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623658"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539317"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00186"},{"key":"e_1_3_2_1_18_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2021.3064182"},{"key":"e_1_3_2_1_20_1","series-title":"SIAM review","volume-title":"Tensor decompositions and applications","author":"Kolda Tamara G","year":"2009","unstructured":"Tamara G Kolda and Brett W Bader. 2009. Tensor decompositions and applications. SIAM review, Vol. 51, 3 (2009), 455--500."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1266265"},{"key":"e_1_3_2_1_22_1","volume-title":"Tensor decompositions for temporal knowledge base completion. arXiv preprint arXiv:2004.04926","author":"Lacroix Timoth\u00e9e","year":"2020","unstructured":"Timoth\u00e9e Lacroix, Guillaume Obozinski, and Nicolas Usunier. 2020. Tensor decompositions for temporal knowledge base completion. arXiv preprint arXiv:2004.04926 (2020)."},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Machine Learning. PMLR, 2863--2872","author":"Lacroix Timoth\u00e9e","year":"2018","unstructured":"Timoth\u00e9e Lacroix, Nicolas Usunier, and Guillaume Obozinski. 2018. Canonical tensor decomposition for knowledge base completion. In International Conference on Machine Learning. PMLR, 2863--2872."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-018-9587-4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330881"},{"key":"e_1_3_2_1_26_1","volume-title":"Uday Singh Saini, and Partha Talukdar","author":"Nimishakavi Madhav","year":"2016","unstructured":"Madhav Nimishakavi, Uday Singh Saini, and Partha Talukdar. 2016. Relation schema induction using tensor factorization with side information. arXiv preprint arXiv:1605.04227 (2016)."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 16th International Conference on Information Fusion. IEEE, 899--905","author":"Papalexakis Evangelos E","year":"2013","unstructured":"Evangelos E Papalexakis, Leman Akoglu, and Dino Ience. 2013. Do more views of a graph help? community detection and clustering in multi-graphs. In Proceedings of the 16th International Conference on Information Fusion. IEEE, 899--905."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigComp51126.2021.00041"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983332"},{"key":"e_1_3_2_1_30_1","volume-title":"Julia: Joint multi-linear and nonlinear identification for tensor completion. arXiv preprint arXiv:2202.00071","author":"Qian Cheng","year":"2022","unstructured":"Cheng Qian, Kejun Huang, Lucas Glass, Rakshith S Srinivasa, and Jimeng Sun. 2022. Julia: Joint multi-linear and nonlinear identification for tensor completion. arXiv preprint arXiv:2202.00071 (2022)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2610420"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<229::AID-CEM587>3.0.CO;2-N"},{"key":"e_1_3_2_1_33_1","volume-title":"Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research","author":"Srivastava Nitish","year":"2014","unstructured":"Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research, Vol. 15, 1 (2014), 1929--1958."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i14.29456"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02296342"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00062"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290998"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2327053"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767794"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271795"}],"event":{"name":"CIKM '24: The 33rd ACM International Conference on Information and Knowledge Management","location":"Boise ID USA","acronym":"CIKM '24","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 33rd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679833","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627673.3679833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:07Z","timestamp":1750294687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,21]]},"references-count":41,"alternative-id":["10.1145\/3627673.3679833","10.1145\/3627673"],"URL":"https:\/\/doi.org\/10.1145\/3627673.3679833","relation":{},"subject":[],"published":{"date-parts":[[2024,10,21]]},"assertion":[{"value":"2024-10-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}