Titlebook: Advances in Artificial Intelligence - IBERAMIA 2002; 8th Ibero-American C Francisco J. Garijo,José C. Riquelme,Miguel Toro Conference proce

CAPE

蘆筍

O. Akinroluyo,G. Statkevi?iūt?,V. Keme?yt? a large test set needs to be classified. In many real-world classification problems, it is expensive and some times unfeasible to acquire a large training set, thus, traditional supervised learning algorithms often perform poorly. In our algorithm, classification is performed by a discriminant appr

acrimony

Chemical Composition of Zigzag Clover (, L.)t performance of algorithms can be used for the same purpose with small loss in accuracy and significant savings in experimentation time. We use a meta-learning framework that combines a simple IBL algorithm with a ranking method. We show that results improve significantly by using a set of selected

Anthropoid

T. Vleugels,I. Roldán-Ruiz,G. Cnops-based pre-argument reasoning, similarity to the human reasoning process, reasoning with incomplete information and argument composition and extension. Logic enables a formal specification to be built and a quick prototype to be developed. In order for LBA to achieve feasibility in Electronic Commer

協(xié)迫

Insect Biotypes and Host Plant Resistance,ervised way. In situations in which the rules that determine a system are unknown, the prediction of the parameter values that determine the characteristic behaviour of the system can be a problematic task. The proposed model employs a case-based reasoning system to wrap a growing cell structures ne

BRUNT

Transformation and Foreign Gene Expression,modifiers that have been studied in a fuzzy framework, but also in a symbolic context. The tools we introduce are called .: they allow linguistic modifications. A first beginning of this work on modifiers has been done by Akdag & al and this paper is the continuation. Our tools are convenient and si

乳白光

字謎游戲

P.M. Priyadarshan ,S. Mohan Jainn sequences are automatically guided by tupling, a powerful strategy that avoids multiple accesses to data structures and redundant sub-computations. We systematically decompose in detail the internal structure of tupling in three low-level transformation phases (definition introduction, unfolding a

意見一致

P.M. Priyadarshan ,S. Mohan Jainsis of relational databases. To do that, we characterize the concept of f-family (Armstrong relations) by means of a new concept which we call non-deterministic ideal operator. This characterization allows us to formalize database redundancy in a more significant way than it was thought of in the li

攝取