Mostra el registre d'ítem simple
Inference of fuzzy regular grammars from examples
dc.contributor.author | Fortes Ruiz, Inmaculada |
dc.contributor.author | Morales Bueno, Rafael |
dc.contributor.author | Pérez de la Cruz Molina, José Luís |
dc.contributor.author | Triguero Ruiz, Francisco |
dc.contributor.author | Comino, M. A. |
dc.date.accessioned | 2007-09-26T09:26:14Z |
dc.date.available | 2007-09-26T09:26:14Z |
dc.date.issued | 1999 |
dc.identifier.issn | 1134-5632 |
dc.identifier.uri | http://hdl.handle.net/2099/3559 |
dc.description.abstract | Let us consider the following situation: An oracle provides us with a finite set of examples considered as words belonging to a regular language. This oracle is not available again. In this paper we study a new and general inference algorithm of fuzzy regular grammars based on this set of words. This algorithm is created by adapting a process discovery method. The main issues in the adaptation are the development of a fuzzy version, the assignation of membership degrees to each production in the grammar, and the treatment of consecutive repeated symbols. In addition to this inference algorithm we present a practical use for automatically generating artistic designs. Specifically, we have collected a set of paintings by Piet Mondrian (1872-1944) and obtained new Mondrian-style paintings. To achieve this, we designed a code to transform the paintings into strings and also to carry out the reverse conversion. We view these strings, which represent the paintings, as words belonging to a regular language and from this finite set of examples infer a fuzzy regular grammar. The entire process has been implemented and some new paintings from the inference algorithm have been obtained. An art expert has judged that these computer-generated paintings are fully in the spirit of those painted by Mondrian. |
dc.format.extent | 277-291 |
dc.language.iso | eng |
dc.publisher | Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica |
dc.relation.ispartof | Mathware & soft computing . 1999 Vol. 6 Núm. 2 [ -3 ] |
dc.rights | Reconeixement-NoComercial-CompartirIgual 3.0 Espanya |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject.other | Fuzzy regular grammars |
dc.subject.other | Process discovery |
dc.subject.other | Fuzzy relations |
dc.subject.other | Computational learning |
dc.title | Inference of fuzzy regular grammars from examples |
dc.type | Article |
dc.subject.lemac | Teoria de la computació |
dc.subject.lemac | Aprenentatge automàtic |
dc.subject.ams | Classificació AMS::68 Computer science::68Q Theory of computing |
dc.rights.access | Open Access |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
1999, Vol. VI, Núm. 2-3 [16]
EUSTYL'98