Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por LIAAD

1993

Learning Probabilistic Models by Conceptual Pyramidal Clustering

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

Machine Learning: ECML-93, European Conference on Machine Learning, Vienna, Austria, April 5-7, 1993, Proceedings

Autores
Brazdil, P;

Publicação
ECML

Abstract

1992

APPROACHES TO INDUCTIVE LOGIC PROGRAMMING

Autores
BRAZDIL, PB;

Publicação
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE

Abstract
Inductive Logic Programming (ILP) is concerned with construction of logic programs from examples. It shares many concerns of Machine Learning (ML), but is committed to logic. As logic can help to provide a basis for elaborating such a methodology for learning, the area of ILP has attracted a wide attention of many researchers1. This paper reviews some of the methods and techniques in ML that exploit logic.

1992

Approaches to inductive logic programming

Autores
Brazdil, PB;

Publicação
Advanced Topics in Artificial Intelligence - Lecture Notes in Computer Science

Abstract

1992

A Method of Processing Unknown Attribute Values by ID3

Autores
Brazdil, P; Bruha, I;

Publicação
Computing and Information - ICCI'92, Fourth International Conference on Computing and Information, Toronto, Ontario, Canada, May 28-30, 1992, Proceedings

Abstract

1992

GLOBAL PHASE-SPACE UNIVERSALITY, SMOOTH CONJUGACIES AND RENORMALIZATION .2. THE CK+ALPHA CASE USING RAPID CONVERGENCE OF MARKOV FAMILIES

Autores
PINTO, AA; RAND, DA;

Publicação
NONLINEARITY

Abstract
We prove that the speed of convergence of two Markov families determines the smoothness of the conjugacy between them. One of the applications of this result that we give is that the attractors of any two quadratic foldings at the Feigenbaum accumulation point of period doubling are C2+0.11 conjugate. Our main result provides the basis for a complete unification of renormalization and smooth conjugacy results which includes both the classical theorems and more recent results about critical systems.

  • 510
  • 513