Data clustering is an unsupervised classification method aims at creating groups of objects, or clusters, in such a way that objects in the same cluster are very similar and objects in different clusters are quite distinct. K-means is an iterative algorithm in which the number of clusters must be determined before the execution.In this book an efficient k-means algorithm is proposed. Since, in each iteration, the k-means algorithm computes the distances between data point and all centers, this is computationally very expensive especially for huge data sets. For each data point, we can keep the distance to the nearest cluster. At the next iteration, we compute the distance to the previous nearest cluster. If the new distance is less than or equal to the previous distance, the point stays in its cluster, and there is no need to compute its distances to the other cluster centers. This saves the time required to compute distances to k−1 clusters. Experimental results show the accuracy and effectiveness of the proposed method.
"synopsis" may belong to another edition of this title.
Neha Aggarwal is a computer professional working as an Assistant Professor in MDU, India. she is B.Tech(CSE), MBA(HR), M.Tech(CSE) with about 8 International journals in her name.
"About this title" may belong to another edition of this title.
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Data clustering is an unsupervised classification method aims at creating groups of objects, or clusters, in such a way that objects in the same cluster are very similar and objects in different clusters are quite distinct. K-means is an iterative algorithm in which the number of clusters must be determined before the execution.In this book an efficient k-means algorithm is proposed. Since, in each iteration, the k-means algorithm computes the distances between data point and all centers, this is computationally very expensive especially for huge data sets. For each data point, we can keep the distance to the nearest cluster. At the next iteration, we compute the distance to the previous nearest cluster. If the new distance is less than or equal to the previous distance, the point stays in its cluster, and there is no need to compute its distances to the other cluster centers. This saves the time required to compute distances to k 1 clusters. Experimental results show the accuracy and effectiveness of the proposed method. Seller Inventory # 9783659216657
Quantity: 2 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Aggarwal NehaNeha Aggarwal is a computer professional working as an Assistant Professor in MDU, India. she is B.Tech(CSE), MBA(HR), M.Tech(CSE) with about 8 International journals in her name.Data clustering is an unsupervised cl. Seller Inventory # 5140444
Quantity: Over 20 available
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. An Improved K-means Clustering Algorithm For Data Mining | Neha Aggarwal (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783659216657 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 106140590
Quantity: 5 available
Seller: Mispah books, Redhill, SURRE, United Kingdom
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA79636592166586
Quantity: 1 available