{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:00Z","timestamp":1740107820406,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T00:00:00Z","timestamp":1571788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T00:00:00Z","timestamp":1571788800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00500-019-04448-8","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T17:17:49Z","timestamp":1571851069000},"page":"9215-9225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A novel heuristic algorithm to solve penalized regression-based clustering model"],"prefix":"10.1007","volume":"24","author":[{"given":"Shadi","family":"Hasanzadeh Tavakkoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3218-5666","authenticated-orcid":false,"given":"Yahya","family":"Forghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Sheibani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,23]]},"reference":[{"key":"4448_CR1","unstructured":"Arthur D, Vassilvitskii S (2007) K-means\u2009++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 1027\u20131035"},{"key":"4448_CR2","doi-asserted-by":"crossref","unstructured":"Barati M, Jalali M, Forghani YJES (2019) Alternating optimization to solve penalized regression\u2010based clustering model. p e12462","DOI":"10.1111\/exsy.12462"},{"issue":"6","key":"4448_CR3","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","volume":"30","author":"A Bryant","year":"2018","unstructured":"Bryant A, Cios K (2018) RNN-DBSCAN: a density-based clustering algorithm using reverse nearest neighbor density estimates. IEEE Trans Knowl Data Eng 30(6):1109\u20131121","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4448_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.knosys.2016.06.031","volume":"117","author":"M Cap\u00f3","year":"2017","unstructured":"Cap\u00f3 M, P\u00e9rez A, Lozano JA (2017) An efficient approximation to the k-means clustering for massive data. Knowl-Based Syst 117:56\u201369","journal-title":"Knowl-Based Syst"},{"issue":"5","key":"4448_CR5","doi-asserted-by":"publisher","first-page":"e1004228","DOI":"10.1371\/journal.pcbi.1004228","volume":"11","author":"GK Chen","year":"2015","unstructured":"Chen GK, Chi EC, Ranola JMO, Lange K (2015) Convex clustering: an attractive alternative to hierarchical clustering. PLoS Comput Biol 11(5):e1004228","journal-title":"PLoS Comput Biol"},{"issue":"2","key":"4448_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10115-015-0823-x","volume":"46","author":"W Cheng","year":"2016","unstructured":"Cheng W, Zhang X, Pan F, Wang W (2016) HICC: an entropy splitting-based framework for hierarchical co-clustering. Knowl Inf Syst 46(2):343\u2013367","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"4448_CR7","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1080\/10618600.2014.948181","volume":"24","author":"EC Chi","year":"2015","unstructured":"Chi EC, Lange K (2015) Splitting methods for convex clustering. J Comput Graph Stat 24(4):994\u20131013","journal-title":"J Comput Graph Stat"},{"issue":"1","key":"4448_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/s00357-015-9167-1","volume":"32","author":"RC de Amorim","year":"2015","unstructured":"de Amorim RC (2015) Feature relevance in ward\u2019s hierarchical clustering using the L p norm. J Classif 32(1):46\u201362","journal-title":"J Classif"},{"issue":"2","key":"4448_CR9","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman J, Hastie T, H\u00f6fling H, Tibshirani R (2007) Pathwise coordinate optimization. Ann Appl Stat 1(2):302\u2013332","journal-title":"Ann Appl Stat"},{"key":"4448_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.patrec.2017.03.008","volume":"90","author":"G Gan","year":"2017","unstructured":"Gan G, Ng MK-P (2017) K-means clustering with outlier removal. Pattern Recognit Lett 90:8\u201314","journal-title":"Pattern Recognit Lett"},{"key":"4448_CR11","doi-asserted-by":"crossref","unstructured":"Han D, Agrawal A, Liao W-K, Choudhary A (2018) A fast DBSCAN algorithm with spark implementation. In: Big data in engineering applications. Springer, Berlin, pp 173\u2013192","DOI":"10.1007\/978-981-10-8476-8_9"},{"key":"4448_CR12","unstructured":"Hocking TD, Joulin A, Bach F, Vert J-P (2011) Clusterpath an algorithm for clustering using convex fusion penalties. In: 28th international conference on machine learning, p 1"},{"issue":"5","key":"4448_CR13","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1007\/s00500-016-2435-0","volume":"22","author":"D Ienco","year":"2018","unstructured":"Ienco D, Bordogna G (2018) Fuzzy extensions of the DBScan clustering algorithm. Soft Comput 22(5):1719\u20131730","journal-title":"Soft Comput"},{"issue":"3","key":"4448_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"A Le Thi Hoai","year":"1997","unstructured":"Le Thi Hoai A, Tao PD (1997) Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J Glob Optim 11(3):253\u2013285","journal-title":"J Glob Optim"},{"key":"4448_CR15","doi-asserted-by":"crossref","unstructured":"Lindsten F, Ohlsson H, Ljung L (2011) Clustering using sum-of-norms regularization: with application to particle filter output computation. In: Statistical signal processing workshop (SSP), 2011 IEEE, pp 201\u2013204. IEEE","DOI":"10.1109\/SSP.2011.5967659"},{"key":"4448_CR16","unstructured":"MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol. 1, no. 14. Oakland, CA, USA, pp 281\u2013297"},{"issue":"1","key":"4448_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s11222-014-9500-2","volume":"26","author":"G Malsiner-Walli","year":"2016","unstructured":"Malsiner-Walli G, Fr\u00fchwirth-Schnatter S, Gr\u00fcn B (2016) Model-based clustering based on sparse finite Gaussian mixtures. Stat Comput 26(1):303\u2013324","journal-title":"Stat Comput"},{"issue":"1","key":"4448_CR18","first-page":"1865","volume":"14","author":"W Pan","year":"2013","unstructured":"Pan W, Shen X, Liu B (2013) Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty. J Mach Learn Res 14(1):1865\u20131889","journal-title":"J Mach Learn Res"},{"key":"4448_CR19","unstructured":"Panahi A, Dubhashi D, Johansson FD, Bhattacharyya C (2017) Clustering by sum of norms: stochastic incremental algorithm, convergence and cluster recovery. In: International conference on machine learning, pp 2769\u20132777"},{"key":"4448_CR20","unstructured":"Pelckmans K, De Brabanter J, Suykens J, De Moor B (2005) Convex clustering shrinkage. In: PASCAL workshop on statistics and optimization of clustering workshop"},{"issue":"1","key":"4448_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s40595-016-0068-y","volume":"4","author":"T Pham","year":"2017","unstructured":"Pham T, Dang H, Le T, Le TH (2017) Fast support vector clustering. Vietnam J Comput Sci 4(1):13\u201321","journal-title":"Vietnam J Comput Sci"},{"issue":"3","key":"4448_CR22","doi-asserted-by":"publisher","first-page":"569","DOI":"10.3233\/IDA-173371","volume":"22","author":"M Seidpisheh","year":"2018","unstructured":"Seidpisheh M, Mohammadpour A (2018) Hierarchical clustering of heavy-tailed data using a new similarity measure. Intell Data Anal 22(3):569\u2013579","journal-title":"Intell Data Anal"},{"issue":"1","key":"4448_CR23","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1214\/07-AOAS147","volume":"2","author":"TT Wu","year":"2008","unstructured":"Wu TT, Lange K (2008) Coordinate descent algorithms for lasso penalized regression. Ann Appl Stat 2(1):224\u2013244","journal-title":"Ann Appl Stat"},{"issue":"188","key":"4448_CR24","first-page":"1","volume":"17","author":"C Wu","year":"2016","unstructured":"Wu C, Kwon S, Shen X, Pan W (2016) A new algorithm and theory for penalized regression-based clustering. J Mach Learn Res 17(188):1\u201325","journal-title":"J Mach Learn Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04448-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04448-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04448-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T23:24:18Z","timestamp":1603322658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04448-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,23]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4448"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04448-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2019,10,23]]},"assertion":[{"value":"23 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Zohreh Zendehdel declares that she has no conflict of interest. Yahya Forghani declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}