👨‍💼 CUSTOMER CARE NO +918468865271

⭐ TOP RATED SELLER ON AMAZON, FLIPKART, EBAY & WALMART

🏆 TRUSTED FOR 10+ YEARS

  • From India to the World — Discover Our Global Stores

🚚 Extra 10% + Free Shipping? Yes, Please!

Shop above ₹5000 and save 10% instantly—on us!

THANKYOU10

Introduction To Clustering Large And High Dimensional Data

Sale price Rs.2,549.00 Regular price Rs.3,186.00
Tax included


Genuine Products Guarantee

We guarantee 100% genuine products, and if proven otherwise, we will compensate you with 10 times the product's cost.

Delivery and Shipping

Products are generally ready for dispatch within 1 day and typically reach you in 3 to 5 days.

Get 100% refund on non-delivery or defects

On Prepaid Orders

Author: Kogan, Jacob

Brand: Cambridge University Press

Edition: 1

Binding: paperback

Format: Illustrated

Number Of Pages: 205

Release Date: 30-11-2006

Part Number: Refer to Sapnet.

Details: Product Description


There is a growing need for a more automated system of partitioning data sets into groups, or clusters. For example, digital libraries and the World Wide Web continue to grow exponentially, the ability to find useful information increasingly depends on the indexing infrastructure or search engine. Clustering techniques can be used to discover natural groups in data sets and to identify abstract structures that might reside there, without having any background knowledge of the characteristics of the data. Clustering has been used in a variety of areas, including computer vision, VLSI design, data mining, bio-informatics (gene expression analysis), and information retrieval, to name just a few. This book focuses on a few of the most important clustering algorithms, providing a detailed account of these major models in an information retrieval context. The beginning chapters introduce the classic algorithms in detail, while the later chapters describe clustering through divergences and show recent research for more advanced audiences.


Review


"...this book may serve as a useful reference for scientists and engineers who need to understand the concepts of clustering in general and/or to focus on text mining applications. It is also appropriate for students who are attending a course in pattern recognition, data mining, or classification and are interested in learning more about issues related to the k-means scheme for an undergraduate or master's thesis project. Last, it supplies very interesting material for instructors."
Nicolas Loménie, IAPR Newsletter



Book Description


Focuses on a few of the important clustering algorithms in the context of information retrieval.


About the Author


Jacob Kogan is an Associate Professor in the Department of Mathematics and Statistics at the University of Maryland, Baltimore County. Dr. Kogan received his PhD in Mathematics from Weizmann Institute of Science, has held teaching and research positions at the University of Toronto and Purdue University. His research interests include Text and Data Mining, Optimization, Calculus of Variations, Optimal Control Theory, and Robust Stability of Control Systems. Dr. Kogan is the author of Bifurcations of Extremals in Optimal Control and Robust Stability and Convexity: An Introduction. Since 2001, he has also been affiliated with the Department of Computer Science and Electrical Engineering at UMBC. Dr. Kogan is a recipient of 2004–2005 Fulbright Fellowship to Israel. Together with Charles Nicholas of UMBC and Marc Teboulle of Tel-Aviv University he is co-editor of the volume Grouping Multidimensional Data: Recent Advances in Clustering.

EAN: 9780521617932

Package Dimensions: 9.0 x 6.0 x 0.5 inches

Languages: English