9786138838197 - k-means clustering algorithm: implementation and critical analysis di patel, swati (9 risultati)
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 72,30
EUR 3,46 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New.
- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 82,72
EUR 11,71 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Brand New. 68 pages. 8.66x5.91x0.16 inches. In Stock.
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 41,00
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. K-means Clustering Algorithm: Implementation and Critical Analysis | Swati Patel | Taschenbuch | 68 S. | Englisch | 2019 | Scholars' Press | EAN 9786138838197 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu….
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 45,90
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 68 pp. Englisch.
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 72,11
EUR 7,61 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand.
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 74,07
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 38,74
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Patel SwatiSwati is a keen researcher in various fields like data mining, internet security, cloud Computing and Image Processing. She holds master s degree in computer engineering from North Maharasht…ra University, Jalgaon, India wi.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 45,90
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 bet…ween 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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 68 pp. Englisch.
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 46,45
EUR 60,60 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 betw…een 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.
