{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:50:03Z","timestamp":1649116203693},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"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":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s42979-020-00170-7","type":"journal-article","created":{"date-parts":[[2020,5,12]],"date-time":"2020-05-12T17:02:36Z","timestamp":1589302956000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallelized Training of Restricted Boltzmann Machines Using Markov-Chain Monte Carlo Methods"],"prefix":"10.1007","volume":"1","author":[{"given":"Pei","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivas","family":"Varadharajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas A.","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"II","given":"Don D.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"John A.","family":"Lockman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vineet","family":"Gundecha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quy","family":"Ta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,12]]},"reference":[{"key":"170_CR1","unstructured":"Carreira-Perpi\u00f1\u00e1n M\u00c1, Hinton GE. On contrastive divergence learning. In: AISTATS 2005."},{"key":"170_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-20656-7_2","volume-title":"International conference on high performance computing","author":"D Cavdar","year":"2019","unstructured":"Cavdar D, Codreanu V, Karakus C, Lockman JA, Podareanu D, Saletore V, Sergeev A, Smith DD, Suthichai V, Ta Q, Varadharajan S. Densifying assumed-sparse tensors. In: International conference on high performance computing. Cham: Springer; 2019. p. 23\u201339. https:\/\/doi.org\/10.1007\/978-3-030-20656-7_2."},{"key":"170_CR3","unstructured":"Dell EMC: HPC & AI Innovation Lab. 2019. https:\/\/www.dellemc.com\/en-us\/solutions\/high-performance-computing\/HPC-AI-Innovation-Lab.htm. Accessed 2 Nov 2019."},{"key":"170_CR4","doi-asserted-by":"publisher","DOI":"10.1201\/b14835","volume-title":"Markov Chain Monte Carlo in practice","year":"1996","unstructured":"Gilks WR, Richardson S, Spiegelhalter D, editors. Markov Chain Monte Carlo in practice. New York: Chapman and Hall\/CRC; 1996. https:\/\/doi.org\/10.1201\/b14835."},{"issue":"4","key":"170_CR5","doi-asserted-by":"crossref","DOI":"10.1145\/2827872","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper FM, Konstan JA. The MovieLens datasets: history and context. ACM Trans Interact Intell Syst. 2015;5(4):19.","journal-title":"ACM Trans Interact Intell Syst."},{"key":"170_CR6","unstructured":"Hinton G. 2017. https:\/\/www.cs.toronto.edu\/~hinton\/csc321\/readings\/boltz321.pdf. Accessed 1 Nov 2019."},{"key":"170_CR7","first-page":"282","volume-title":"Parallel distributed processing: explorations in the microstructure of cognition","author":"GE Hinton","year":"1986","unstructured":"Hinton GE, Sejnowski TJ. Learning and relearning in Boltzmann machines. In: Rumelhart DE, McClelland JL, editors. Parallel distributed processing: explorations in the microstructure of cognition, vol. 1. Cambridge: MIT Press; 1986. p. 282\u2013317."},{"key":"170_CR8","doi-asserted-by":"crossref","unstructured":"Salakhutdinov R, Mnih A, Hinton G. Restricted Boltzmann machine for collaborative filtering. In: Proceedings of the 24th international conference on machine learning 2007.","DOI":"10.1145\/1273496.1273596"},{"key":"170_CR9","unstructured":"Salakhutdinov R, Hinton G. Deep Boltzmann machines. In: van Dyk D, Welling M, editors. Proceedings of the twelth international conference on artificial intelligence and statistics, proceedings of machine learning research, vol.\u00a05. PMLR, Hilton Clearwater Beach Resort, Clearwater Beach, Florida USA; 2009. pp. 448\u2013455. http:\/\/proceedings.mlr.press\/v5\/salakhutdinov09a.html."},{"key":"170_CR10","unstructured":"Sergeev A, Balso MD. Horovod: fast and easy distributed deep learning in TensorFlow. arXiv preprint arXiv:1802.05799 2018."},{"key":"170_CR11","unstructured":"Smolensky P. Parallel distributed processing: explorations in the microstructure of cognition. In: Information processing in dynamical systems: foundations of harmony theory, vol. 1. Cambridge: MIT Press; 1986. pp. 194\u2013281. http:\/\/dl.acm.org\/citation.cfm?id=104279.104290."},{"key":"170_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/1975719","volume":"2017","author":"Z Xian","year":"2017","unstructured":"Xian Z, Li Q, Li G, Li L. New collaborative filtering algorithms based on SVD++ and differential privacy. Math Probl Eng. 2017;2017:1\u201314. https:\/\/doi.org\/10.1155\/2017\/1975719.","journal-title":"Math Probl Eng"},{"key":"170_CR13","doi-asserted-by":"publisher","unstructured":"Yu H. A gentle tutorial on restricted Boltzmann machine and contrastive divergence 2017. https:\/\/doi.org\/10.13140\/RG.2.2.26119.60326.","DOI":"10.13140\/RG.2.2.26119.60326"},{"key":"170_CR14","unstructured":"Zhang S, Wang W, Ford J, Makedon F, Pearlman J. Using singular value decomposition approximation for collaborative filtering. In: Seventh IEEE international conference on e-commerce technology (CEC\u201905). IEEE; 2005. pp. 257\u2013264."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00170-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-020-00170-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-00170-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T23:40:45Z","timestamp":1620776445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-020-00170-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["170"],"URL":"https:\/\/doi.org\/10.1007\/s42979-020-00170-7","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5]]},"assertion":[{"value":"12 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"165"}}