Constrained Clustering Advances in Algorithms Theory

Since the initial work on constrained clustering, there have been numerous advances in methods, applications, and our understanding of the theoretical properties of constraints and constrained clustering algorithms. Bringing these developments together, Constrained Clustering: Advances in Algorithms, Theory, and Applications presents an extensive collection of the latest innovations in clustering data analysis methods that use background knowledge encoded as constraints.

  • Delivery

    ₹75 shipping all over India

  • Secure Payment

    100% Secure Payment

4,925.0011,299.00

Out of stock

The first five chapters of this volume investigate advances in the use of instance-level, pairwise constraints for partitional and hierarchical clustering. The book then explores other types of constraints for clustering, including cluster size balancing, minimum cluster size, and cluster-level relational constraints.

SKU: 9781584889960
Categories:,
Tag:
Weight 1 kg
Dimensions 24 × 16 × 3 cm
Book Author

Ian Davidson, Kiri L. Wagstaff, Sugato Basu

Edition

1st

ISBN

9781584889960

Language

English

Pages

472

Publication Year

Publisher

Customer Reviews

There are no reviews yet.

Be the first to review “Constrained Clustering Advances in Algorithms Theory”

Your email address will not be published. Required fields are marked *