Vai al contenuto principale della pagina
| Autore: |
Bagirov Adil
|
| Titolo: |
Partitional Clustering via Nonsmooth Optimization : Clustering via Optimization / / by Adil Bagirov, Napsu Karmitsa, Sona Taheri
|
| Pubblicazione: | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 |
| Edizione: | 2nd ed. 2025. |
| Descrizione fisica: | 1 online resource (402 pages) |
| Disciplina: | 621.382 |
| Soggetto topico: | Telecommunication |
| Pattern recognition systems | |
| Signal processing | |
| Artificial intelligence | |
| Data mining | |
| Communications Engineering, Networks | |
| Automated Pattern Recognition | |
| Signal, Speech and Image Processing | |
| Artificial Intelligence | |
| Data Mining and Knowledge Discovery | |
| Altri autori: |
KarmitsaNapsu
TaheriSona
|
| Nota di contenuto: | Introduction -- Introduction to Clustering -- Clustering Algorithms -- Nonsmooth Optimization Models in Cluster Analysis -- Nonsmooth Optimization -- Optimization based Clustering Algorithms -- Implementation and Numerical Results -- Conclusion. |
| Sommario/riassunto: | 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 field 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. |
| Titolo autorizzato: | Partitional Clustering via Nonsmooth Optimization ![]() |
| ISBN: | 9783031765124 |
| 3031765125 | |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910983338603321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |