{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:46Z","timestamp":1750220626869,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,4,15]]},"DOI":"10.1145\/3409334.3452041","type":"proceedings-article","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T20:49:49Z","timestamp":1620679789000},"page":"71-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Item based recommendation using matrix-factorization-like embeddings from deep networks"],"prefix":"10.1145","author":[{"given":"Vaidyanath Areyur","family":"Shanthakumar","sequence":"first","affiliation":[{"name":"University of Alabama in Huntsville"}]},{"given":"Clark","family":"Barnett","sequence":"additional","affiliation":[{"name":"Overstock.com"}]},{"given":"Keith","family":"Warnick","sequence":"additional","affiliation":[{"name":"Overstock.com"}]},{"given":"Putu Ayu","family":"Sudyanti","sequence":"additional","affiliation":[{"name":"Overstock.com"}]},{"given":"Vitalii","family":"Gerbuz","sequence":"additional","affiliation":[{"name":"Overstock.com"}]},{"given":"Tathagata","family":"Mukherjee","sequence":"additional","affiliation":[{"name":"University of Alabama in Huntsville"}]}],"member":"320","published-online":{"date-parts":[[2021,5,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Facebook Research. https:\/\/research.fb.com\/."},{"key":"e_1_3_2_1_2_1","unstructured":"[n.d.]. FAISS. https:\/\/engineering.fb.com\/2017\/03\/29\/data-infrastructure\/faiss-a-library-for-efficient-similarity-search\/."},{"key":"e_1_3_2_1_3_1","unstructured":"[n.d.]. Fasttext. https:\/\/fasttext.cc\/."},{"key":"e_1_3_2_1_4_1","unstructured":"[n.d.]. Overstock Product Page. https:\/\/www.overstock.com\/Home-Garden\/Butler-Amir-Hand-Painted-Tall-Cabinet\/27599929\/product.html?recset=900e2d12-7c4a-47f9-a9a2-ddb7f894cd53&refccid=ZPLOVGMDKLG3TM2FG4YSXVXUJI&searchidx=28&recalg=null&recidx=22&kwds=India&rfmt=."},{"key":"e_1_3_2_1_5_1","unstructured":"[n.d.]. Overstock.som. https:\/\/www.overstock.com\/."},{"key":"e_1_3_2_1_6_1","unstructured":"[n.d.]. Overstock.som. https:\/\/www.overstock.com\/partner\/."},{"key":"e_1_3_2_1_7_1","unstructured":"[n.d.]. Recommendation Datasets. https:\/\/cseweb.ucsd.edu\/~jmcauley\/datasets.html."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"C. Aggarwal et al. 2016. Recommender Systems. Vol. 1. Springer.","DOI":"10.1007\/978-3-319-29659-3_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"S. Arora Y. Li Y. Liang T. Ma and A. Risteski. 2015. A Latent Variable Model Approach to PMI-based Word Embeddings. arXiv preprint arXiv:1502.03520 (2015).","DOI":"10.1162\/tacl_a_00106"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.04.237"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"e_1_3_2_1_12_1","unstructured":"Y. Dauphin H. Vries J. Chung and Y. Bengio. 2015. Rmsprop and Equilibrated Adaptive Learning Rates for Nonconvex Optimization. corr abs\/1502.04390 (2015)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"A. Feuerverger Y. He and S. Khatri. 2012. Statistical Significance of the Netflix Challenge. Statist. Sci. (2012) 202--231.","DOI":"10.1214\/11-STS368"},{"key":"e_1_3_2_1_15_1","unstructured":"I. Goodfellow Y. Bengio A. Courville and Y. Bengio. 2016. Deep Learning. Vol. 1. MIT press Cambridge."},{"volume-title":"Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Gupta D.","key":"e_1_3_2_1_16_1","unstructured":"D. Gupta, M. Digiovanni, H. Narita, and K. Goldberg. 1999. Jester 2.0 (poster abstract) Evaluation of an New Linear Time Collaborative Filtering Algorithm. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. New York, USA, 291--292."},{"volume-title":"Collaborative Filtering for Implicit Feedback Datasets. In 2008 Eighth IEEE International Conference on Data Mining. Ieee","author":"Hu Y.","key":"e_1_3_2_1_17_1","unstructured":"Y. Hu, Y. Koren, and C. Volinsky. 2008. Collaborative Filtering for Implicit Feedback Datasets. In 2008 Eighth IEEE International Conference on Data Mining. Ieee, Pisa, Italy, 263--272."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Y. Koren R. Bell and C. Volinsky. 2009. Matrix Factorization Techniques for Recommender Systems.","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Y. LeCun Y. Bengio and G. Hinton. 2015. Deep Learning. Nature 521 7553 (2015) 436--444.","DOI":"10.1038\/nature14539"},{"key":"e_1_3_2_1_21_1","first-page":"556","article-title":"Algorithms for Non-negative Matrix Factorization","volume":"13","author":"Lee D.","year":"2000","unstructured":"D. Lee and H. S. Seung. 2000. Algorithms for Non-negative Matrix Factorization. Advances in Neural Information Processing Systems 13 (2000), 556--562.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"C. D. Manning H. Sch\u00fctze and P. Raghavan. 2008. Introduction to Information Retrieval. Cambridge university press.","DOI":"10.1017\/CBO9780511809071"},{"volume-title":"Proceedings of the 2007 ACM Conference on Recommender Systems","author":"Nathanson T.","key":"e_1_3_2_1_23_1","unstructured":"T. Nathanson, E. Bitton, and K. Goldberg. 2007. Eigentaste 5.0: Constant-time Adaptability in a Recommender System Using Item Clustering. In Proceedings of the 2007 ACM Conference on Recommender Systems. Minneapolis, USA, 149--152."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(97)00097-X"},{"volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer","author":"Singh A.","key":"e_1_3_2_1_25_1","unstructured":"A. Singh and G. Gordon. 2008. A Unified View of Matrix Factorization Models. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, Antwerp, Belgium, 358--373."},{"key":"e_1_3_2_1_26_1","first-page":"1329","article-title":"Maximum-margin Matrix Factorization","volume":"17","author":"Srebro N.","year":"2004","unstructured":"N. Srebro, J. Rennie, and T. Jaakkola. 2004. Maximum-margin Matrix Factorization. Advances in Neural Information Processing Systems 17 (2004), 1329--1336.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"X. Su and T. Khoshgoftaar. 2009. A Survey of Collaborative Filtering Techniques. Advances in Artificial Intelligence 2009 (2009).","DOI":"10.1155\/2009\/421425"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2934"},{"key":"e_1_3_2_1_29_1","volume-title":"A Theoretical Analysis of NDCG Ranking Measures. In Proceedings of the 26th Annual Conference on Learning Theory (COLT","volume":"8","author":"Wang Y.","year":"2013","unstructured":"Y. Wang, L. Wang, Y. Li, D. He, W. Chen, and T. Liu. 2013. A Theoretical Analysis of NDCG Ranking Measures. In Proceedings of the 26th Annual Conference on Learning Theory (COLT 2013), Vol. 8. Princeton, USA, 6."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7439(87)80084-9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158369"}],"event":{"name":"ACM SE '21: 2021 ACM Southeast Conference","sponsor":["ACM Association for Computing Machinery"],"location":"Virtual Event USA","acronym":"ACM SE '21"},"container-title":["Proceedings of the 2021 ACM Southeast Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409334.3452041","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409334.3452041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:33Z","timestamp":1750197693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409334.3452041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,15]]},"references-count":31,"alternative-id":["10.1145\/3409334.3452041","10.1145\/3409334"],"URL":"https:\/\/doi.org\/10.1145\/3409334.3452041","relation":{},"subject":[],"published":{"date-parts":[[2021,4,15]]},"assertion":[{"value":"2021-05-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}