or
Sign in to turn on 1-Click ordering
Kindle Edition
Read instantly on your iPad, PC, Mac, Android tablet or Kindle Fire
Buy Price: $71.96
Rent From: $33.03
 
 
   
More Buying Choices
Have one to sell? Sell yours here
Sorry, this item is not available in
Image not available for
Color:
Image not available

To view this video download Flash Player

 

Constrained Clustering: Advances in Algorithms, Theory, and Applications (Chapman & Hall/CRC Data Mining and Knowledge Discovery Series) [Hardcover]

Sugato Basu , Ian Davidson , Kiri Wagstaff

List Price: $93.95
Price: $89.25 & FREE Shipping. Details
You Save: $4.70 (5%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 3 left in stock (more on the way).
Ships from and sold by Amazon.com. Gift-wrap available.
Want it Thursday, June 20? Choose One-Day Shipping at checkout. Details
Free Two-Day Shipping for College Students with Amazon Student

Formats

Amazon Price New from Used from
Kindle Edition
Rent from
$71.96
$33.03
 
Hardcover $89.25  
Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Book Description

August 18, 2008 1584889969 978-1584889960 1
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.

Algorithms

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.

Theory

It also describes variations of the traditional clustering under constraints problem as well as approximation algorithms with helpful performance guarantees.

Applications

The book ends by applying clustering with constraints to relational data, privacy-preserving data publishing, and video surveillance data. It discusses an interactive visual clustering approach, a distance metric learning approach, existential constraints, and automatically generated constraints.

With contributions from industrial researchers and leading academic experts who pioneered the field, this volume delivers thorough coverage of the capabilities and limitations of constrained clustering methods as well as introduces new types of constraints and clustering algorithms.



Editorial Reviews

About the Author

Google, Inc. Mountain View, California, USA University of California, Davis, USA Jet Propulsion Laboratory, Pasadena, California, USA

Product Details


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

There are no customer reviews yet.
5 star
4 star
3 star
2 star
1 star
Share your thoughts with other customers

Forums

There are no discussions about this product yet.
Be the first to discuss this product with the community.
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category