Central Library

Normal view MARC view ISBD view

Partitional Clustering via Nonsmooth Optimization [electronic resource] : Clustering via Optimization / by Adil M. Bagirov, Napsu Karmitsa, Sona Taheri.

By: M. Bagirov, Adil [author.].
Contributor(s): Karmitsa, Napsu [author.] | Taheri, Sona [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Unsupervised and Semi-Supervised Learning: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2020Edition: 1st ed. 2020.Description: XX, 336 p. 78 illus., 77 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783030378264.Subject(s): 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 DiscoveryAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 621.382 Online resources: Click here to access online
Contents:
Introduction -- Introduction to Clustering -- Clustering Algorithms -- Nonsmooth Optimization Models in Cluster Analysis -- Nonsmooth Optimization -- Optimization based Clustering Algorithms -- Implementation and Numerical Results -- Conclusion.
In: Springer Nature eBookSummary: This 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 big data. 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. Provides a comprehensive description of clustering algorithms based on nonsmooth and global optimization techniques Addresses problems of real-time clustering in large data sets and challenges arising from big data Describes implementation and evaluation of optimization based clustering algorithms.
    average rating: 0.0 (0 votes)
No physical items for this record

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

This 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 big data. 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. Provides a comprehensive description of clustering algorithms based on nonsmooth and global optimization techniques Addresses problems of real-time clustering in large data sets and challenges arising from big data Describes implementation and evaluation of optimization based clustering algorithms.

There are no comments for this item.

Log in to your account to post a comment.