Artículos relacionados a Enhancing Variants of K-Means
Sinopsis
Clustering analysis is one of the most commonly used data processing algorithms. Over half a century, K-means remains the most popular clustering algorithm because of its simplicity. Traditional K-means clustering tries to assign n data objects to k clusters starting with random initial centers. However, most of the k- means variants tend to compute distance of each data point to each cluster centroid for every iteration. We propose a fast heuristic to overcome this bottleneck with only marginal increase in Mean Squared Error (MSE). We observe that across all iterations of K-means, a data point changes its membership only among a small subset of clusters. Our heuristic predicts such clusters for each data point by looking at nearby clusters after the first iteration of k-means. We augment well-known variants of k- means like Enhanced K-means and K-means with Triangle Inequality using our heuristic to demonstrate its effectiveness. For various datasets, our heuristic achieves speed-up of up-to 3 times when compared to efficient variants of k-means.
"Sinopsis" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Enhancing Variants of K-Means
Imagen del vendedor
Enhancing Variants of K-Means
Publicado por
LAP LAMBERT Academic Publishing Jan 2019, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Clustering analysis is one of the most commonly used data processing algorithms. Over half a century, K-means remains the most popular clustering algorithm because of its simplicity. Traditional K-means clustering tries to assign n data objects to k clusters starting with random initial centers. However, most of the k- means variants tend to compute distance of each data point to each cluster centroid for every iteration. We propose a fast heuristic to overcome this bottleneck with only marginal increase in Mean Squared Error (MSE). We observe that across all iterations of K-means, a data point changes its membership only among a small subset of clusters. Our heuristic predicts such clusters for each data point by looking at nearby clusters after the first iteration of k-means. We augment well-known variants of k- means like Enhanced K-means and K-means with Triangle Inequality using our heuristic to demonstrate its effectiveness. For various datasets, our heuristic achieves speed-up of up-to 3 times when compared to efficient variants of k-means. 64 pp. Englisch. Nº de ref. del artículo: 9786139983803
Comprar nuevo
EUR 39,90
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen de archivo
Enhancing Variants of K-Means
Publicado por
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Nuevo
Tapa blanda
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Nº de ref. del artículo: 26404338760
Comprar nuevo
EUR 63,68
Envío por EUR 3,44
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Enhancing Variants of K-Means
Publicado por
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Nuevo
Tapa blanda
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Print on Demand. Nº de ref. del artículo: 409864087
Comprar nuevo
EUR 62,06
Envío por EUR 7,58
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Enhancing Variants of K-Means
Publicado por
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Nuevo
Tapa blanda
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. PRINT ON DEMAND. Nº de ref. del artículo: 18404338754
Comprar nuevo
EUR 63,99
Envío por EUR 9,95
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 4 disponibles
Imagen de archivo
Enhancing Variants of K-Means
Publicado por
LAP Lambert Academic Publishing, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 8.82x5.98x0.32 inches. In Stock. Nº de ref. del artículo: zk6139983800
Comprar nuevo
EUR 68,25
Envío por EUR 11,66
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Enhancing Variants of K-Means
Publicado por
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Chilamakur RaghavendraC. Raghavendra, pursuing Ph.D in Computer Science & Engineering from Bharath University, Chennai. Presently, he is working as Asst. Professor, CSE Dept., Institute of Aeronautical Engineering, Hyderabad. His res. Nº de ref. del artículo: 385662061
Comprar nuevo
EUR 34,25
Envío por EUR 48,99
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Enhancing Variants of K-Means
Publicado por
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Clustering analysis is one of the most commonly used data processing algorithms. Over half a century, K-means remains the most popular clustering algorithm because of its simplicity. Traditional K-means clustering tries to assign n data objects to k clusters starting with random initial centers. However, most of the k- means variants tend to compute distance of each data point to each cluster centroid for every iteration. We propose a fast heuristic to overcome this bottleneck with only marginal increase in Mean Squared Error (MSE). We observe that across all iterations of K-means, a data point changes its membership only among a small subset of clusters. Our heuristic predicts such clusters for each data point by looking at nearby clusters after the first iteration of k-means. We augment well-known variants of k- means like Enhanced K-means and K-means with Triangle Inequality using our heuristic to demonstrate its effectiveness. For various datasets, our heuristic achieves speed-up of up-to 3 times when compared to efficient variants of k-means. Nº de ref. del artículo: 9786139983803
Comprar nuevo
EUR 58,59
Envío por EUR 30,50
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Enhancing Variants of K-Means
Publicado por
LAP LAMBERT Academic Publishing Jan 2019, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Clustering analysis is one of the most commonly used data processing algorithms. Over half a century, K-means remains the most popular clustering algorithm because of its simplicity. Traditional K-means clustering tries to assign n data objects to k clusters starting with random initial centers. However, most of the k- means variants tend to compute distance of each data point to each cluster centroid for every iteration. We propose a fast heuristic to overcome this bottleneck with only marginal increase in Mean Squared Error (MSE). We observe that across all iterations of K-means, a data point changes its membership only among a small subset of clusters. Our heuristic predicts such clusters for each data point by looking at nearby clusters after the first iteration of k-means. We augment well-known variants of k- means like Enhanced K-means and K-means with Triangle Inequality using our heuristic to demonstrate its effectiveness. For various datasets, our heuristic achieves speed-up of up-to 3 times when compared to efficient variants of k-means.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 64 pp. Englisch. Nº de ref. del artículo: 9786139983803
Comprar nuevo
EUR 39,90
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Enhancing Variants of K-Means
Publicado por
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Nuevo
Taschenbuch
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Enhancing Variants of K-Means | Raghavendra Chilamakur (u. a.) | Taschenbuch | 64 S. | Englisch | 2019 | LAP LAMBERT Academic Publishing | EAN 9786139983803 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Nº de ref. del artículo: 115353797
Comprar nuevo
EUR 36,35
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen de archivo
Enhancing Variants of K-Means
Publicado por
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 6139983800
ISBN 13: 9786139983803
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | Clustering analysis is one of the most commonly used data processing algorithms. Over half a century, K-means remains the most popular clustering algorithm because of its simplicity. Traditional K-means clustering tries to assign n data objects to k clusters starting with random initial centers. However, most of the k- means variants tend to compute distance of each data point to each cluster centroid for every iteration. We propose a fast heuristic to overcome this bottleneck with only marginal increase in Mean Squared Error (MSE). We observe that across all iterations of K-means, a data point changes its membership only among a small subset of clusters. Our heuristic predicts such clusters for each data point by looking at nearby clusters after the first iteration of k-means. We augment well-known variants of k- means like Enhanced K-means and K-means with Triangle Inequality using our heuristic to demonstrate its effectiveness. For various datasets, our heuristic achieves speed-up of up-to 3 times when compared to efficient variants of k-means. Nº de ref. del artículo: 33557199/1
Comprar usado
EUR 19,09
Envío por EUR 105,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles