Abstract
Symbolic objects can deal with domain knowledge expressed by dependency rules. However this leads to exponential computation time. In a previous paper we presented an approach called Normal Symbolic Form (NSF) which is applicable when the dependency rules form a tree or a set of trees. This approach leads to a polynomial computation time, but may sometimes bring about an exponential explosion of space memory requirement. The goal of this paper is to study this possible memory requirement and to see how it is bounded according to the nature of the variables and the natur e of the rules. We will see that the memory growth is bounded, and that in most cases, instead of a growth, we will obtain a reduction.
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
BOCK, H.-H. and DIDAY, E. (2000): Analysis of Symbolic Data. Springer, Berlin.
CODD, E. E. (1972): Further Normalization of the Data Relational Model. in R. Rustin (Ed.): Data Base Systems, Prentice-Hall, Englewood Cliffs, N.J., 33–64.
CSERNEL, M. (1998): On the Complexity of Computation with Symbolic Objects using Domain Knowledge, in Rizzi, Vicchi, Bock (Eds.): Advances in Data Science and Classification, Springer, Berlin, 403–408.
CSERNEL, M. and De Carvalho, F. A. T. (1999): Usual Operations with Symbolic Data under Normal Symbolic Form. Applied Stochastic Models in Business and Industry, Vol. 15, 241–257.
DE CARVALHO, F. A. T. (1998): Extension based Proximities between Constrained Boolean Symbolic Objects, in Hayashi, Ohsumi, Yajima, Tanaka, Bock, Baba (Eds.): Data Science, Classification and Related Methods, Springer, Berlin, 370–378.
VIGNES, R. (1991): Caractérisation Automatique de Groupes Biologiques. Thèse de Doctorat. Université Paris VI, Paris.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Csernel, M., de Carvalho, F.A.T. (2003). On Memory Requirement with Normal Symbolic Form. In: Schwaiger, M., Opitz, O. (eds) Exploratory Data Analysis in Empirical Research. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55721-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-55721-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44183-0
Online ISBN: 978-3-642-55721-7
eBook Packages: Springer Book Archive