Clustering stock price volatility using intuitionistic fuzzy sets

Clustering involves gathering a collection of objects into homogeneous groups or clusters, such that objects in the same cluster are more similar when compared to objects present in other groups. Clustering algorithms that generate a tree of clusters called dendrogram which can be either divisive or agglomerative. The partitional clustering gives a single partition of objects, with a predefined K number of clusters. The most popular partition clustering approaches are: k-means and fuzzy C-means (FCM). In k-means clustering, data are divided into a number of clusters where data elements belong to exactly one cluster. The k-means clustering works well when data elements are well separable. To overcome the problem of non-separability, FCM and IFCM clustering algorithm were proposed. Here we review the use of FCM/IFCM with reference to the problem of market volatility.