• Contact

  • Newsletter

  • About us

  • Delivery options

  • Prospero Book Market Podcast

  • Partitional Clustering via Nonsmooth Optimization: Clustering via Optimization

    Partitional Clustering via Nonsmooth Optimization by M. Bagirov, Adil; Karmitsa, Napsu; Taheri, Sona;

    Clustering via Optimization

    Series: Unsupervised and Semi-Supervised Learning;

      • GET 12% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice EUR 106.99
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        44 374 Ft (42 261 Ft + 5% VAT)
      • Discount 12% (cc. 5 325 Ft off)
      • Discounted price 39 049 Ft (37 190 Ft + 5% VAT)

    44 374 Ft

    Availability

    Out of print

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Long description:

    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

    More

    Table of Contents:

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

    More
    0