{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:08:24Z","timestamp":1777637304058,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,5,20]],"date-time":"2017-05-20T00:00:00Z","timestamp":1495238400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s11590-017-1152-7","type":"journal-article","created":{"date-parts":[[2017,5,20]],"date-time":"2017-05-20T02:34:49Z","timestamp":1495247689000},"page":"1527-1546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Data filtering for cluster analysis by $$\\ell _0$$ \u2113 0 -norm regularization"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9126-3994","authenticated-orcid":false,"given":"Andrea","family":"Cristofari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,20]]},"reference":[{"key":"1152_CR1","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"1999","unstructured":"Bertsekas, D.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"1152_CR2","first-page":"82","volume":"98","author":"P Bradley","year":"1998","unstructured":"Bradley, P., Mangasarian, O.: Feature selection via concave minimization and support vector machines. ICML 98, 82\u201390 (1998)","journal-title":"ICML"},{"key":"1152_CR3","unstructured":"Chi, E., Lange, K.: Splitting methods for convex clustering. J. Comput. Gr. Stat. 24(4), 994\u20131013 (2014)"},{"key":"1152_CR4","doi-asserted-by":"crossref","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B (methodological) 39(1) 1\u201338 (1977)","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"1152_CR5","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Guan, Y., Kulis, B.: Kernel k-means, spectral clustering and normalized cuts. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 551\u2013556 (2004)","DOI":"10.1145\/1014052.1014118"},{"issue":"456","key":"1152_CR6","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"1152_CR7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s11590-009-0132-y","volume":"3","author":"G Fasano","year":"2009","unstructured":"Fasano, G., Lucidi, S.: A nonmonotone truncated Newton\u2013Krylov method exploiting negative curvature directions, for large scale unconstrained optimization. Optim. Lett. 3(4), 521\u2013535 (2009)","journal-title":"Optim. Lett."},{"key":"1152_CR8","doi-asserted-by":"crossref","unstructured":"Gan, G., Ma, C., Wu, J.: Data clustering: theory, algorithms, and applications, vol.\u00a020. SIAM, Philadelphia (2007)","DOI":"10.1137\/1.9780898718348"},{"key":"1152_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., David, Johnson S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Free Co, San Fr (1979)"},{"issue":"3","key":"1152_CR10","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1109\/TNN.2002.1000150","volume":"13","author":"M Girolami","year":"2002","unstructured":"Girolami, M.: Mercer kernel-based clustering in feature space. Neural Netw. IEEE Trans. Neural Netw. 13(3), 780\u2013784 (2002)","journal-title":"Neural Netw. IEEE Trans. Neural Netw."},{"key":"1152_CR11","unstructured":"Hocking, T., Joulin, A., Bach, F., Vert, J.P.: Clusterpath an algorithm for clustering using convex fusion penalties. In: 28th International Conference on Machine Learning (2011)"},{"issue":"1","key":"1152_CR12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985)","journal-title":"J. Classif."},{"key":"1152_CR13","unstructured":"Lichman, M.: UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml (2013)"},{"key":"1152_CR14","doi-asserted-by":"crossref","unstructured":"Lindsten, F., Ohlsson, H., Ljung, L.: Clustering using sum-of-norms regularization: with application to particle filter output computation. In: Statistical Signal Processing Workshop (SSP), 2011 IEEE, pp. 201\u2013204 (2011)","DOI":"10.1109\/SSP.2011.5967659"},{"key":"1152_CR15","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA, vol. 1, pp. 281\u2013297 (1967)"},{"key":"1152_CR16","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.: Machine learning via polyhedral concave minimization. In: Applied Mathematics and Parallel Computing, pp 175\u2013188 (1996)","DOI":"10.1007\/978-3-642-99789-1_13"},{"key":"1152_CR17","unstructured":"Mangasarian, O., Setiono, R., Wolberg, W.: Pattern recognition via linear programming: theory and application to medical diagnosis. In: Coleman, T.F., Li,Y. (eds.) Large-scale Numer. Optim. pp. 22\u201331. SIAM, Philadelphia, PA (1990)"},{"issue":"1","key":"1152_CR18","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1214\/14-EJS934","volume":"8","author":"Y Marchetti","year":"2014","unstructured":"Marchetti, Y., Zhou, Q.: Solution path clustering with adaptive concave penalty. Electron. J. Stat. 8(1), 1569\u20131603 (2014)","journal-title":"Electron. J. Stat."},{"key":"1152_CR19","volume-title":"Finite Mixture Models","author":"G McLachlan","year":"2004","unstructured":"McLachlan, G., Peel, D.: Finite Mixture Models. Wiley, New York (2004)"},{"issue":"1","key":"1152_CR20","first-page":"1865","volume":"14","author":"W Pan","year":"2013","unstructured":"Pan, W., Shen, X., Liu, B.: Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty. J. Mach. Learn. Res. 14(1), 1865\u20131889 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"1152_CR21","unstructured":"Pelckmans, K., De\u00a0Brabanter, J., Suykens, J., De\u00a0Moor, B.: Convex clustering shrinkage. In: PASCAL Workshop on Statistics and Optimization of Clustering Workshop (2005)"},{"issue":"3","key":"1152_CR22","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10589-008-9202-9","volume":"46","author":"F Rinaldi","year":"2010","unstructured":"Rinaldi, F., Schoen, F., Sciandrone, M.: Concave programming for minimizing the zero-norm over polyhedral sets. Comput. Optim. Appl. 46(3), 467\u2013486 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"1152_CR23","volume-title":"Variational Analysis","author":"R Rockafellar","year":"2009","unstructured":"Rockafellar, R., Wets, R.: Variational Analysis, 317th edn. Springer, New York (2009)","edition":"317"},{"key":"1152_CR24","volume-title":"Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., Smola, A.J.: Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge (2002)"},{"key":"1152_CR25","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf, B., Smola, A., M\u00fcller, K.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput. 10, 1299\u20131319 (1998)","journal-title":"Neural Comput."},{"issue":"497","key":"1152_CR26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1080\/01621459.2011.645783","volume":"107","author":"X Shen","year":"2012","unstructured":"Shen, X., Pan, W., Zhu, Y.: Likelihood-based selection and sharp parameter estimation. J. Am. Stat. Assoc. 107(497), 223\u2013232 (2012)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"1152_CR27","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1111\/1467-9868.00293","volume":"63","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani, R., Walther, G., Hastie, T.: Estimating the number of clusters in a data set via the gap statistic. J. R. Stat. Soc. Ser. B (Statistical Methodology) 63(2), 411\u2013423 (2001)","journal-title":"J. R. Stat. Soc. Ser. B (Statistical Methodology)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1152-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1152-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1152-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T17:59:03Z","timestamp":1569347943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1152-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,20]]},"references-count":27,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["1152"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1152-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,20]]}}}