Partitional clustering via nonsmooth optimization. Clustering via optimization
From MaRDI portal
Publication:2212545
DOI10.1007/978-3-030-37826-4zbMath1448.68001WikidataQ109595545 ScholiaQ109595545MaRDI QIDQ2212545
Sona Taheri, Napsu Karmitsa, Adil M. Bagirov
Publication date: 23 November 2020
Published in: Unsupervised and Semi-Supervised Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-37826-4
62H30: Classification and discrimination; cluster analysis (statistical aspects)
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
90C90: Applications of mathematical programming
68T05: Learning and adaptive systems in artificial intelligence
68T09: Computational aspects of data analysis and big data
Related Items
Applications of monitoring and tracing the evolution of clustering solutions in dynamic datasets, Partitional clustering via successive transportation problems, A novel optimization approach towards improving separability of clusters, A new restricted memory level bundle method for constrained convex nonsmooth optimization