Abstract
The initial process for the granulation of information is the clustering of data, once the relationships between this data have been found these become clusters, each cluster represents a coarse granule, whereas each data point represents a fine granule. All clustering algorithms find these relationships by different means, yet the notion of the principle of justifiable granularity is not considered by any of them, since it is a recent idea in the area of Granular Computing. This paper describes a first approach in the analysis of the relationship between the size of the clusters found and their intrinsic implementation of the principle of justifiable granularity. An analysis is done with two datasets, simplefit and iris, and two clustering algorithms, subtractive and granular gravitational.