9851137

9781420072617

Relational Data Clustering: Models, Algorithms, and Applications (Chapman & Hall/CRC Data Mining and Knowledge Discovery Series)

Relational Data Clustering: Models, Algorithms, and Applications (Chapman & Hall/CRC Data Mining and Knowledge Discovery Series)
$114.74
$3.95 Shipping
  • Condition: New
  • Provider: LightningBooks Contact
  • Provider Rating:
    85%
  • Ships From: Multiple Locations
  • Shipping: Standard, Expedited (tracking available)
  • Comments: Fast shipping! All orders include delivery confirmation.

seal  
$57.94
$3.95 Shipping
List Price
$79.95
Discount
27% Off
You Save
$22.01

  • Condition: Good
  • Provider: Ergodebooks Contact
  • Provider Rating:
    82%
  • Ships From: Multiple Locations
  • Shipping: Standard
  • Comments: Buy with confidence. Excellent Customer Service & Return policy.

seal  

Ask the provider about this item.

Most renters respond to questions in 48 hours or less.
The response will be emailed to you.
Cancel
  • ISBN-13: 9781420072617
  • ISBN: 1420072617
  • Edition: 1
  • Publication Date: 2010
  • Publisher: C R C Press LLC

AUTHOR

Long, Bo, Zhang, Zhongfei, Yu, Philip S.

SUMMARY

This book reflects the recent emergence of relational data clustering as an important field of data clustering, with applications in text mining, social network analysis, collaborative filtering, and bioinformatics.Long, Bo is the author of 'Relational Data Clustering: Models, Algorithms, and Applications (Chapman & Hall/CRC Data Mining and Knowledge Discovery Series)', published 2010 under ISBN 9781420072617 and ISBN 1420072617.

[read more]

Questions about purchases?

You can find lots of answers to common customer questions in our FAQs

View a detailed breakdown of our shipping prices

Learn about our return policy

Still need help? Feel free to contact us

View college textbooks by subject
and top textbooks for college

The ValoreBooks Guarantee

The ValoreBooks Guarantee

With our dedicated customer support team, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.