{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T17:32:24Z","timestamp":1779903144860,"version":"3.53.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:00:00Z","timestamp":1643414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:00:00Z","timestamp":1643414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004735","name":"natural science foundation of hunan province","doi-asserted-by":"publisher","award":["2019JJ40323"],"award-info":[{"award-number":["2019JJ40323"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s40314-022-01757-x","type":"journal-article","created":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T18:02:36Z","timestamp":1643479356000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Data clustering based on the modified relaxation Cheeger cut model"],"prefix":"10.1007","volume":"41","author":[{"given":"Yu-Fei","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haojie","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,29]]},"reference":[{"key":"1757_CR1","doi-asserted-by":"crossref","unstructured":"Barrett R, Berry M, Chan T et al (1994) Templates for the solution of linear systems: building blocks for iterative methods. SIAM, pp 12\u201314","DOI":"10.1137\/1.9781611971538"},{"key":"1757_CR2","unstructured":"Blake C, Merz C (2021) UCI repository of machine learning databases. University of California. http:\/\/archive.ics.uci.edu\/ml\/datasets.php. Accessed 2021"},{"issue":"1","key":"1757_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10851-013-0452-5","volume":"49","author":"X Bresson","year":"2014","unstructured":"Bresson X, Tai X, Chan T, Szlam A (2014) Multi-class transductive learning based on $$\\ell ^1$$ relaxations of Cheeger cut and Mumford\u2013Shah\u2013Potts model. J Math Imaging Vis 49(1):191\u2013201","journal-title":"J Math Imaging Vis"},{"key":"1757_CR4","doi-asserted-by":"crossref","unstructured":"Buehler T, Hein M (2009) Spectral clustering based on the graph p-Laplacian. In: Proceedings of the 26th international conference on machine learning, pp 81\u201388","DOI":"10.1145\/1553374.1553385"},{"key":"1757_CR5","unstructured":"Cai D (2021) Codes and datasets for feature learning-popular data sets. http:\/\/www.cad.zju.edu.cn\/home\/dengcai\/Data\/data.html. Accessed 2021"},{"issue":"11","key":"1757_CR6","doi-asserted-by":"publisher","first-page":"1963","DOI":"10.1007\/s11425-017-9096-6","volume":"60","author":"K Chang","year":"2017","unstructured":"Chang K, Shao S, Zhang D (2017) Cheeger\u2019s cut, maxcut and the spectral theory of 1-Laplacian on graphs. Sci China Math 60(11):1963\u20131980","journal-title":"Sci China Math"},{"key":"1757_CR7","doi-asserted-by":"crossref","unstructured":"Cheeger J (1969) A lower bound for the smallest eigenvalue of the Laplacian. In: Proceedings of the Princeton conference in honor of Professor S. Bochner, pp 195\u2013199","DOI":"10.1515\/9781400869312-013"},{"key":"1757_CR8","doi-asserted-by":"crossref","unstructured":"Chung F (1997) Spectral graph theory. America Mathematics Society","DOI":"10.1090\/cbms\/092"},{"issue":"2","key":"1757_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1147\/rd.112.0215","volume":"11","author":"R Courant","year":"1967","unstructured":"Courant R, Friedrichs K, Lewy H (1967) On the partial difference equations of mathematical physics. IBM J Res Dev 11(2):215\u2013234","journal-title":"IBM J Res Dev"},{"issue":"1\u20133","key":"1757_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01582887","volume":"52","author":"J Crouzeix","year":"1991","unstructured":"Crouzeix J, Ferland J (1991) Algorithms for generalized fractional programming. Math Programm 52(1\u20133):191\u2013207","journal-title":"Math Programm"},{"issue":"7","key":"1757_CR11","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W Dinkelbach","year":"1967","unstructured":"Dinkelbach W (1967) On nonlinear fractional programming. Manag Sci 13(7):492\u2013498","journal-title":"Manag Sci"},{"issue":"5","key":"1757_CR12","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W Donath","year":"1973","unstructured":"Donath W, Hoffman A (1973) Lower bounds for the partitioning of graphs. IBM J Res Dev 17(5):420\u2013425","journal-title":"IBM J Res Dev"},{"issue":"6","key":"1757_CR13","doi-asserted-by":"publisher","first-page":"064003","DOI":"10.1088\/1361-6420\/ab0cb2","volume":"35","author":"T Feld","year":"2019","unstructured":"Feld T, Aujol J, Gilboa G, Papadakis N (2019) Rayleigh quotient minimization for absolutely one-homogeneous functionals. Inverse Probl 35(6):064003","journal-title":"Inverse Probl"},{"key":"1757_CR14","volume-title":"Splitting methods in communication. Science, and engineering","author":"R Glowinski","year":"2017","unstructured":"Glowinski R, Osher S, Yin W (2017) Splitting methods in communication. Science, and engineering. Springer, Berlin"},{"issue":"1","key":"1757_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"J Gotoh","year":"2018","unstructured":"Gotoh J, Takeda A, Tono K (2018) DC formulations and algorithms for sparse optimization problems. Math Programm B 169(1):141\u2013176","journal-title":"Math Programm B"},{"key":"1757_CR16","doi-asserted-by":"crossref","unstructured":"Hagen L, Kahng A (1991) Fast spectral methods for ratio cut partitioning and clustering. In: IEEE international conference on computer-aided design, pp 10\u201313","DOI":"10.1109\/ICCAD.1991.185177"},{"issue":"9","key":"1757_CR17","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"},{"issue":"4","key":"1757_CR18","first-page":"119","volume":"1","author":"M Halkidi","year":"2007","unstructured":"Halkidi M, Gunopulos D, Vazirgiannis M, Kumar N, Domeniconi C (2007) A clustering framework based on subjective and objective validity criteria. J ACM Trans Knowl Discov Data 1(4):119\u2013143","journal-title":"J ACM Trans Knowl Discov Data"},{"issue":"1","key":"1757_CR19","first-page":"100","volume":"28","author":"J Hartigan","year":"1979","unstructured":"Hartigan J, Wong M (1979) A K-means clustering algorithm. J R Stat Soc 28(1):100\u2013108","journal-title":"J R Stat Soc"},{"key":"1757_CR20","unstructured":"Hein M, Buehler T (2010) An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse PCA. In: Advances in neural information processing systems, pp 847\u2013855"},{"key":"1757_CR21","first-page":"2366","volume":"24","author":"M Hein","year":"2011","unstructured":"Hein M, Setzer S (2011) Beyond spectral clustering-tight relaxations of balanced graph cuts. Adv Neural Inf Process Syst 24:2366\u20132374","journal-title":"Adv Neural Inf Process Syst"},{"issue":"6","key":"1757_CR22","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/TKDE.2019.2903410","volume":"32","author":"D Huang","year":"2020","unstructured":"Huang D, Wang C, Wu J, Lai J, Kwoh C (2020) Ultra-scalable spectral clustering and ensemble clustering. IEEE Trans Knowl Data Eng 32(6):1212\u20131226","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"154","key":"1757_CR23","first-page":"1","volume":"20","author":"K Khamaru","year":"2019","unstructured":"Khamaru K, Wainwright M (2019) Convergence guarantees for a class of non-convex and non-smooth optimization problems. J Mach Learn Res 20(154):1\u201352","journal-title":"J Mach Learn Res"},{"key":"1757_CR24","doi-asserted-by":"crossref","unstructured":"Kolev K, Cremers D (2009) Continuous ratio optimization via convex relaxation with applications to multiview 3D reconstruction. In: IEEE conference on computer vision and pattern recognition (CVPR), pp 1858\u20131864","DOI":"10.1109\/CVPR.2009.5206608"},{"key":"1757_CR25","doi-asserted-by":"crossref","unstructured":"Lellmann J, Strekalovskiy E, Koetter S, Cremers D (2013) Total variation regularization for functions with values in a manifold. In: IIEEE international conference on computer vision, pp 2944\u20132951","DOI":"10.1109\/ICCV.2013.366"},{"issue":"2","key":"1757_CR26","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1109\/JAS.2019.1911417","volume":"6","author":"C Leng","year":"2019","unstructured":"Leng C, Zhang H, Cai G, Cheng I, Basu A (2019) Graph regularized $$L_p$$ smooth non-negative matrix factorization for data representation. IEEE\/CAA J Autom Sin 6(2):584\u2013595","journal-title":"IEEE\/CAA J Autom Sin"},{"issue":"4","key":"1757_CR27","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg","year":"2007","unstructured":"Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"key":"1757_CR28","first-page":"1601","volume":"2","author":"L Manor","year":"2004","unstructured":"Manor L, Perona P (2004) Self-tuning spectral clustering. Adv Neural Inf Process Syst 2:1601\u20131608","journal-title":"Adv Neural Inf Process Syst"},{"issue":"7","key":"1757_CR29","doi-asserted-by":"publisher","first-page":"074003","DOI":"10.1088\/1361-6420\/33\/7\/074003","volume":"33","author":"E Merkurjev","year":"2017","unstructured":"Merkurjev E, Bertozzi A, Yan X, Lerman K (2017) Modified Cheeger and ratio cut methods using the Ginzburg\u2013Landau functional for classification of high-dimensional data. Inverse Probl 33(7):074003","journal-title":"Inverse Probl"},{"key":"1757_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-97864-2","volume-title":"Clustering methods for big data analytics: techniques, toolboxes and applications","author":"O Nasraoui","year":"2019","unstructured":"Nasraoui O, Benncir C (2019) Clustering methods for big data analytics: techniques, toolboxes and applications. Springer, Berlin"},{"issue":"6","key":"1757_CR31","doi-asserted-by":"publisher","first-page":"A3649","DOI":"10.1137\/18M123147X","volume":"41","author":"Y Rahimi","year":"2019","unstructured":"Rahimi Y, Wang C, Dong H, Lou Y (2019) A scale-invariant approach for sparse signal recovery. SIAM J Sci Comput 41(6):A3649\u2013A3672","journal-title":"SIAM J Sci Comput"},{"issue":"8","key":"1757_CR32","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"1757_CR33","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/TIT.2016.2632162","volume":"63","author":"J Sun","year":"2017","unstructured":"Sun J, Qu Q, Wright J (2017) Complete dictionary recovery over the sphere I: overview and the geometric picture. IEEE Trans Inf Theory 63(2):853\u2013884","journal-title":"IEEE Trans Inf Theory"},{"key":"1757_CR34","unstructured":"Szlam A, Bresson X (2010) Total variation and Cheeger cuts. In: Proceedings of the 27th international conference on machine learning, pp 1039\u20131046"},{"key":"1757_CR35","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"H Thi","year":"2018","unstructured":"Thi H, Dinh T (2018) DC programming and DCA: thirty years of developments. Math Programm B 169:5\u201368","journal-title":"Math Programm B"},{"key":"1757_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-69308-8","volume-title":"Modern algorithms of cluster analysis","author":"S Wierzchon","year":"2018","unstructured":"Wierzchon S, Klopotek M (2018) Modern algorithms of cluster analysis. Springer, Berlin"},{"issue":"4","key":"1757_CR37","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"A Yuille","year":"2003","unstructured":"Yuille A, Rangarajan A (2003) The concave-convex procedure. Neural Comput 15(4):915\u2013936","journal-title":"Neural Comput"},{"key":"1757_CR38","first-page":"730","volume":"765\u2013767","author":"YZ Zhang","year":"2013","unstructured":"Zhang YZ, Jiang Y, Pang ZF (2013) Cheeger cut model for the balanced data classification problem. Adv Mater Res 765\u2013767:730\u2013734","journal-title":"Adv Mater Res"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01757-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-022-01757-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01757-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T10:41:37Z","timestamp":1644489697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-022-01757-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,29]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1757"],"URL":"https:\/\/doi.org\/10.1007\/s40314-022-01757-x","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,29]]},"assertion":[{"value":"27 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"61"}}