A new Granular Computing approach for sequences representation and classification

In this paper we present an innovative procedure for sequence mining and representation. It can be used as its own in Data Mining problems or as the core of a classification system based on a Granular Computing approach to represent sequences in a suited embedding space. By adopting an inexact sequence matching procedure, the algorithm is able to extract a symbols alphabet of frequent subsequences to be used as prototypes for the embedding stage. Experimental evaluation over both synthetically generated and biological datasets confirms that the modeling system is able to synthesize effective models when facing even complex and noisy problems defined by frequency-based classification rules.