Cluster Analysis
There are two major methods of clustering
n hierarchical clustering
n k-means clustering.
Hierarchical clustering
In hierarchical clustering the data are not partitioned into a particular cluster in a single step. Instead, a series of partitions takes place, which may run from a single cluster containing all objects to n clusters each containing a single object.
Hierarchical clustering may be represented by a two dimensional diagram known as dendogram which illustrates the fusions or divisions made at each successive stage of analysis.
Divisive Clustering(hierarchical): All the objects which we want to cluster are submerged into group and then dividing them into particular blocks.
Agglomerative methods
An agglomerative hierarchical clustering procedure produces a series of partitions of the data, say from 1 to n. The first number say ‘An’ consists of n single object 'clusters', the last A1, consists of single group. While clustering the numbers joins together the two clusters at each iteration which are closest together (most similar). Then the other group which are similar they then the other group and form another cluster.
Euclidean distance: Short distance from two points.
Higher number = more proximity=similarity=1
Lower number=more proximity=dissimilarity=0
An example of how Cluster forms of different mobile services and offers? Funused0-funused9 determine the offers and facilities of mobile services.
Posted By
Tushar Sonkusare
Roll no 12171 (marketing)

No comments:
Post a Comment