Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

K-means Clustering Algorithm: Implementation and Critical Analysis

Name: K-means Clustering Algorithm: Implementation and Critical Analysis
Brand: Scholars' Press
SKU: 24105928
Price: 16009 HUF
Availability: InStock
Author: Swati Patel
ISBN: 9786138838197

Swati Patel

Language

English

Book Paperback

Libristo code: 24105928

Publishers Scholars' Press, July 2019

Clustering is considered as widely used data mining practices. Clustering is the technique of dividi... Full description

Libristo code: 24105928

109 b

16 009 Ft

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

?Fiestas Judías o Fiestas de Yahweh? Libro 3: Celebraciones de Primavera y Verano A a Candelaria

Paperback

4 690 Ft

Im Westen nichts Neues Erich Maria Remarque

Hardback

9 868 Ft

Kirik Kanatlar Halil Cibran

Paperback

2 806 Ft

Assassin's Creed. Black Flag Oliver Bowden

Paperback

8 012 Ft

Osmanli Imparatorlugunda Diplomasi ve Agirlama

Paperback

15 446 Ft

Pelekaland a nyaralóban Durica Katarina

Hardback

4 740 Ft

Woerterbuch Zur Inneren Sicherheit Matthias Gasch

Hardback

47 549 Ft

Clustering is considered as widely used data mining practices. Clustering is the technique of dividing entire dataset in certain clusters created on the comparable characteristics of the instances. On the foundation of the likeness between the instances of data, grouping or clustering the instances of the large database regardless of its size is considered as significant chunk of data mining. There are plentiful approaches of clustering but this book mainly focuses on improving k-Means clustering algorithm. This method clusters the input dataset in quantified number (k) of groups. This method is verified to be very efficient when while dealing with small data, but for huge data, it fails in time complexity; it takes time more than usual. This work mainly aims comparison of k-means clustering scheme with ranking method to speed up the comprehensive running time for k-Means clustering algorithm. The experimental results clearly confirms that the new technique is more time efficient than the old-style k-Means clustering method.