Presentation on theme: "Data Mining Cluster Analysis Basics"— Presentation transcript:
1Data Mining Cluster Analysis Basics From Introduction to Data Mining by Tan, Steinbach, Kumar
2What is Cluster Analysis? Finding groups of objects such that the objects in a group will be similar (or related) to one another and different from (or unrelated to) the objects in other groupsInter-cluster distances are maximizedIntra-cluster distances are minimized
3Applications of Cluster Analysis UnderstandingGroup related documents for browsing, group genes and proteins that have similar functionality, or group stocks with similar price fluctuationsSummarizationReduce the size of large data setsClustering precipitation in Australia
4What is not Cluster Analysis? Supervised classificationHave class label informationSimple segmentationDividing students into different registration groups alphabetically, by last nameResults of a queryGroupings are a result of an external specificationGraph partitioningSome mutual relevance and synergy, but areas are not identical
5Notion of a Cluster can be Ambiguous How many clusters?Six ClustersTwo ClustersFour Clusters
6Types of Clusterings A clustering is a set of clusters Important distinction between hierarchical and partitional sets of clustersPartitional ClusteringA division data objects into non-overlapping subsets (clusters) such that each data object is in exactly one subsetHierarchical clusteringA set of nested clusters organized as a hierarchical tree
7Partitional Clustering A Partitional ClusteringOriginal Points
8Hierarchical Clustering Traditional Hierarchical ClusteringTraditional DendrogramNon-traditional Hierarchical ClusteringNon-traditional Dendrogram
9Other Distinctions Between Sets of Clusters Exclusive versus non-exclusiveIn non-exclusive clusterings, points may belong to multiple clusters.Can represent multiple classes or ‘border’ pointsFuzzy versus non-fuzzyIn fuzzy clustering, a point belongs to every cluster with some weight between 0 and 1Weights must sum to 1Probabilistic clustering has similar characteristicsPartial versus completeIn some cases, we only want to cluster some of the dataHeterogeneous versus homogeneousCluster of widely different sizes, shapes, and densities
10Types of Clusters Well-separated clusters Center-based clusters Contiguous clustersDensity-based clustersProperty or ConceptualDescribed by an Objective Function
11Types of Clusters: Well-Separated Well-Separated Clusters:A cluster is a set of points such that any point in a cluster is closer (or more similar) to every other point in the cluster than to any point not in the cluster.3 well-separated clusters
12Types of Clusters: Center-Based A cluster is a set of objects such that an object in a cluster is closer (more similar) to the “center” of a cluster, than to the center of any other clusterThe center of a cluster is often a centroid, the average of all the points in the cluster, or a medoid, the most “representative” point of a cluster4 center-based clusters
13Types of Clusters: Contiguity-Based Contiguous Cluster (Nearest neighbor or Transitive)A cluster is a set of points such that a point in a cluster is closer (or more similar) to one or more other points in the cluster than to any point not in the cluster.8 contiguous clusters
14Types of Clusters: Density-Based A cluster is a dense region of points, which is separated by low-density regions, from other regions of high density.Used when the clusters are irregular or intertwined, and when noise and outliers are present.6 density-based clusters
15Types of Clusters: Conceptual Clusters Shared Property or Conceptual ClustersFinds clusters that share some common property or represent a particular concept..2 Overlapping Circles
16Types of Clusters: Objective Function Clusters Defined by an Objective FunctionFinds clusters that minimize or maximize an objective function.Enumerate all possible ways of dividing the points into clusters and evaluate the `goodness' of each potential set of clusters by using the given objective function. (NP Hard)Can have global or local objectives.Hierarchical clustering algorithms typically have local objectivesPartitional algorithms typically have global objectivesA variation of the global objective function approach is to fit the data to a parameterized model.Parameters for the model are determined from the data.Mixture models assume that the data is a ‘mixture' of a number of statistical distributions.
17Types of Clusters: Objective Function … Map the clustering problem to a different domain and solve a related problem in that domainProximity matrix defines a weighted graph, where the nodes are the points being clustered, and the weighted edges represent the proximities between pointsClustering is equivalent to breaking the graph into connected components, one for each cluster.Want to minimize the edge weight between clusters and maximize the edge weight within clusters
18Characteristics of the Input Data Are Important Type of proximity or density measureThis is a derived measure, but central to clusteringSparsenessDictates type of similarityAdds to efficiencyAttribute typeType of DataOther characteristics, e.g., autocorrelationDimensionalityNoise and OutliersType of Distribution
19Clustering Algorithms K-means and its variantsHierarchical clusteringDensity-based clustering
20K-means Clustering Partitional clustering approach Each cluster is associated with a centroid (center point)Each point is assigned to the cluster with the closest centroidNumber of clusters, K, must be specifiedThe basic algorithm is very simple
21K-means Clustering – Details Initial centroids are often chosen randomly.Clusters produced vary from one run to another.The centroid is (typically) the mean of the points in the cluster.‘Closeness’ is measured by Euclidean distance, cosine similarity, correlation, etc.K-means will converge for common similarity measures mentioned above.Most of the convergence happens in the first few iterations.Often the stopping condition is changed to ‘Until relatively few points change clusters’Complexity is O( n * K * I * d )n = number of points, K = number of clusters, I = number of iterations, d = number of attributes
22Two different K-means Clusterings Original PointsOptimal ClusteringSub-optimal Clustering
25Evaluating K-means Clusters Most common measure is Sum of Squared Error (SSE)For each point, the error is the distance to the nearest clusterTo get SSE, we square these errors and sum them.x is a data point in cluster Ci and mi is the representative point for cluster Cican show that mi corresponds to the center (mean) of the clusterGiven two clusters, we can choose the one with the smallest errorOne easy way to reduce SSE is to increase K, the number of clustersA good clustering with smaller K can have a lower SSE than a poor clustering with higher K
28Problems with Selecting Initial Points If there are K ‘real’ clusters then the chance of selecting one centroid from each cluster is small.Chance is relatively small when K is largeIf clusters are the same size, n, thenFor example, if K = 10, then probability = 10!/1010 =Sometimes the initial centroids will readjust themselves in ‘right’ way, and sometimes they don’tConsider an example of five pairs of clusters
2910 Clusters ExampleStarting with two initial centroids in one cluster of each pair of clusters
3010 Clusters ExampleStarting with two initial centroids in one cluster of each pair of clusters
3110 Clusters ExampleStarting with some pairs of clusters having three initial centroids, while other have only one.
3210 Clusters ExampleStarting with some pairs of clusters having three initial centroids, while other have only one.
33Solutions to Initial Centroids Problem Multiple runsHelps, but probability is not on your sideSample and use hierarchical clustering to determine initial centroidsSelect more than k initial centroids and then select among these initial centroidsSelect most widely separatedPostprocessingBisecting K-meansNot as susceptible to initialization issues
34Handling Empty Clusters Basic K-means algorithm can yield empty clustersSeveral strategiesChoose the point that contributes most to SSEChoose a point from the cluster with the highest SSEIf there are several empty clusters, the above can be repeated several times.
35Updating Centers Incrementally In the basic K-means algorithm, centroids are updated after all points are assigned to a centroidAn alternative is to update the centroids after each assignment (incremental approach)Each assignment updates zero or two centroidsMore expensiveIntroduces an order dependencyNever get an empty clusterCan use “weights” to change the impact
36Pre-processing and Post-processing Normalize the dataEliminate outliersPost-processingEliminate small clusters that may represent outliersSplit ‘loose’ clusters, i.e., clusters with relatively high SSEMerge clusters that are ‘close’ and that have relatively low SSECan use these steps during the clustering processISODATA
37Bisecting K-means algorithm Variant of K-means that can produce a partitional or a hierarchical clustering
39Limitations of K-means K-means has problems when clusters are of differingSizesDensitiesNon-globular shapesK-means has problems when the data contains outliers.
40Limitations of K-means: Differing Sizes Original PointsK-means (3 Clusters)
41Limitations of K-means: Differing Density Original PointsK-means (3 Clusters)
42Limitations of K-means: Non-globular Shapes Original PointsK-means (2 Clusters)
43Overcoming K-means Limitations Original Points K-means ClustersOne solution is to use many clusters.Find parts of clusters, but need to put together.
44Overcoming K-means Limitations Original Points K-means Clusters
45Overcoming K-means Limitations Original Points K-means Clusters
46Hierarchical Clustering Produces a set of nested clusters organized as a hierarchical treeCan be visualized as a dendrogramA tree like diagram that records the sequences of merges or splits
47Strengths of Hierarchical Clustering Do not have to assume any particular number of clustersAny desired number of clusters can be obtained by ‘cutting’ the dendogram at the proper levelThey may correspond to meaningful taxonomiesExample in biological sciences (e.g., animal kingdom, phylogeny reconstruction, …)
48Hierarchical Clustering Two main types of hierarchical clusteringAgglomerative:Start with the points as individual clustersAt each step, merge the closest pair of clusters until only one cluster (or k clusters) leftDivisive:Start with one, all-inclusive clusterAt each step, split a cluster until each cluster contains a point (or there are k clusters)Traditional hierarchical algorithms use a similarity or distance matrixMerge or split one cluster at a time
49Agglomerative Clustering Algorithm More popular hierarchical clustering techniqueBasic algorithm is straightforwardCompute the proximity matrixLet each data point be a clusterRepeatMerge the two closest clustersUpdate the proximity matrixUntil only a single cluster remainsKey operation is the computation of the proximity of two clustersDifferent approaches to defining the distance between clusters distinguish the different algorithms
50Starting SituationStart with clusters of individual points and a proximity matrixp1p3p5p4p2. . ..Proximity Matrix
51Intermediate Situation After some merging steps, we have some clustersC2C1C3C5C4C3C4Proximity MatrixC1C5C2
52Intermediate Situation We want to merge the two closest clusters (C2 and C5) and update the proximity matrix.C2C1C3C5C4C3C4Proximity MatrixC1C5C2
53After Merging The question is “How do we update the proximity matrix?” C2 U C5C1C3C4C1?? ? ? ?C2 U C5C3C3?C4?C4Proximity MatrixC1C2 U C5
54How to Define Inter-Cluster Similarity p1p3p5p4p2. . ..Similarity?MINMAXGroup AverageDistance Between CentroidsOther methods driven by an objective functionWard’s Method uses squared errorProximity Matrix
55How to Define Inter-Cluster Similarity p1p3p5p4p2. . ..MINMAXGroup AverageDistance Between CentroidsOther methods driven by an objective functionWard’s Method uses squared errorProximity Matrix
56How to Define Inter-Cluster Similarity p1p3p5p4p2. . ..MINMAXGroup AverageDistance Between CentroidsOther methods driven by an objective functionWard’s Method uses squared errorProximity Matrix
57How to Define Inter-Cluster Similarity p1p3p5p4p2. . ..MINMAXGroup AverageDistance Between CentroidsOther methods driven by an objective functionWard’s Method uses squared errorProximity Matrix
58How to Define Inter-Cluster Similarity p1p3p5p4p2. . ..MINMAXGroup AverageDistance Between CentroidsOther methods driven by an objective functionWard’s Method uses squared errorProximity Matrix
59Cluster Similarity: MIN or Single Link Similarity of two clusters is based on the two most similar (closest) points in the different clustersDetermined by one pair of points, i.e., by one link in the proximity graph.12345
60Hierarchical Clustering: MIN 51234564321Nested ClustersDendrogram
61Strength of MIN Two Clusters Original Points Can handle non-elliptical shapes
62Limitations of MIN Two Clusters Original Points Sensitive to noise and outliers
63Cluster Similarity: MAX or Complete Linkage Similarity of two clusters is based on the two least similar (most distant) points in the different clustersDetermined by all pairs of points in the two clusters12345
64Hierarchical Clustering: MAX 54123456231Nested ClustersDendrogram
65Strength of MAX Two Clusters Original Points Less susceptible to noise and outliers
66Limitations of MAX Two Clusters Original Points Tends to break large clustersBiased towards globular clusters
67Cluster Similarity: Group Average Proximity of two clusters is the average of pairwise proximity between points in the two clusters.Need to use average connectivity for scalability since total proximity favors large clusters12345
68Hierarchical Clustering: Group Average 54123456231Nested ClustersDendrogram
69Hierarchical Clustering: Group Average Compromise between Single and Complete LinkStrengthsLess susceptible to noise and outliersLimitationsBiased towards globular clusters
70Cluster Similarity: Ward’s Method Similarity of two clusters is based on the increase in squared error when two clusters are mergedSimilar to group average if distance between points is distance squaredLess susceptible to noise and outliersBiased towards globular clustersHierarchical analogue of K-meansCan be used to initialize K-means
71Hierarchical Clustering: Time and Space requirements O(N2) space since it uses the proximity matrix.N is the number of points.O(N3) time in many casesThere are N steps and at each step the size, N2, proximity matrix must be updated and searchedComplexity can be reduced to O(N2 log(N) ) time for some approaches
72Hierarchical Clustering: Problems and Limitations Once a decision is made to combine two clusters, it cannot be undoneNo objective function is directly minimizedDifferent schemes have problems with one or more of the following:Sensitivity to noise and outliersDifficulty handling different sized clusters and convex shapesBreaking large clusters
73Cluster ValidityFor supervised classification we have a variety of measures to evaluate how good our model isAccuracy, precision, recallFor cluster analysis, the analogous question is how to evaluate the “goodness” of the resulting clusters?But “clusters are in the eye of the beholder”!Then why do we want to evaluate them?To avoid finding patterns in noiseTo compare clustering algorithmsTo compare two sets of clustersTo compare two clusters
74Clusters found in Random Data DBSCANRandom PointsK-meansComplete Link
75Different Aspects of Cluster Validation Determining the clustering tendency of a set of data, i.e., distinguishing whether non-random structure actually exists in the data.Comparing the results of a cluster analysis to externally known results, e.g., to externally given class labels.Evaluating how well the results of a cluster analysis fit the data without reference to external information.- Use only the dataComparing the results of two different sets of cluster analyses to determine which is better.Determining the ‘correct’ number of clusters.For 2, 3, and 4, we can further distinguish whether we want to evaluate the entire clustering or just individual clusters.
76Measures of Cluster Validity Numerical measures that are applied to judge various aspects of cluster validity, are classified into the following three types.External Index: Used to measure the extent to which cluster labels match externally supplied class labels.EntropyInternal Index: Used to measure the goodness of a clustering structure without respect to external information.Sum of Squared Error (SSE)Relative Index: Used to compare two different clusterings or clusters.Often an external or internal index is used for this function, e.g., SSE or entropySometimes these are referred to as criteria instead of indicesHowever, sometimes criterion is the general strategy and index is the numerical measure that implements the criterion.
77Measuring Cluster Validity Via Correlation Two matricesProximity Matrix“Incidence” MatrixOne row and one column for each data pointAn entry is 1 if the associated pair of points belong to the same clusterAn entry is 0 if the associated pair of points belongs to different clustersCompute the correlation between the two matricesSince the matrices are symmetric, only the correlation between n(n-1) / 2 entries needs to be calculated.High correlation indicates that points that belong to the same cluster are close to each other.Not a good measure for some density or contiguity based clusters.
78Measuring Cluster Validity Via Correlation Correlation of incidence and proximity matrices for the K-means clusterings of the following two data sets.Order the similarity matrix with respect to cluster labels and inspect visually.Corr =Corr =Clusters in random data are not so crisp