Some Properties of the Left Recursive Form of the Convex Combination Linguistic Aggregator

The Left Recursive Form of the Convex Combination (CONV-LRF) is a linguistic aggregation operator which has been recently proposed in the framework of fuzzy ontology learning. The objective of this paper is to study some properties of the operator, namely commutativity, smoothness, internality, monotonicity, and orness. Our results show that, contrary to what preliminary experiments suggested, CONV-LRF has a similar orness that the Right Recursive Form (CONV-RRF).