Types of Recursive Computable Aggregations
| Autor: | Juan Tinguaro Rodríguez, Daniel Gómez, Javier Montero, Luis Garmendia, Luis Magdalena, Ramón González del Campo |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Algebra
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 021103 operations research Operator (computer programming) Relation (database) TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Data_MISCELLANEOUS 0211 other engineering and technologies 0202 electrical engineering electronic engineering information engineering Recursive functions 020201 artificial intelligence & image processing 02 engineering and technology Associative property |
| Zdroj: | FUZZ-IEEE |
| Popis: | In this paper the relation between aggregation functions, algorithms and computer programs is revisited, extending the concept of recursive aggregation operator by means of the recursive computable aggregation. In particular, two different recursive computable aggregation are distinguished: on the one hand, the hard recursive computable aggregation, which appears when there is a unique recursive function generating the aggregation, and are fully related to associativity; and on the other hand, the soft recursive computable aggregation, which appears when the number of elements to be aggregated is needed. Some illustrative examples are provided. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|