{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:26Z","timestamp":1740169166526,"version":"3.37.3"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["20192ACBL21006"],"award-info":[{"award-number":["20192ACBL21006"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61967006"],"award-info":[{"award-number":["61967006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009102","name":"Education Department of Jiangxi Province","doi-asserted-by":"publisher","award":["GJJ180321"],"award-info":[{"award-number":["GJJ180321"]}],"id":[{"id":"10.13039\/501100009102","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2984796","type":"journal-article","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T20:50:36Z","timestamp":1585774236000},"page":"66856-66866","source":"Crossref","is-referenced-by-count":2,"title":["A Sparse Connected Long Short-Term Memory With Sharing Weight for Time Series Prediction"],"prefix":"10.1109","volume":"8","author":[{"given":"Liyan","family":"Xiong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8659-6260","authenticated-orcid":false,"given":"Xiangzheng","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weimin","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weichun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2019.1800155"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2017.1600304WC"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2895252"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.enbuild.2016.05.028"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-010-0456-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2009.932254"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2007.899728"},{"article-title":"Ensemble learning for time series prediction","year":"2008","author":"Bouchachia","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760734"},{"key":"ref10","article-title":"Predicting performance and quantifying corporate governance risk for Latin American Adrs and banks","volume-title":"Financial Engineering And Applications","author":"Creamer","year":"2004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2017.04.007"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/366"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2005.06.042"},{"key":"ref15","article-title":"Contextual LSTM (CLSTM) models for large scale NLP tasks","author":"Ghosh","year":"2016","journal-title":"arXiv:1602.06291"},{"key":"ref16","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","volume-title":"Proc. Adv. NIPS","author":"Sutskever"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.06.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2018.03.098"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/476"},{"key":"ref20","first-page":"2148","article-title":"Predicting parameters in deep learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Denil"},{"key":"ref21","article-title":"Learning intrinsic sparse structures within long short-term memory","author":"Wen","year":"2017","journal-title":"arXiv:1709.05027"},{"key":"ref22","article-title":"One-shot pruning of recurrent neural networks by jacobian spectrum evaluation","author":"Shunshi Zhang","year":"2019","journal-title":"arXiv:1912.00120"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472821"},{"key":"ref24","article-title":"Grow and prune compact, fast, and accurate LSTMs","author":"Dai","year":"2018","journal-title":"arXiv:1805.11797"},{"key":"ref25","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Han"},{"key":"ref26","article-title":"Deep compression: Compressing deep neural networks with pruning, trained quantization and Huffman coding","author":"Han","year":"2015","journal-title":"arXiv:1510.00149"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111341"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2016.7727551"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1972.1099963"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-2312(01)00702-0"},{"key":"ref31","first-page":"155","article-title":"Support vector regression machines","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Drucker"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2017.02.007"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3390\/s19132946"},{"key":"ref34","first-page":"1","article-title":"Eidetic 3D LSTM: A model for video prediction and beyond","volume-title":"Proc. ICLR","author":"Wang"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP.2017.8171119"},{"key":"ref36","article-title":"Pruning convolutional neural networks for resource efficient inference","author":"Molchanov","year":"2016","journal-title":"arXiv:1611.06440"},{"key":"ref37","article-title":"Pruning filters for efficient ConvNets","author":"Li","year":"2016","journal-title":"arXiv:1608.08710"},{"key":"ref38","article-title":"Network in network","author":"Lin","year":"2013","journal-title":"arXiv:1312.4400"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/72.80236"},{"key":"ref41","article-title":"SNIP: Single-shot network pruning based on connection sensitivity","author":"Lee","year":"2018","journal-title":"arXiv:1810.02340"},{"key":"ref42","first-page":"598","article-title":"Optimal brain damage","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"LeCun"},{"key":"ref43","first-page":"107","article-title":"Skeletonization: A technique for trimming the fat from a network via relevance assessment","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Mozer"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.5244\/C.29.31"},{"key":"ref45","first-page":"1379","article-title":"Dynamic network surgery for efficient DNNs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Guo"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00890"},{"key":"ref47","article-title":"Exploring sparsity in recurrent neural networks","author":"Narang","year":"2017","journal-title":"arXiv:1704.05119"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2551458"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.4.473"},{"key":"ref50","article-title":"Soft weight-sharing for neural network compression","author":"Ullrich","year":"2017","journal-title":"arXiv:1702.04008"},{"key":"ref51","article-title":"Compressing deep convolutional networks using vector quantization","author":"Gong","year":"2014","journal-title":"arXiv:1412.6115"},{"key":"ref52","first-page":"3123","article-title":"Binaryconnect: Training deep neural networks with binary weights during propagations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Courbariaux"},{"key":"ref53","article-title":"Binarized neural networks: Training deep neural networks with weights and activations constrained to+ 1 or-1","author":"Courbariaux","year":"2016","journal-title":"arXiv:1602.02830"},{"key":"ref54","first-page":"2285","article-title":"Compressing neural networks with the hashing trick","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"issue":"1","key":"ref55","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref57","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219885"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09052660.pdf?arnumber=9052660","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:19:28Z","timestamp":1706059168000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9052660\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":58,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2984796","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}