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

1995

Characterization of Classification Algorithms

Autores
Gama, J; Brazdil, P;

Publicação
Progress in Artificial Intelligence, 7th Portuguese Conference on Artificial Intelligence, EPIA '95, Funchal, Madeira Island, Portugal, October 3-6, 1995, Proceedings

Abstract
This paper is concerned with the problem of characterization of classification algorithms. The aim is to determine under what circumstances a particular classification algorithm is applicable. The method used involves generation of different kinds of models. These include regression and rule models, piecewise linear models (model trees) and instance based models. These are generated automatically on the basis of dataset characteristics and given test results. The lack of data is compensated for by various types of preprocessing. The models obtained are characterized by quantifying their predictive capability and the best models are identified. © Springer-Verlag Berlin Heidelberg 1995.

1995

Behavioral Cloning A Correction

Autores
Camacho, R; Michie, D;

Publicação
AI Magazine

Abstract

1995

Classifying C1+ structures on dynamical fractals: 1. The moduli space of solenoid functions for Markov maps on train tracks

Autores
Pinto, AA; Rand, DA;

Publicação
Ergodic Theory and Dynamical Systems

Abstract
Sullivan's scaling function provides a complete description of the smooth conjugacy classes of cookie-cutters. However, for smooth conjugacy classes of Markov maps on a train track, such as expanding circle maps and train track mappings induced by pseudo-Anosov systems, the generalisation of the scaling function suffers from a deficiency. It is difficult to characterise the structure of the set of those scaling functions which correspond to smooth mappings. We introduce a new invariant for Markov maps called the solenoid function. We prove that for any prescribed topological structure, there is a one-to-one correspondence between smooth conjugacy classes of smooth Markov maps and pseudo-Hölder solenoid functions. This gives a characterisation of the moduli space for smooth conjugacy classes of smooth Markov maps. For smooth expanding maps of the circle with degree d this moduli space is the space of Hölder continuous functions on the space {0,…, d - 1} satisfying the matching condition.

1995

Classifying C1+ structures on dynamical fractals: 2. Embedded trees

Autores
Pinto, AA; Rand, DA;

Publicação
Ergodic Theory and Dynamical Systems

Abstract
We classify the C1+a structures on embedded trees. This extends the results of Sullivan on embeddings of the binary tree to trees with arbitrary topology and to embeddings without bounded geometry and with contact points. We used these results in an earlier paper to describe the moduli spaces of smooth conjugacy classes of expanding maps and Markov maps on train tracks. In later papers we will use those results to do the same for pseudo-Anosov diffeomorphisms of surfaces. These results are also used in the classification of renormalisation limits of C1+a diffeomorphisms of the circle.

1994

Learning by Refining Algorithm Sketches

Autores
Brazdil, P; Jorge, A;

Publicação
ECAI

Abstract

1994

Use of Pyramids in Symbolic Data Analysis

Autores
Brito, P;

Publicação
New Approaches in Classification and Data Analysis - Studies in Classification, Data Analysis, and Knowledge Organization

Abstract

  • 505
  • 510