7 semi的-supervised learning -b.pptVIP

Sugato Basu Semi-Supervised Clustering Semi-Supervised Clustering II Outline of lecture Overview of search-based semi-supervised clustering Similarity-based semi-supervised clustering Altered similarity matrix Similarity metric learning Altered Euclidian distance Combination of search-based and similarity-based semi-supervised clustering Summary Overview of search-based semi-supervised clustering Enforcing constraints (must-link, cannot-link) on the labeled data during clustering [Wagstaff:ICML01]. COP K-Means Use the labeled data to initialize clusters in an iterative refinement algorithm (K-Means,) [Basu:ICML02]. Seeded K-Means Constrained K-Means Other search-based algorithms Similarity-Based Semi-Supervised Clustering Train an adaptive similarity function to fit the labeled data. Use a standard clustering algorithm with the trained similarity function to cluster the unlabeled data. Adaptive similarity functions: Altered similarity matrix [Kamvar:IJCAI03] Trained Mahalanobis distance [Xing:NIPS02] Altered Euclidian distance [Klein:ICML02] Clustering algorithms: Spectral clustering [Kamvar:IJCAI03] Complete-link agglomerative [Klein:ICML02] K-means [Xing:NIPS02] Altered similarity matrix Paper: Spectral learning. Kamvar et al. Graph based clustering W: similarity matrix D: degree matrix (row sum of W) Key idea: alter the similarity matrix W based on the domain knowledge. Overview of graph based (spectral) clustering Associate each data item with a vertex in a weighted graph, where the weights on the edges between elements are large if the elements are similar and small if they are not. Cut the graph into connected components with relatively large interior weights by cutting edges with relatively low weights. Clustering becomes a graph cut problem. Many different algorithms Overview of spectral clustering Overview of spectral clustering Semi-supervised spectral clustering Distance metric learning Distance metric learning Distance metric learning Distan