{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:50:38Z","timestamp":1758268238044,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:00:00Z","timestamp":1649030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:00:00Z","timestamp":1649030400000},"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":["Appl Intell"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10489-022-03346-1","type":"journal-article","created":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:02:15Z","timestamp":1649098935000},"page":"17684-17707","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Fast hypergraph regularized nonnegative tensor ring decomposition based on low-rank approximation"],"prefix":"10.1007","volume":"52","author":[{"given":"Xinhai","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuyuan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1187-577X","authenticated-orcid":false,"given":"Guoxu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qibin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijun","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"issue":"6755","key":"3346_CR1","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee D D, Seung H S (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791","journal-title":"Nature"},{"issue":"6","key":"3346_CR2","doi-asserted-by":"publisher","first-page":"2151","DOI":"10.1007\/s10489-018-1380-2","volume":"49","author":"Y Sheng","year":"2019","unstructured":"Sheng Y, Wang M, Wu T, Xu H (2019) Adaptive local learning regularized nonnegative matrix factorization for data clustering. Appl Intell 49(6):2151\u20132168","journal-title":"Appl Intell"},{"unstructured":"Belkin M, Niyogi P, Sindhwani V (2006) Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. J Machine Learn Res 7(11)","key":"3346_CR3"},{"issue":"9","key":"3346_CR4","doi-asserted-by":"publisher","first-page":"1744","DOI":"10.1109\/TCYB.2014.2359984","volume":"45","author":"S-B Chen","year":"2014","unstructured":"Chen S-B, Ding CHQ, Luo B (2014) Similarity learning of manifold data. IEEE Trans Cybern 45(9):1744\u20131756","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"3346_CR5","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10489-019-01539-9","volume":"50","author":"L Zhang","year":"2020","unstructured":"Zhang L, Liu Z, Pu J, Song B (2020) Adaptive graph regularized nonnegative matrix factorization for data representation. Appl Intell 50(2):438\u2013447","journal-title":"Appl Intell"},{"doi-asserted-by":"crossref","unstructured":"Li S, Li W, Hu J, Li Y (2021) Semi-supervised bi-orthogonal constraints dual-graph regularized nmf for subspace clustering. Appl Intell:1\u201322","key":"3346_CR6","DOI":"10.1007\/s10489-021-02522-z"},{"doi-asserted-by":"crossref","unstructured":"Shu Z, Weng Z, Yu Z, You C, Liu Z, Tang S, Wu X (2021) Correntropy-based dual graph regularized nonnegative matrix factorization with lp smoothness for data representation. Appl Intell:1\u201317","key":"3346_CR7","DOI":"10.1007\/s10489-021-02826-0"},{"issue":"8","key":"3346_CR8","first-page":"1548","volume":"33","author":"D Cai","year":"2010","unstructured":"Cai D, He X, Han J, Huang T S (2010) Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548\u20131560","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"3346_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/MSP.2013.2297439","volume":"32","author":"A Cichocki","year":"2015","unstructured":"Cichocki A, Mandic D, De Lathauwer L, Zhou G, Zhao Q, Caiafa C, Phan H A (2015) Tensor decompositions for signal processing applications: From two-way to multiway component analysis. IEEE Signal Process Mag 32(2):145\u2013163","journal-title":"IEEE Signal Process Mag"},{"doi-asserted-by":"crossref","unstructured":"Zhao Q, Sugiyama M, Yuan L, Cichocki A (2019) Learning efficient tensor representations with ring-structured networks. IEEE, pp 8608\u20138612. ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","key":"3346_CR10","DOI":"10.1109\/ICASSP.2019.8682231"},{"doi-asserted-by":"crossref","unstructured":"Yuan L, Li C, Mandic D, Cao J, Zhao Q (2019) Tensor ring decomposition with rank minimization on latent space: An efficient approach for tensor completion, vol 33. Proceedings of the AAAI Conference on Artificial Intelligence, pp 9151\u20139158","key":"3346_CR11","DOI":"10.1609\/aaai.v33i01.33019151"},{"issue":"2","key":"3346_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10489-010-0220-9","volume":"35","author":"W Peng","year":"2011","unstructured":"Peng W, Li T (2011) On the equivalence between nonnegative tensor factorization and tensorial probabilistic latent semantic analysis. Appl Intell 35(2):285\u2013295","journal-title":"Appl Intell"},{"doi-asserted-by":"crossref","unstructured":"Zhang T, Zhao J, Sun Q, Zhang B, Chen J, Gong M (2021) Low-rank tensor completion via combined tucker and tensor train for color image recovery. Appl Intell:1\u201316","key":"3346_CR13","DOI":"10.1007\/s10489-021-02833-1"},{"issue":"3","key":"3346_CR14","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MSP.2014.2298891","volume":"31","author":"G Zhou","year":"2014","unstructured":"Zhou G, Cichocki A, Zhao Q, Xie S (2014) Nonnegative matrix and tensor factorizations: An algorithmic perspective. IEEE Signal Proc Mag 31(3):54\u201365","journal-title":"IEEE Signal Proc Mag"},{"unstructured":"Yu Y, Zhou G, Zheng N, Xie S, Zhao Q (2020) Graph regularized nonnegative tensor ring decomposition for multiway representation learning. arXiv:http:\/\/arxiv.org\/abs\/2010.05657","key":"3346_CR15"},{"issue":"7","key":"3346_CR16","doi-asserted-by":"publisher","first-page":"3262","DOI":"10.1109\/TIP.2012.2190083","volume":"21","author":"J Yu","year":"2012","unstructured":"Yu J, Tao D, Wang M (2012) Adaptive hypergraph learning and its application in image classification. IEEE Trans Image Process 21(7):3262\u20133272","journal-title":"IEEE Trans Image Process"},{"doi-asserted-by":"crossref","unstructured":"Bretto A (2013) Hypergraph theory. An introduction. Mathematical Engineering. Springer, Cham","key":"3346_CR17","DOI":"10.1007\/978-3-319-00080-0"},{"key":"3346_CR18","first-page":"1601","volume":"19","author":"D Zhou","year":"2006","unstructured":"Zhou D, Huang J, Sch\u00f6lkopf B (2006) Learning with hypergraphs: Clustering, classification, and embedding. Adv Neural Inf Process Syst 19:1601\u20131608","journal-title":"Adv Neural Inf Process Syst"},{"key":"3346_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.neucom.2014.01.043","volume":"138","author":"K Zeng","year":"2014","unstructured":"Zeng K, Yu J, Li C, You J, Jin T (2014) Image clustering by hyper-graph regularized non-negative matrix factorization. Neurocomputing 138:209\u2013217","journal-title":"Neurocomputing"},{"key":"3346_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.ins.2018.01.008","volume":"435","author":"W Wu","year":"2018","unstructured":"Wu W, Kwong S, Zhou Y, Jia Y, Gao W (2018) Nonnegative matrix factorization with mixed hypergraph regularization for community detection. Inf Sci 435:263\u2013281","journal-title":"Inf Sci"},{"issue":"5500","key":"3346_CR21","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum J B, De Silva V, Langford J C (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319\u20132323","journal-title":"Science"},{"issue":"1","key":"3346_CR22","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.acha.2010.02.003","volume":"30","author":"P-G Martinsson","year":"2011","unstructured":"Martinsson P-G, Rokhlin V, Tygert M (2011) A randomized algorithm for the decomposition of matrices. Appl Comput Harmon Anal 30(1):47\u201368","journal-title":"Appl Comput Harmon Anal"},{"issue":"6","key":"3346_CR23","doi-asserted-by":"publisher","first-page":"2928","DOI":"10.1109\/TSP.2012.2190410","volume":"60","author":"G Zhou","year":"2012","unstructured":"Zhou G, Cichocki A, Xie S (2012) Fast nonnegative matrix\/tensor factorization based on low-rank approximation. IEEE Trans Signal Process 60(6):2928\u20132940","journal-title":"IEEE Trans Signal Process"},{"issue":"12","key":"3346_CR24","doi-asserted-by":"publisher","first-page":"4990","DOI":"10.1109\/TIP.2015.2478396","volume":"24","author":"G Zhou","year":"2015","unstructured":"Zhou G, Cichocki A, Zhao Q, Xie S (2015) Efficient nonnegative tucker decompositions: Algorithms and uniqueness. IEEE Trans Image Process 24(12):4990\u20135003","journal-title":"IEEE Trans Image Process"},{"issue":"3","key":"3346_CR25","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda T G, Bader B W (2009) Tensor decompositions and applications. SIAM Rev 51 (3):455\u2013500","journal-title":"SIAM Rev"},{"unstructured":"Zhao Q, Zhou G, Xie S, Zhang L, Cichocki A (2016) Tensor ring decomposition. arXiv:http:\/\/arxiv.org\/abs\/1606.05535","key":"3346_CR26"},{"issue":"2","key":"3346_CR27","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TGRS.2019.2946050","volume":"58","author":"Y Chen","year":"2019","unstructured":"Chen Y, He W, Yokoya N, Huang T-Z, Zhao X-L (2019) Nonlocal tensor-ring decomposition for hyperspectral image denoising. IEEE Trans Geosci Remote Sens 58(2):1348\u20131362","journal-title":"IEEE Trans Geosci Remote Sens"},{"issue":"5","key":"3346_CR28","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets I V (2011) Tensor-train decomposition. SIAM J Sci Comput 33(5):2295\u20132317","journal-title":"SIAM J Sci Comput"},{"issue":"11","key":"3346_CR29","doi-asserted-by":"publisher","first-page":"8998","DOI":"10.1109\/TGRS.2019.2924017","volume":"57","author":"W He","year":"2019","unstructured":"He W, Yokoya N, Yuan L, Zhao Q (2019) Remote sensing image reconstruction using tensor ring completion and total variation. IEEE Trans Geosci Remote Sens 57(11):8998\u20139009","journal-title":"IEEE Trans Geosci Remote Sens"},{"doi-asserted-by":"crossref","unstructured":"Yu J, Zhou G, Sun W, Xie S (2021) Robust to rank selection: Low-rank sparse tensor-ring completion. IEEE Transactions on Neural Networks and Learning Systems","key":"3346_CR30","DOI":"10.1109\/TNNLS.2021.3106654"},{"doi-asserted-by":"crossref","unstructured":"Yu J, Zhou G, Li C, Zhao Q, Xie S (2020) Low tensor-ring rank completion by parallel matrix factorization. IEEE Transactions on Neural Networks and Learning Systems","key":"3346_CR31","DOI":"10.1109\/TNNLS.2020.3009210"},{"issue":"11","key":"3346_CR32","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1109\/TNNLS.2019.2957527","volume":"31","author":"Y Xu","year":"2020","unstructured":"Xu Y, Wu Z, Chanussot J, Wei Z (2020) Hyperspectral images super-resolution via learning high-order coupled tensor ring representation. IEEE Trans Neural Netw Learn Syst 31(11):4747\u20134760","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3346_CR33","doi-asserted-by":"publisher","first-page":"108280","DOI":"10.1016\/j.patcog.2021.108280","volume":"122","author":"W He","year":"2022","unstructured":"He W, Chen Y, Yokoya N, Li C, Zhao Q (2022) Hyperspectral super-resolution via coupled tensor ring factorization. Pattern Recogn 122:108280","journal-title":"Pattern Recogn"},{"doi-asserted-by":"crossref","unstructured":"Pan Y, Xu J, Wang M, Ye J, Wang F, Bai K, Xu Z (2019) Compressing recurrent neural networks with tensor ring for action recognition, vol 33. Proceedings of the AAAI Conference on Artificial Intelligence, pp 4683\u20134690","key":"3346_CR34","DOI":"10.1609\/aaai.v33i01.33014683"},{"key":"3346_CR35","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.neucom.2013.02.017","volume":"118","author":"C Hong","year":"2013","unstructured":"Hong C, Yu J, Li J, Chen X (2013) Multi-view hypergraph learning by patch alignment framework. Neurocomputing 118:79\u201386","journal-title":"Neurocomputing"},{"key":"3346_CR36","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.neucom.2013.05.032","volume":"121","author":"C Wang","year":"2013","unstructured":"Wang C, Yu J, Tao D (2013) High-level attributes modeling for indoor scenes classification. Neurocomputing 121:337\u2013343","journal-title":"Neurocomputing"},{"issue":"6","key":"3346_CR37","doi-asserted-by":"publisher","first-page":"1266","DOI":"10.1109\/TPAMI.2011.25","volume":"33","author":"Y Huang","year":"2011","unstructured":"Huang Y, Liu Q, Lv F, Gong Y, Metaxas D N (2011) Unsupervised image categorization by hypergraph partition. IEEE Trans Pattern Anal Mach Intell 33(6):1266\u20131273","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"21","key":"3346_CR38","doi-asserted-by":"publisher","first-page":"2831","DOI":"10.1093\/bioinformatics\/btp467","volume":"25","author":"Z Tian","year":"2009","unstructured":"Tian Z, Hwang T, Kuang R (2009) A hypergraph-based learning algorithm for classifying gene expression and arraycgh data with prior knowledge. Bioinformatics 25(21):2831\u20132838","journal-title":"Bioinformatics"},{"issue":"6","key":"3346_CR39","doi-asserted-by":"publisher","first-page":"2755","DOI":"10.1109\/TIP.2018.2889960","volume":"28","author":"T Jin","year":"2018","unstructured":"Jin T, Ji R, Gao Y, Sun X, Zhao X, Tao D (2018) Correntropy-induced robust low-rank hypergraph. IEEE Trans Image Process 28(6):2755\u20132769","journal-title":"IEEE Trans Image Process"},{"doi-asserted-by":"crossref","unstructured":"Gao Y, Zhang Z, Lin H, Zhao X, Du S, Zou C (2020) Hypergraph learning: Methods and practices. IEEE Transactions on Pattern Analysis and Machine Intelligence","key":"3346_CR40","DOI":"10.1109\/TPAMI.2020.3039374"},{"key":"3346_CR41","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.patrec.2017.11.017","volume":"102","author":"S Huang","year":"2018","unstructured":"Huang S, Wang H, Ge Y, Huangfu L, Zhang X, Yang D (2018) Improved hypergraph regularized nonnegative matrix factorization with sparse representation. Pattern Recogn Lett 102:8\u201314","journal-title":"Pattern Recogn Lett"},{"issue":"1","key":"3346_CR42","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S0097539704442696","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas P, Kannan R, Mahoney M W (2006) Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix. SIAM J Comput 36(1):158\u2013183","journal-title":"SIAM J Comput"},{"issue":"2","key":"3346_CR43","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko N, Martinsson P-G, Tropp J A (2011) Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev 53(2):217\u2013288","journal-title":"SIAM Rev"},{"issue":"2","key":"3346_CR44","first-page":"123","volume":"3","author":"MW Mahoney","year":"2010","unstructured":"Mahoney M W (2010) Randomized algorithms for matrices and data. Mach Learn 3(2):123\u2013224","journal-title":"Mach Learn"},{"issue":"3","key":"3346_CR45","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.laa.2010.03.020","volume":"433","author":"CF Caiafa","year":"2010","unstructured":"Caiafa C F, Cichocki A (2010) Generalizing the column\u2013row matrix decomposition to multi-way arrays. Linear Algebra Appl 433(3):557\u2013573","journal-title":"Linear Algebra Appl"},{"unstructured":"Vannieuwenhoven N, Vandebril R, Meerbergen K (2011) On the truncated multilinear singular value decomposition. Numerical Analysis and Applied Mathematics Section","key":"3346_CR46"},{"doi-asserted-by":"crossref","unstructured":"Qiu Y, Zhou G, Wang Y, Zhang Y, Xie S (2020) A generalized graph regularized non-negative tucker decomposition framework for tensor data representation. IEEE Transactions on Cybernetics","key":"3346_CR47","DOI":"10.1109\/ICASSP.2019.8683766"},{"doi-asserted-by":"crossref","unstructured":"Sofuoglu S E, Aviyente S (2020) Graph regularized tensor train decomposition. IEEE, pp 3912\u20133916. ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","key":"3346_CR48","DOI":"10.1109\/ICASSP40776.2020.9054032"},{"doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Fdez I, Canosa A, Mucientes M, Bugar\u00edn A (2015) STAC: a web platform for the comparison of algorithms using statistical tests. Proceedings of the 2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","key":"3346_CR49","DOI":"10.1109\/FUZZ-IEEE.2015.7337889"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03346-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03346-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03346-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T10:31:16Z","timestamp":1668853876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03346-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,4]]},"references-count":49,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["3346"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03346-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2022,4,4]]},"assertion":[{"value":"7 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}