Polymorphic fuzzy signatures

The fuzzy signature [1], [2] approach is aimed at finding a hierarchically decomposed solutions by adding new elements to Zadeh's approach [3]. It tackles the problem by splitting the problem into hierarchically organized local sub-models and by applying more complex and heterogenous descriptors, more fit for the identification of extremely complex models. However, the computational time complexity still affects the fuzzy signatures as we were attempt to create an atomic fuzzy signature for each data point we get. Importantly, the atomic fuzzy signatures we store has properties we can make use of to make search over this structure computationally efficient. In this paper we introduce a new approach that uses the metadata about a set of fuzzy signatures to extract a Polymorphic Fuzzy Signature. Productively, a polymorphic fuzzy signature represents its base set of fuzzy signatures in a higher meta level which also allows search/inference, and so can reduce the computational time complexity of the inference process.