Bottom Up Approach

Here given an input graph G= (V,E), all the vertices initially belong to their own clusters i.e., they are present as singleton items. The clusters are then gradually merged or grown into large clusters based on some criteria to obtain the desired decomposition. The bottom up approaches can further be classified as agglomerative and hierarchical.

• Agglomerative Clustering
• Hierarchical Clustering