Flexible Matching of Boolean Symbolic Objects
Floriana Esposito, Donato Malerba, Francesca Alessandra Lisi · CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro) · 1998
Matching is the process of comparing two or more structures to discover their likenesses or differences. It is a common operation performed in symbolic classification, pattern recognition, data mining and expert systems. The definition of a matching operator for Boolean symbolic objects is important for the development of symbolic data analysis techniques. In this paper we give the definition of canonical matching of Boolean symbolic objects, and then we extend it in order to take into account only partial matching caused by the presence of noise. The new definition of flexible matching is based on the probability theory. Some experimental results are reported.