模式分类英文课件pr10part1_ding.pptVIP

Pattern ClassificationAll materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley Sons, 2000 with the permission of the authors and the publisher Chapter 10Unsupervised Learning Clustering Introduction Mixture Densities and Identifiability ML Estimates Application to Normal Mixtures K-means algorithm Unsupervised Bayesian Learning Data description and clustering Criterion function for clustering Hierarchical clustering Low-dim reps and multidimensional scaling (self-organizing maps) 10.1 Introduction Previously, all our training samples were labeled: these samples were said “supervised” We now investigate a number of “unsupervised” procedures which use unlabeled samples Collecting and Labeling a large set of sample patterns can be costly We can train with large amounts of (less expensive) unlabeled data, and only then use supervision to label the groupings found, this is appropriate for large “data mining” applications where the contents of a large database are not known beforehand This is also appropriate in many applications when the characteristics of the patterns can change slowly with time. Improved performance can be achieved if classifiers running in a unsupervised mode are used We can use unsupervised methods to identify features that will then be useful for categorization We gain some insight into the nature (or structure) of the data 10.2 Mixture Densities Identifiability We shall begin with the assumption that the functional forms for the underlying probability densities are known and that the only thing that must be learned is the value of an unknown parameter vector We make the following assumptions: The samples come from a known number c of classes The prior probabilities P(?j) for each class are known (j = 1, …,c) P(x | ?j, ?j) (j = 1, …,c) are known The values of the c parameter vectors ?1, ?2, …, ?c are unknown The category labels are unknown This density fun