Data granulation emerged as an important paradigm in modeling and computing with uncertainty, exploiting information granules as the main mathematical constructs involved in the context of granular computing. In this paper, we comment on the importance of data granulation in computational intelligence methods. Toward this aim, we discuss also the peculiar aspects related to the analysis of non-geometric patterns, which have recently attracted considerable attention by researchers. As a conclusion, we elaborate over the fundamental, conceptual problems underlying the process of data granulation, which drive the quest for a sound theory of granular computing.
Defuzzification plays an important role in the applications of Interval Type-2 Fuzzy Sets (IT2FSs). However computational complexity of existing defuzzification methods has turned this procedure to be an important bottleneck toward the use of IT2FSs. It has been proved that the Nie-Tan method is an accurate discretizing based method for calculating the Center of Gravity (COG) of IT2FSs. In this paper we propose a fast and accurate method for calculating the Center of Gravity (COG) - Nie-Tan defuzzification - of polygonal IT2FSs on discrete and continuous domains without the need of discretization. The proposed method calculates accurate COG for trapezoidal and triangular IT2FSs as special cases of polygonal IT2FSs. Moreover, any IT2FS can be approximated by a polygonal IT2FS -the higher the order of polygonal IT2FS, the better the approximation. Hence using the proposed method on an IT2FS that is approximated by an appropriate polygonal IT2FS, results in a more accurate COG.