{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T22:30:22Z","timestamp":1775601022931,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819543830","type":"print"},{"value":"9789819543847","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:00:00Z","timestamp":1762387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:00:00Z","timestamp":1762387200000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-4384-7_19","type":"book-chapter","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T15:43:18Z","timestamp":1762357398000},"page":"265-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Matrix Completion with\u00a0Fuzzy Sampling for\u00a0Network Traffic Measurement"],"prefix":"10.1007","author":[{"given":"Yifei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Shu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunsheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunlai","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,6]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.comcom.2019.05.023","volume":"145","author":"D Li","year":"2019","unstructured":"Li, D., Xing, C., Zhang, G., Cao, H., Xu, B.: An online dynamic traffic matrix completion method in software defined networks. Comput. Commun. 145, 43\u201353 (2019)","journal-title":"Comput. Commun."},{"issue":"6","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1109\/JSAC.2019.2904347","volume":"37","author":"F Xiao","year":"2019","unstructured":"Xiao, F., Chen, L., Zhu, H., Hong, R., Wang, R.: Anomaly-tolerant network traffic estimation via noise-immune temporal matrix completion model. IEEE J. Sel. Areas Commun. 37(6), 1192\u20131204 (2019)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"5","key":"19_CR3","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"19_CR4","doi-asserted-by":"publisher","first-page":"10100","DOI":"10.1109\/TPAMI.2023.3261185","volume":"45","author":"H Cai","year":"2023","unstructured":"Cai, H., Huang, L., Li, P., Needell, D.: Matrix completion with cross-concentrated sampling: bridging uniform sampling and CUR sampling. IEEE Trans. Pattern Anal. Mach. Intell. 45(8), 10100\u201310113 (2023)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR5","unstructured":"Wan, Y., Yi, J., Zhang, L.: Matrix Completion from Non-Uniformly Sampled Entries (2018)"},{"key":"19_CR6","unstructured":"Chen, Y., Bhojanapalli, S., Sanghavi, S., Ward, R.: Completing any low-rank matrix, provably. J. Mach. Learn. Res. 2999\u20133034 (2015)"},{"key":"19_CR7","unstructured":"Balcan, M.F., Zhang, H.: Noise-tolerant life-long matrix completion via adaptive sampling (2016)"},{"key":"19_CR8","unstructured":"Kundu, A.: Relaxed leverage sampling for low-rank matrix completion. Statistics (2015)"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1016\/j.acha.2019.08.006","volume":"48","author":"K Hamm","year":"2020","unstructured":"Hamm, K., Huang, L.: Perspectives on CUR decompositions. Appl. Comput. Harmon. Anal. 48(3), 1088\u20131099 (2020)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/LSP.2020.3044130","volume":"28","author":"H Cai","year":"2021","unstructured":"Cai, H., Hamm, K., Huang, L., Li, J., Wang, T.: Rapid robust principal component analysis: CUR accelerated inexact low rank estimation. IEEE Sig. Process. Lett. 28, 116\u2013120 (2021)","journal-title":"IEEE Sig. Process. Lett."},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/JSTSP.2016.2537145","volume":"10","author":"DL Pimentel-Alarcon","year":"2016","unstructured":"Pimentel-Alarcon, D.L., Boston, N., Nowak, R.D.: A characterization of deterministic sampling patterns for low-rank matrix completion. IEEE J. Sel. Top. Sig. Process. 10(4), 623\u2013636 (2016)","journal-title":"IEEE J. Sel. Top. Sig. Process."},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/LSP.2017.2780983","volume":"25","author":"M Ashraphijuo","year":"2018","unstructured":"Ashraphijuo, M., Aggarwal, V., Wang, X.: On deterministic sampling patterns for robust low-rank matrix completion. IEEE Sig. Process. Lett. 25(3), 343\u2013347 (2018)","journal-title":"IEEE Sig. Process. Lett."},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/TPAMI.2019.2937869","volume":"43","author":"G Liu","year":"2021","unstructured":"Liu, G., Liu, Q., Yuan, X.T., Wang, M.: Matrix completion with deterministic sampling: theories and methods. IEEE Trans. Pattern Anal. Mach. Intell. 43(2), 549\u2013566 (2021)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"19_CR14","doi-asserted-by":"publisher","first-page":"4443","DOI":"10.1109\/TCYB.2023.3305552","volume":"54","author":"X Huang","year":"2024","unstructured":"Huang, X., Liu, W., Du, B., Tao, D.: Leveraged matrix completion with noise. IEEE Trans. Cybern. 54(8), 4443\u20134453 (2024)","journal-title":"IEEE Trans. Cybern."},{"key":"19_CR15","first-page":"1","volume":"23","author":"A Eshragh","year":"2022","unstructured":"Eshragh, A., Roosta, F., Nazari, A., Mahoney, M.W.: LSAR: efficient leverage score sampling algorithm for the analysis of big time series data. J. Mach. Learn. Res. 23, 1\u201336 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"19_CR16","unstructured":"McCurdy, S.R.: Ridge Regression and Provable Deterministic Ridge Leverage Score Sampling (2018)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Musco, C., Musco, C.: Input sparsity time low-rank approximation via ridge leverage score sampling. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1758\u20131777. Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974782.115"},{"key":"19_CR18","unstructured":"Meka, R., Jain, P., Dhillon, I.S.: Guaranteed Rank Minimization via Singular Value Projection (2009)"},{"issue":"4","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.dsp.2016.11.006","volume":"62","author":"ZX Cui","year":"2017","unstructured":"Cui, Z.X., Fan, Q.: A nonconvex nonsmooth regularization method for compressed sensing and low rank matrix completion. Digit. Sig. Process. 62, 101\u2013111 (2017)","journal-title":"Digit. Sig. Process."},{"issue":"150","key":"19_CR21","first-page":"1","volume":"22","author":"T Tong","year":"2021","unstructured":"Tong, T., Ma, C., Chi, Y.: Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent. J. Mach. Learn. Res. 22(150), 1\u201363 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Papailiopoulos, D., Kyrillidis, A., Boutsidis, C.: Provable Deterministic Leverage Score Sampling (2014)","DOI":"10.1145\/2623330.2623698"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4384-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:07:50Z","timestamp":1772806070000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4384-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,6]]},"ISBN":["9789819543830","9789819543847"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4384-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,6]]},"assertion":[{"value":"6 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Okinawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2025.apnns.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}