Matching symbolic objects
Matching is the process of comparing two or more structures to discover their likenesses or differences. In its simplest form, matching is the process of comparing two structures or patterns just for equality. In more complex cases, the matching process compares the description of a class \(C\) with the description of an individual \(k\) in order to establish whether the individual can be considered as an instance of the class. Matching two structures is a problem common to many problems, like symbolic classification, pattern recognition, data mining and expert systems. The definition of a matching operator for Boolean symbolic objects is very important for the development of several symbolic data analysis techniques, such as symbolic factor analysis. In this paper, two forms of matching between Boolean symbolic objects are proposed: The canonical one and the flexible one. The former checks for an exact match whereas the latter one computes a degree of matching. For the entire collection see [Zbl 1039.62501].
This page was built for publication: Matching symbolic objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2756639)
