Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Partitional clustering via nonsmooth optimization. Clustering via optimization

From MaRDI portal
Publication:2212545
Jump to:navigation, search

DOI10.1007/978-3-030-37826-4zbMath1448.68001OpenAlexW4230819290WikidataQ109595545 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



Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)


Related Items (4)

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







This page was built for publication: Partitional clustering via nonsmooth optimization. Clustering via optimization

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2212545&oldid=14747173"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 02:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki