國立虎尾科技大學 |

Partitional clustering via nonsmooth optimization = clustering via optimization /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Partitional clustering via nonsmooth optimization/ by Adil Bagirov, Napsu Karmitsa, Sona Taheri.
Reminder of title:	clustering via optimization /
Author:	Bagirov, Adil.
other author:	Karmitsa, Napsu.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xx, 395 p. :ill. (chiefly color), digital ; : 24 cm.;
Contained By:	Springer Nature eBook
Subject:	Nonsmooth optimization. -
Online resource:	https://doi.org/10.1007/978-3-031-76512-4
ISBN:	9783031765124

Partitional clustering via nonsmooth optimization = clustering via optimization /
Bagirov, Adil.

Partitional clustering via nonsmooth optimizationclustering via optimization /[electronic resource] :by Adil Bagirov, Napsu Karmitsa, Sona Taheri. - Second edition. - Cham :Springer Nature Switzerland :2025. - xx, 395 p. :ill. (chiefly color), digital ;24 cm. - Unsupervised and semi-supervised learning,2522-8498. - Unsupervised and semi-supervised learning..

Introduction -- Introduction to Clustering -- Clustering Algorithms -- Nonsmooth Optimization Models in Cluster Analysis -- Nonsmooth Optimization -- Optimization based Clustering Algorithms -- Implementation and Numerical Results -- Conclusion.

This updated book describes optimization models of clustering problems and clustering algorithms based on optimization techniques, including their implementation, evaluation, and applications. The book gives a comprehensive and detailed description of optimization approaches for solving clustering problems; the authors' emphasis on clustering algorithms is based on deterministic methods of optimization. The book also includes results on real-time clustering algorithms based on optimization techniques, addresses implementation issues of these clustering algorithms, and discusses new challenges arising from very large data and data with noise and outliers. The book is ideal for anyone teaching or learning clustering algorithms. It provides an accessible introduction to the ﬁeld and it is well suited for practitioners already familiar with the basics of optimization. Designed for a typical undergraduate, graduate, or dual-listed course with a semester-based calendar; Puts theory in context, so readers gain knowledge about the most essential concepts and algorithms; Covers essential terms, algorithms, and useful tools for learning and performing contemporary AI.

ISBN: 9783031765124

Standard No.: 10.1007/978-3-031-76512-4doiSubjects--Topical Terms:

527964
Nonsmooth optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 515.64

Partitional clustering via nonsmooth optimization = clustering via optimization /
LDR:02550nam a2200349 a 4500 001 1160445
003 DE-He213
005 20241216115240.0
006 m o d
007 cr nn 008maaau
008 251029s2025 sz s 0 eng d
020 $a 9783031765124 $q (electronic bk.)
020 $a 9783031765117 $q (paper)
024 7 $a 10.1007/978-3-031-76512-4 $2 doi
035 $a 978-3-031-76512-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a TJK $2 bicssc
072 7 $a TEC041000 $2 bisacsh
072 7 $a TJK $2 thema
082 0 4 $a 515.64 $2 23
090 $a QA402.5 $b .B145 2025
100 1 $a Bagirov, Adil. $3 1487489
245 1 0 $a Partitional clustering via nonsmooth optimization $h [electronic resource] : $b clustering via optimization / $c by Adil Bagirov, Napsu Karmitsa, Sona Taheri.
250 $a Second edition.
260 $a Cham : $c 2025. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a xx, 395 p. : $b ill. (chiefly color), digital ; $c 24 cm.
490 1 $a Unsupervised and semi-supervised learning, $x 2522-8498
505 0 $a Introduction -- Introduction to Clustering -- Clustering Algorithms -- Nonsmooth Optimization Models in Cluster Analysis -- Nonsmooth Optimization -- Optimization based Clustering Algorithms -- Implementation and Numerical Results -- Conclusion.
520 $a This updated book describes optimization models of clustering problems and clustering algorithms based on optimization techniques, including their implementation, evaluation, and applications. The book gives a comprehensive and detailed description of optimization approaches for solving clustering problems; the authors' emphasis on clustering algorithms is based on deterministic methods of optimization. The book also includes results on real-time clustering algorithms based on optimization techniques, addresses implementation issues of these clustering algorithms, and discusses new challenges arising from very large data and data with noise and outliers. The book is ideal for anyone teaching or learning clustering algorithms. It provides an accessible introduction to the ﬁeld and it is well suited for practitioners already familiar with the basics of optimization. Designed for a typical undergraduate, graduate, or dual-listed course with a semester-based calendar; Puts theory in context, so readers gain knowledge about the most essential concepts and algorithms; Covers essential terms, algorithms, and useful tools for learning and performing contemporary AI.
650 0 $a Nonsmooth optimization. $3 527964
650 1 4 $a Communications Engineering, Networks. $3 669809
650 2 4 $a Automated Pattern Recognition. $3 1365734
650 2 4 $a Signal, Speech and Image Processing. $3 1414819
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Data Mining and Knowledge Discovery. $3 677765
700 1 $a Karmitsa, Napsu. $e author. $3 1321924
700 1 $a Taheri, Sona. $e author. $3 1321925
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a Unsupervised and semi-supervised learning. $3 1408230
856 4 0 $u https://doi.org/10.1007/978-3-031-76512-4
950 $a Engineering (SpringerNature-11647)