Purpose And Process Of A Cluster Analysis Cultural Studies Essay

Published:

This essay has been submitted by a student. This is not an example of the work written by our professional essay writers.

Cluster analysis is an important method for classification of a many of information in Manageable and meaningful groups. Cluster analysis is used for explorative grouping objects according to their similarity or Non-similarity (distance). Goal of cluster analysis is the formation of homogeneous groups from objects that are possible similar (small distance from each other) whereas the objects from different groups distinguish clearly (large distance from each other).

In principle it is also possible to group persons or objects because of their similarity to each other according to their dissimilarity and distance each other. By the cluster objects with high similarity assigns same clusters and objects low similarity (or with great dissimilarity) assigns different Clusters. Therefore a measure is needed that quantifies the similarity of objects.

Divisive methods start the opposite way: in the beginning all objects from a single, large cluster, which is then divided step by step by as each dissimilar groups are separated, that caused more and more smaller clusters. Let this continue until finally all objects are their own cluster.

Agglomerative hierarchical clustering techniques are by far the most common method. The grouping of all objects in a single large cluster at the end of agglomerative algorithm is of course not conclusive. Useful, rather, in the course of the increasing fusion of the clusters to find an intermediate state until small individual clusters no longer exist, but in the already-formed larger clusters are relatively homogeneous and can be interpreted content.

A hierarchical clustering is often displayed using a tree-like diagram called a dendogram, which displays both the cluster-subcluster relationship and the order in which the clusters were merged (aglomerative view) or split (divisive view). For sets of thoe dimensional points, such as those that we will use as examples, a hierarchical clustering can aslo be graphically represented using a nested cluster diagram. Figure 1 shows an example of these two types of figures for a set of four two-dimensional points.

This method is distinct from all other methods because it uses an analysis of variance approach to evaluate the distances between clusters. In short, this method attempts to minimize the Sum of Squares (SS) of any two (hypothetical) clusters that can be formed at each step. Typical of properties of variance for statistical decision-making, this tends to create two many clusters or clusters of small sizes because the more the observations scattered, the sum of squares makes the distance bigger.

Large datasets are possible with K-means clustering, unlike hierarchical clustering, because K-means clustering does not require prior computation of a proximity matrix of the distance/similarity of every case with every other case. Because cases may be shifted from one cluster to another during the iterative process of converging on a solution, k-means clustering is a type of "relocation clustering method." However, there is also a variant called "agglomerative K-means clustering," where the solution is constrained to force a given case to remain in its initial cluster.

Firstly K initial centroids are choosen, where K is a user-specified parameter, namely, the number of clusters desired. Every point is then assigned to the nearest centroid, and each collection of points assigned to a centroid is a cluster. The centroid of each cluster is then updated based on the points assigned to the cluster. We repeat the assignment and update steps until no point changes clusters, or equivalently, until the centroids remain the same.

K-means cluster analysis uses Euclidean distance. The researcher must specify in advance the desired number of clusters, K. Initial cluster centers are chosen randomly in a first pass of the data, then each additional iteration groups observations based on nearest Euclidean distance to the mean of the cluster. That is, the algorithm seeks to minimize within-cluster variance and maximize variability between clusters in an ANOVA-like fashion. Cluster centers change at each pass. The process continues until cluster means do not shift more than a given cut-off value or the iteration limit is reached.

4.2 Fuzzy Clustering

In a fuzzy clusterin, every objects belongs to each cluster with a membership rate that is between 0 (absolutely doesn’t belong) and 1 (absolutely belongs). In other words, clusters is viewed as fuzzy sets. (Mathematically, a fuzzy set is one in which an object belongs to any set with a weight that is between 0 and 1. In fuzzy clustering it pften impose the addtional constraint that the sum of the weights for each object must equal1.) similarly, pobablistic techniques compute the probability with which each point belongs to each cluster, and these probabilities must alsı sum to 1. Because the membership weights or probabilities for any object sum to 1, a fuzzy or probabilistic clustering doesn’t address true multiclass situations, such as the case of a student employee, where an object belongs to multiple classes. Instead,these approaches are most appropriate for avoiding the arbitrariness of assigning an object to only one cluster when it may be close to several. In practice, a fuzzy or probabilistic clustering is often converted to an exclusive clustering by assigning each object to the cluster in which is membership weight or probability is highest.

Writing Services

Essay Writing
Service

Find out how the very best essay writing service can help you accomplish more and achieve higher marks today.

Assignment Writing Service

From complicated assignments to tricky tasks, our experts can tackle virtually any question thrown at them.

Dissertation Writing Service

A dissertation (also known as a thesis or research project) is probably the most important piece of work for any student! From full dissertations to individual chapters, we’re on hand to support you.

Coursework Writing Service

Our expert qualified writers can help you get your coursework right first time, every time.

Dissertation Proposal Service

The first step to completing a dissertation is to create a proposal that talks about what you wish to do. Our experts can design suitable methodologies - perfect to help you get started with a dissertation.

Report Writing
Service

Reports for any audience. Perfectly structured, professionally written, and tailored to suit your exact requirements.

Essay Skeleton Answer Service

If you’re just looking for some help to get started on an essay, our outline service provides you with a perfect essay plan.

Marking & Proofreading Service

Not sure if your work is hitting the mark? Struggling to get feedback from your lecturer? Our premium marking service was created just for you - get the feedback you deserve now.

Exam Revision
Service

Exams can be one of the most stressful experiences you’ll ever have! Revision is key, and we’re here to help. With custom created revision notes and exam answers, you’ll never feel underprepared again.