1994
Autores
BRITO, P;
Publicação
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Abstract
We study assertion objects that constitute a particular class of symbolic objects. Symbolic objects constitute a data analysis driven formalism, which can be compared to propositional calculus, but which is oriented toward the duality intension (characteristic properties) versus extension (set of all individuals verifying a given set of properties). The set of assertion objects is endowed with a partial order and a quasi-order. We focus on the property of completeness, which precisely expresses the duality intension-extension. The order structure of complete assertion objects is studied, using notions of lattice theory and Galois connection, and extending Wille's work to multiple-valued data. Two results are then obtained for particular cases.
1994
Autores
Brazdil, P; Gama, J; Henery, B;
Publicação
Machine Learning: ECML-94, European Conference on Machine Learning, Catania, Italy, April 6-8, 1994, Proceedings
Abstract
1994
Autores
Michie, D; Camacho, R;
Publicação
Machine Intelligence 13
Abstract
1994
Autores
MACKAY, RS; PINTO, AA; VANZEIJTS, JBJ;
Publicação
PHYSICS LETTERS A
Abstract
The coordinate change eigenvalues for the MacKay and van Zeijts period doubling renormalisation operator for bimodal 1D maps are derived. They are found in numerical computations of the spectrum at all the periodic orbits of renormalisation of period up to five.
1993
Autores
Diday, E; Brito, P; Mfoumoune, E;
Publicação
Progress in Artificial Intelligence, 6th Portuguese Conference on Artificial Intelligence, EPIA '93, Porto, Portugal, October 6-8, 1993, Proceedings
Abstract
Symbolic objects (Diday (1987, 1992), Brito, Diday (1990), Brito (1991)) allow to model data on the form of descriptions by intension, thus generalizing the usual tabular model of data analysis. This modelisation allows to take into account variability within a set. The formalism of symbolic objects has some notions in common with VL1, proposed by Michalski (1980); however VL1 is mainly based on prepositional and predicate calculus, while the formalism of symbolic objects allows for an explicit interpretation within its framework, by considering the duality intension-extension. That is, given a set of observations, we consider the couple (symbolic object — extension in the given set). This results from the wish to keep a statistics point of view. The need to represent non-deterministic knowledge, that is, data for which the values for the different variables are assigned a weight, led to considering an extension of assertion objects to probabilist objects (Diday 1992). In this case, data are represented by probability distributions on the variables observation sets. The notions previously defined for assertion objects are the generalized to this new kind of symbolic objects. Other extensions can be found in Diday (1992). © Springer-Verlag Berlin Heidelberg 1993.
1993
Autores
Brazdil, P;
Publicação
ECML
Abstract
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.