{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T01:12:21Z","timestamp":1711415541185},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T00:00:00Z","timestamp":1703808000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T00:00:00Z","timestamp":1703808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s11424-023-2342-2","type":"journal-article","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T04:44:51Z","timestamp":1703825091000},"page":"692-728","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Covariate-Assisted Matrix Completion with Multiple Structural Breaks"],"prefix":"10.1007","volume":"37","author":[{"given":"Jing","family":"Meng","sequence":"first","affiliation":[]},{"given":"Long","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Changliang","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Zhaojun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,29]]},"reference":[{"key":"2342_CR1","first-page":"2056","volume":"23","author":"R Salakhutdinov","year":"2010","unstructured":"Salakhutdinov R and Srebro N, Collaborative filtering in a non-uniform world: Learning with the weighted trace norm, Advances in Neural Information Processing Systems, 2010, 23: 2056\u20132064.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"2\u20133","key":"2342_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"M C So","year":"2007","unstructured":"So M C and Ye Y, Theory of semidefinite programming for sensor network localization, Mathematical Programming, 2007, 109(2\u20133): 367\u2013384.","journal-title":"Mathematical Programming"},{"key":"2342_CR3","first-page":"1","volume":"19","author":"A Argyriou","year":"2006","unstructured":"Argyriou A, Evgeniou T, and Pontil M, Multi-task feature learning, Advances in Neural Information Processing Systems, 2006, 19: 1\u201318.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"2","key":"2342_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s11222-008-9111-x","volume":"20","author":"G Obozinski","year":"2010","unstructured":"Obozinski G, Taskar B, and Jordan M I, Joint covariate selection and joint subspace selection for multiple classification problems, Statistics and Computing, 2010, 20(2): 231\u2013252.","journal-title":"Statistics and Computing"},{"issue":"6","key":"2342_CR5","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E J Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s E J and Rech B, Exact matrix completion via convex optimization, Foundations of Computational Mathematics, 2009, 9(6): 717\u2013772.","journal-title":"Foundations of Computational Mathematics"},{"issue":"5","key":"2342_CR6","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E J Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s E J and Terence T, The power of convex relaxation: Near-optimal matrix completion, IEEE Transactions on Information Theory, 2010, 56(5): 2053\u20132080.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2342_CR7","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"R H Keshavan","year":"2009","unstructured":"Keshavan R H, Oh S, and Montanari A, Matrix completion from a few entries, IEEE Transactions on Information Theory, 2009, 56(6): 2980\u20132998.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2342_CR8","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"G David","year":"2011","unstructured":"David G, Recovering low-rank matrices from few coefficients in any basis, IEEE Transactions on Information Theory, 2011, 57(3): 1548\u20131566.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"2342_CR9","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht B, A simpler approach to matrix completion, Journal of Machine Learning Research, 2011, 12(12): 3413\u20133430.","journal-title":"Journal of Machine Learning Research"},{"issue":"6","key":"2342_CR10","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"E J Candes","year":"2010","unstructured":"Candes E J and Yaniv P, Matrix completion with noise, Proceedings of the IEEE, 2010, 98(6): 925\u2013936.","journal-title":"Proceedings of the IEEE"},{"issue":"3","key":"2342_CR11","first-page":"471","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht B, Fazel M, and Parrilo P A, Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization, Society for Industrial and Applied Mathematics Review, 2010, 52(3): 471\u2013501.","journal-title":"Society for Industrial and Applied Mathematics Review"},{"issue":"5","key":"2342_CR12","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1214\/11-AOS894","volume":"39","author":"V Koltchinskii","year":"2011","unstructured":"Koltchinskii V, Lounici K, and Tsybakov A B, Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion, The Annals of Statistics, 2011, 39(5): 2302\u20132329.","journal-title":"The Annals of Statistics"},{"issue":"2","key":"2342_CR13","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1214\/10-AOS860","volume":"39","author":"A Rohde","year":"2011","unstructured":"Rohde A and Tsybakov A B, Estimation of high-dimensional low-rank matrices, The Annals of Statistics, 2011, 39(2): 887\u2013930.","journal-title":"The Annals of Statistics"},{"key":"2342_CR14","first-page":"1329","volume":"17","author":"N Srebro","year":"2004","unstructured":"Srebro N, Rennie J D M, and Jaakkola T S, Maximum-margin matrix factorization, Citeseer, 2004, 17: 1329\u20131336.","journal-title":"Citeseer"},{"key":"2342_CR15","first-page":"315","volume":"19","author":"R Foygel","year":"2011","unstructured":"Foygel R and Srebro N, Concentration-based guarantees for low-rank matrix reconstruction, JMLR Workshop and Conference Proceedings, 2011, 19: 315\u2013340.","journal-title":"JMLR Workshop and Conference Proceedings"},{"issue":"1","key":"2342_CR16","first-page":"1493","volume":"10","author":"T Tony Cai","year":"2016","unstructured":"Tony Cai T and Zhou W X, Matrix completion via max-norm constrained optimization, Electronic Journal of Statistics, 2016, 10(1): 1493\u20131525.","journal-title":"Electronic Journal of Statistics"},{"issue":"4","key":"2342_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2827872","volume":"5","author":"F M Harper","year":"2015","unstructured":"Harper F M and Konstan J A, The movielens datasets: History and context, ACM Transactions on Interactive Intelligent Systems, 2015, 5(4): 1\u201319.","journal-title":"ACM Transactions on Interactive Intelligent Systems"},{"key":"2342_CR18","first-page":"3447","volume":"28","author":"K Chiang","year":"2015","unstructured":"Chiang K, Hsieh C, and Dhillon I S, Matrix completion with noisy side information, Advances in Neural Information Processing Systems, 2015, 28: 3447\u20133455.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"513","key":"2342_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1080\/01621459.2014.999158","volume":"111","author":"Y Zhu","year":"2016","unstructured":"Zhu Y, Shen X, and Ye C, Personalized prediction and sparsity pursuit in latent factor models, Journal of the American Statistical Association, 2016, 111(513): 241\u2013252.","journal-title":"Journal of the American Statistical Association"},{"issue":"525","key":"2342_CR20","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1080\/01621459.2017.1389740","volume":"114","author":"X Mao","year":"2019","unstructured":"Mao X, Chen S X, and Wong R K W, Matrix completion with covariate information, Journal of the American Statistical Association, 2019, 114(525): 198\u2013210.","journal-title":"Journal of the American Statistical Association"},{"key":"2342_CR21","doi-asserted-by":"crossref","unstructured":"Zhang B, Geng J, and Lai L, Change-point estimation in high dimensional linear regression models via sparse group Lasso, Proceedings of the 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, 2015, 815\u2013821.","DOI":"10.1109\/ALLERTON.2015.7447090"},{"issue":"6","key":"2342_CR22","first-page":"2243","volume":"42","author":"F Piotr","year":"2014","unstructured":"Piotr F, Wild binary segmentation for multiple change-point detection, The Annals of Statistics, 2014, 42(6): 2243\u20132281.","journal-title":"The Annals of Statistics"},{"issue":"500","key":"2342_CR23","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1080\/01621459.2012.737745","volume":"107","author":"R Killick","year":"2012","unstructured":"Killick R, Fearnhead P, and Eckley I A, Optimal detection of changepoints with a linear computational cost, Journal of the American Statistical Association, 2012, 107(500): 1590\u20131598.","journal-title":"Journal of the American Statistical Association"},{"issue":"4","key":"2342_CR24","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1214\/16-STS587","volume":"31","author":"Y S Niu","year":"2016","unstructured":"Niu Y S, Hao N, and Zhang H, Multiple change-point detection: A selective overview, Statistical Science, 2016, 31(4): 611\u2013623.","journal-title":"Statistical Science"},{"key":"2342_CR25","doi-asserted-by":"publisher","first-page":"1375","DOI":"10.1214\/aos\/1176345208","volume":"8","author":"T Sweeting","year":"1980","unstructured":"Sweeting T, Uniform asymptotic normality of the maximum likelihood estimator, The Annals of Statistics, 1980, 8: 1375\u20131381.","journal-title":"The Annals of Statistics"},{"key":"2342_CR26","volume-title":"Statistical Analysis with Missing Data","author":"R J A Little","year":"2019","unstructured":"Little R J A and Rubin D B, Statistical Analysis with Missing Data, John Wiley & Sons, Hoboken, 2019."},{"key":"2342_CR27","first-page":"2287","volume":"11","author":"R Mazumder","year":"2010","unstructured":"Mazumder R, Hastie T, and Tibshirani R, Spectral regularization algorithms for learning large incomplete matrices, The Journal of Machine Learning Research, 2010, 11: 2287\u20132322.","journal-title":"The Journal of Machine Learning Research"},{"issue":"4","key":"2342_CR28","first-page":"1553","volume":"23","author":"N Hao","year":"2013","unstructured":"Hao N, Niu Y S, and Zhang H, Multiple change-point detection via a screening and ranking algorithm, Statistica Sinica, 2013, 23(4): 1553\u20131572.","journal-title":"Statistica Sinica"},{"issue":"248","key":"2342_CR29","first-page":"1","volume":"22","author":"D Wang","year":"2021","unstructured":"Wang D, Zhao Z, Lin K Z, et al., Statistically and computationally efficient change point localization in regression settings, Journal of Machine Learning Research, 2021, 22(248): 1\u201346.","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"2342_CR30","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1111\/rssb.12322","volume":"81","author":"R Baranowski","year":"2019","unstructured":"Baranowski R, Chen Y, and Fryzlewicz P, Narrowest-over-threshold detection of multiple change points and change-point-like features, Journal of the Royal Statistical Society: Series B (Statistical Methodology), 2019, 81(3): 649\u2013672.","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"key":"2342_CR31","unstructured":"Mao X, Wang Z, and Yang S, Matrix completion for survey data prediction with multivariate missingness, 2019, arXiv: 1907.08360."},{"issue":"1","key":"2342_CR32","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1214\/20-AOS1953","volume":"49","author":"D Wang","year":"2021","unstructured":"Wang D, Yu Y, and Rinaldo A, Optimal change point detection and localization in sparse dynamic networks, The Annals of Statistics, 2021, 49(1): 203\u2013232.","journal-title":"The Annals of Statistics"},{"key":"2342_CR33","volume-title":"Consistency Results in Multiple Change-Point Problems","author":"E S Venkatraman","year":"1992","unstructured":"Venkatraman E S, Consistency Results in Multiple Change-Point Problems, Stanford University, Palo Alto, 1992."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-2342-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-023-2342-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-2342-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T18:13:42Z","timestamp":1711390422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-023-2342-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,29]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2342"],"URL":"https:\/\/doi.org\/10.1007\/s11424-023-2342-2","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,29]]},"assertion":[{"value":"19 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}