Summary
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
De Carvalho, F.A.T. (1994): Proximity Coefficients between Boolean symbolic objects. In New Approaches in Classification and Data Analysis, Diday, E. et al. (eds.), 387–394. Springer-Verlag, Heidelberg.
Diday, E. (1991): Des objets de l’analyse de données à ceux de l’analyse de connaissances. In Induction symbolique et numérique à partir de donnés. Diday, E. and Kodratoff, Y. (eds.), 9–75, Cepadue Editions, Toulouse.
Gowda, N.C. and Diday, E. (1991): Symbolic clustering using a new dissimilarity measure. Pattern Recognition, 24, 6, 567–578.
Ichino, M. and Yaguchi. H. (1994): Generalised Minkowsky Metrics for Mixed Features Type Data Analysis. IEEE Transactions on System. Man and Cybernetics, 24, 4, 698–708.
Vignes, R. (1991): Caractérisation automatique de groupes biologiques. Thèse de Doctorat. Université Paris-VI Pierre et Marie Curie, Paris.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Japan
About this paper
Cite this paper
de Carvalho, F.T. (1998). Extension based proximities between constrained Boolean symbolic objects. In: Hayashi, C., Yajima, K., Bock, HH., Ohsumi, N., Tanaka, Y., Baba, Y. (eds) Data Science, Classification, and Related Methods. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Tokyo. https://doi.org/10.1007/978-4-431-65950-1_41
Download citation
DOI: https://doi.org/10.1007/978-4-431-65950-1_41
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-70208-5
Online ISBN: 978-4-431-65950-1
eBook Packages: Springer Book Archive