stanford大学_大数据挖掘_clustering_16.ppt

Clustering Algorithms Applications Hierarchical Clustering k -Means Algorithms CURE Algorithm The Problem of Clustering Given a set of points, with a notion of distance between points, group the points into some number of clusters, so that members of a cluster are in some sense as close to each other as possible. Example Problems With Clustering Clustering in two dimensions looks easy. Clustering small amounts of data looks easy. And in most cases, looks are not deceiving. The Curse of Dimensionality Many applications involve not 2, but 10 or 10,000 dimensions. High-dimensional spaces look different: almost all pairs of points are at about the same distance. Example: Curse of Dimensionality Assume random points within a bounding box, e.g., values between 0 and 1 in each dimension. In 2 dimensions: a variety of distances between 0 and 1.41. In 10,000 dimensions, the difference in any one dimension is distributed as a triangle. Example – Continued The law of large numbers applies. Actual distance between two random points is the sqrt of the sum of squares of essentially the same set of differences. Example High-Dimension Application: SkyCat A catalog of 2 billion “sky objects” represents objects by their radiation in 7 dimensions (frequency bands). Problem: cluster into similar objects, e.g., galaxies, nearby stars, quasars, etc. Sloan Sky Survey is a newer, better version. Example: Clustering CD’s (Collaborative Filtering) Intuitively: music divides into categories, and customers prefer a few categories. But what are categories really? Represent a CD by the customers who bought it. Similar CD’s have similar sets of customers, and vice-versa. The Space of CD’s Think of a space with one dimension for each customer. Values in a dimension may be 0 or 1 only. A CD’s point in this space is (x1, x2,…, xk), where xi = 1 iff the i th customer bought the CD. Compare with boolean matrix: rows = customers; cols. = CD’s. Space of CD’s – (2) For Amazon, the dimension c