Extension based proximities between constrained Boolean symbolic objects

In conventional exploratory data analysis each variable takes a single value. In real life applications, the data will be more general spreading from single values to interval or set of values and including constraints between variables. Such data set are identified as Boolean symbolic data. The purpose of this paper is to present two extension based approaches to calculate proximities between constrained Boolean symbolic objects. Both approaches compares a pair of these objects at the level of the whole set of variables by functions based on the description potential of its join, union and conjunctions. The first comparison function is inspired on a function proposed by Ichino and Yaguchi (1994) while the others are based on the proximity indices related to arrays of binary variables.