{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T17:40:34Z","timestamp":1660239634686},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":["Neural Process Lett"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s11063-020-10405-6","type":"journal-article","created":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T15:02:35Z","timestamp":1609513355000},"page":"2533-2548","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-Adaptive Clustering of Dynamic Multi-Graph Learning"],"prefix":"10.1007","volume":"54","author":[{"given":"Bo","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangding","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xincheng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaye","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,1]]},"reference":[{"issue":"6","key":"10405_CR1","first-page":"585","volume":"14","author":"M Belkin","year":"2002","unstructured":"Belkin M, Niyogi P (2002) Laplacian eigenmaps and spectral techniques for embedding and clustering. Adv Neural Inf Process Syst 14(6):585\u2013591","journal-title":"Adv Neural Inf Process Syst"},{"key":"10405_CR2","doi-asserted-by":"crossref","unstructured":"Cahill ND, Hayes TL, Meinhold RT, Hamilton JF (2018) Compassionately conservative balanced cuts for image segmentation. In: 2018 IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp 1683\u20131691. https:\/\/doi.org\/10.1109\/CVPR.2018.00181","DOI":"10.1109\/CVPR.2018.00181"},{"issue":"1","key":"10405_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10957-018-1319-0","volume":"179","author":"M Castellani","year":"2018","unstructured":"Castellani M, Giuli M, Pappalardo M (2018) A ky fan minimax inequality for quasiequilibria on finite-dimensional spaces. J Optim Theory Appl 179(1):53\u201364","journal-title":"J Optim Theory Appl"},{"key":"10405_CR4","doi-asserted-by":"crossref","unstructured":"Feng J, Lin Z, Xu H, Yan S (2014) Robust subspace segmentation with block-diagonal prior. In: IEEE Conference on Computer Vision & Pattern Recognition, pp 3818\u20133825","DOI":"10.1109\/CVPR.2014.482"},{"issue":"8","key":"10405_CR5","first-page":"888","volume":"22","author":"G Froyland","year":"2015","unstructured":"Froyland G, Padberg-Gehle K (2015) Normalized cuts and image segmentation. Chaos Interdisciplin J Nonlinear Sci 22(8):888\u2013905","journal-title":"Chaos Interdisciplin J Nonlinear Sci"},{"key":"10405_CR6","doi-asserted-by":"publisher","unstructured":"Guo Y, Wu Z, Shen D (2019) Learning longitudinal classification-regression model for infant hippocampus segmentation. Neurocomputing. https:\/\/doi.org\/10.1016\/j.neucom.2019.01.108","DOI":"10.1016\/j.neucom.2019.01.108"},{"issue":"9","key":"10405_CR7","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L Hagen","year":"1992","unstructured":"Hagen L, Kahng A (1992) New spectral methods for ratio cut partitioning and clustering. IEEE Trans Comput Aided Des Integr Circuits Syst 11(9):1074\u20131085","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"10405_CR8","doi-asserted-by":"crossref","unstructured":"Hamerly G, Elkan C (2002) Alternatives to the k-means algorithm that find better clusterings. In: Eleventh International Conference on Information & Knowledge Management, pp 600\u2013607","DOI":"10.1145\/584792.584890"},{"key":"10405_CR9","doi-asserted-by":"publisher","unstructured":"Hao S, Zhou Y, Guo Y (2020) A brief survey on semantic segmentation with deep learning. Neurocomputing. https:\/\/doi.org\/10.1016\/j.neucom.2019.11.118","DOI":"10.1016\/j.neucom.2019.11.118"},{"key":"10405_CR10","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1007\/s11280-019-00766-x","volume":"23","author":"R Hu","year":"2020","unstructured":"Hu R, Zhu X, Zhu Y, Gan J (2020) Robust svm with adaptive graph learning. World Wide Web 23:1945\u20131968","journal-title":"World Wide Web"},{"issue":"8","key":"10405_CR11","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond k-means. Pattern Recognit Lett 31(8):651\u2013666","journal-title":"Pattern Recognit Lett"},{"issue":"1","key":"10405_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/34.824819","volume":"22","author":"AK Jain","year":"2000","unstructured":"Jain AK, Duin RPW, Mao J (2000) Statistical pattern recognition: a review. IEEE Trans Pattern Anal Mach Intell 22(1):4\u201337","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"10405_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264\u2013323","journal-title":"ACM Comput Surv"},{"key":"10405_CR14","unstructured":"Jin H, Nie F, Huang H (2015) A new simplex sparse learning model to measure data similarity for clustering. In: International Conference on Artificial Intelligence, pp 3569\u20133575"},{"issue":"8","key":"10405_CR15","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1109\/34.709614","volume":"20","author":"D Judd","year":"1998","unstructured":"Judd D, Mckinley PK, Jain AK (1998) Large-scale parallel data clustering. IEEE Trans Pattern Anal Mach Intell 20(8):871\u2013876","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"10405_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.neunet.2020.05.030","volume":"129","author":"Z Kang","year":"2020","unstructured":"Kang Z, Lu X, Lu Y, Peng c, Chen W, Xu Z (2020) Structure learning with similarity preserving. Neural Netw 129:138\u2013148","journal-title":"Neural Netw"},{"issue":"5","key":"10405_CR17","doi-asserted-by":"publisher","first-page":"1833","DOI":"10.1109\/TCYB.2018.2887094","volume":"50","author":"Z Kang","year":"2020","unstructured":"Kang Z, Pan H, Hoi SC, Xu Z (2020) Robust graph learning from noisy data. IEEE Trans Cybern 50(5):1833\u20131843","journal-title":"IEEE Trans Cybern"},{"key":"10405_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.neunet.2019.10.010","volume":"122","author":"Z Kang","year":"2020","unstructured":"Kang Z, Zhao X, Shi, Peng c, Zhu H, Zhou JT, Peng X, Chen W Xu Z (2020) Partition level multiview subspace clustering. Neural Netw 12:279\u2013288","journal-title":"Neural Netw"},{"issue":"5","key":"10405_CR19","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1109\/TIP.2010.2040763","volume":"19","author":"S Krinidis","year":"2010","unstructured":"Krinidis S, Chatzis V (2010) A robust fuzzy local information c-means clustering algorithm. IEEE Trans Image Process 19(5):1328\u20131337","journal-title":"IEEE Trans Image Process"},{"issue":"1","key":"10405_CR20","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1198\/tech.2001.s558","volume":"43","author":"Lordo","year":"2001","unstructured":"Lordo Robert A (2001) Learning from dat: concepts, theory, and methods. Technometrics 43(1):105\u2013106","journal-title":"Technometrics"},{"issue":"4","key":"10405_CR21","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"UV Luxburg","year":"2007","unstructured":"Luxburg UV (2007) A tutorial on spectral clustering. Statistic Comput 17(4):395\u2013416","journal-title":"Statistic Comput"},{"issue":"6","key":"10405_CR22","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/79.543975","volume":"13","author":"TK Moon","year":"1996","unstructured":"Moon TK (1996) The expectation-maximization algorithm. IEEE Signal Process Magaz 13(6):47\u201360","journal-title":"IEEE Signal Process Magaz"},{"issue":"1","key":"10405_CR23","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1002\/widm.53","volume":"2","author":"F Murtagh","year":"2012","unstructured":"Murtagh F, Contreras P (2012) Algorithms for hierarchical clustering: an overview. Wiley Interdisciplin Rev Data Mining Knowl Discovery 2(1):86\u201397","journal-title":"Wiley Interdisciplin Rev Data Mining Knowl Discovery"},{"key":"10405_CR24","doi-asserted-by":"crossref","unstructured":"Nie F, Wang X, Huang H (2014) Clustering and projected clustering with adaptive neighbors. In: Acm Sigkdd International Conference on Knowledge Discovery & Data Mining, pp 977\u2013986","DOI":"10.1145\/2623330.2623726"},{"key":"10405_CR25","doi-asserted-by":"crossref","unstructured":"Nie F, Wang X, Jordan MI, Huang H (2016) The constrained laplacian rank algorithm for graph-based clustering, pp 1969\u20131976","DOI":"10.1609\/aaai.v30i1.10302"},{"issue":"6","key":"10405_CR26","doi-asserted-by":"publisher","first-page":"583","DOI":"10.3233\/IDA-2007-11602","volume":"11","author":"MGH Omran","year":"2007","unstructured":"Omran MGH, Engelbrecht AP, Salman A (2007) An overview of clustering methods. Intell Data Anal 11(6):583\u2013605","journal-title":"Intell Data Anal"},{"issue":"3","key":"10405_CR27","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"X Rui","year":"2005","unstructured":"Rui X, Ii DCW (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3):645\u2013678","journal-title":"IEEE Trans Neural Netw"},{"key":"10405_CR28","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.inffus.2020.08.023","volume":"66","author":"HT Shen","year":"2021","unstructured":"Shen HT, Zhu X, Zhang Z, Wang Sh, Chen Y, Xu X, Shao J (2021) Heterogeneous data fusion for predicting mild cognitive impairment conversion. Inform Fusion 66:54\u201363. https:\/\/doi.org\/10.1016\/j.inffus.2020.08.023","journal-title":"Inform Fusion"},{"key":"10405_CR29","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3009632","author":"HT Shen","year":"2020","unstructured":"Shen HT, Zhu Y, Zheng W, Zhu X (2020) Half-quadratic minimization for unsupervised feature selection on incomplete data. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2020.3009632","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"6","key":"10405_CR30","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1109\/TPAMI.2003.1201819","volume":"25","author":"W Song","year":"2003","unstructured":"Song W, Siskind JM (2003) Image segmentation with ratio cut\u2014supplemental material. IEEE Trans Pattern Anal Mach Intell 25(6):675\u2013690","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"10405_CR31","doi-asserted-by":"crossref","unstructured":"Spielman DA (2007) Spectral graph theory and its applications, pp. 29\u201338","DOI":"10.1109\/FOCS.2007.56"},{"key":"10405_CR32","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.neunet.2018.08.007","volume":"108","author":"J Wen","year":"2018","unstructured":"Wen J, Fang X, Xu Y, Tian C, Fei L (2018) Low-rank representation with adaptive graph regularization. Neural Netw 108:83\u201396","journal-title":"Neural Netw"},{"key":"10405_CR33","doi-asserted-by":"crossref","unstructured":"Xie J, Ying Z, Ding L (2018) Local standard deviation spectral clustering. In: 2018 IEEE International Conference on Big Data and Smart Computing (BigComp), pp 242\u2013250","DOI":"10.1109\/BigComp.2018.00043"},{"key":"10405_CR34","unstructured":"Zelnikmanor L, Perona P (2004) Self-tuning spectral clustering, pp 1601\u20131608"},{"issue":"3","key":"10405_CR35","first-page":"1","volume":"8","author":"S Zhang","year":"2017","unstructured":"Zhang S, Li X, Zong M, Zhu X, Cheng D (2017) Learning k for knn classification. ACM Trans Intell Syst Technol 8(3):1\u201319","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"1","key":"10405_CR36","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/JSTSP.2019.2957952","volume":"14","author":"Y Zhou","year":"2020","unstructured":"Zhou Y, Tian L, Zhu C, Jin X, Sun Y (2020) Video coding optimization for virtual reality 360-degree source. J Sel Topics Signal Process 14(1):118\u2013129","journal-title":"J Sel Topics Signal Process"},{"key":"10405_CR37","doi-asserted-by":"publisher","first-page":"1969","DOI":"10.1007\/s11280-019-00731-8","volume":"23","author":"X Zhu","year":"2020","unstructured":"Zhu X, Gan J, Lu G, Li J, Zhang S (2020) Spectral clustering via half-quadratic optimization. World Wide Web 23:1969\u20131988","journal-title":"World Wide Web"},{"issue":"9","key":"10405_CR38","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1109\/TMM.2017.2703636","volume":"19","author":"X Zhu","year":"2017","unstructured":"Zhu X, Li X, Zhang S, Xu Z, Yu L, Wang C (2017) Graph pca hashing for similarity search. IEEE Trans Multimedia 19(9):2033\u20132044","journal-title":"IEEE Trans Multimedia"},{"key":"10405_CR39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3017250","author":"X Zhu","year":"2020","unstructured":"Zhu X, Zhang S, Zhu Y, Zhu P, Gao Y (2020) Unsupervised spectral feature selection with dynamic hyper-graph learning. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2020.3017250","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"10405_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.107175","author":"X Zhu","year":"2019","unstructured":"Zhu X, Zhu Y, Zheng W (2019) Spectral rotation for deep one-step clustering. Pattern Recognit. https:\/\/doi.org\/10.1016\/j.patcog.2019.107175","journal-title":"Pattern Recognit"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-020-10405-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-020-10405-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-020-10405-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T17:19:47Z","timestamp":1660238387000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-020-10405-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["10405"],"URL":"https:\/\/doi.org\/10.1007\/s11063-020-10405-6","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"value":"1370-4621","type":"print"},{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]},"assertion":[{"value":"30 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}