## Data Clustering: Theory, Algorithms, and ApplicationsCluster analysis is an unsupervised process that divides a set of objects into homogeneous groups. This book starts with basic information on cluster analysis, including the classification of data and the corresponding similarity measures, followed by the presentation of over 50 clustering algorithms in groups according to some specific baseline methodologies such as hierarchical, centre-based, and search-based methods. As a result, readers and users can easily identify an appropriate algorithm for their applications and compare novel ideas with existing results. The book also provides examples of clustering applications to illustrate the advantages and shortcomings of different clustering architectures and algorithms. Application areas include pattern recognition, artificial intelligence, information technology, image processing, biology, psychology, and marketing. Suitable as a textbook for an introductory course in cluster analysis or as source material for a graduate-level introduction to data mining. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

SA20_ch1 | 3 |

SA20_ch2 | 19 |

SA20_ch3 | 25 |

SA20_ch4 | 43 |

SA20_ch5 | 53 |

SA20_ch6 | 67 |

SA20_ch7 | 109 |

SA20_ch8 | 151 |

SA20_ch14 | 227 |

SA20_ch15 | 243 |

SA20_ch16 | 287 |

SA20_ch17 | 299 |

SA20_ch18 | 323 |

SA20_ch19 | 343 |

SA20_ch20 | 363 |

SA20_appa | 371 |

SA20_ch9 | 161 |

SA20_ch10 | 183 |

SA20_ch11 | 203 |

SA20_ch12 | 209 |

SA20_ch13 | 219 |

SA20_appb | 375 |

SA20_appc | 377 |

SA20_appd | 385 |

SA20_bm | 397 |

### Other editions - View all

### Common terms and phrases

ACM Press attribute binary categorical data cell centroid Chapter cluster analysis cluster centers Cluster ID clustering algorithms coefficient criterion d-dimensional data clustering data mining data points data set databases defined in equation dendrogram denote density dissimilarity matrix dissimilarity measure dTemp EM algorithm Euclidean distance example Figure fuzzy clustering gene expression gene expression data given graph hierarchical algorithms hierarchical clustering high-dimensional IEEE Computer Society IEEE Transactions initial input international conference iteration Journal k-means algorithm k-modes algorithm kd-tree knowledge discovery M-file MATLAB medoid membership merged minimized missing values model-based clustering node number of clusters number of data Number of genes nv Ship objective function optimal parameters Pattern Recognition procedure Proceedings proposed random sample Section similarity measure space Statistical subspace clustering Table tabu tabu search techniques Theorem updated variable vector visualization x1 x2 x n