Binary Tree Based Construction of N-Uninorm Aggregation Operators

Akella, P (2013) Binary Tree Based Construction of N-Uninorm Aggregation Operators. In: IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2013, 7-10, July 2013, Hyderabad; India.

Full text not available from this repository. (Request a copy)


The concept of n-uninorm aggregation operators was introduced as generalization of uninorms and nullnorms. The structure of the operator is based on the existence of an n-neutral element for an associative, monotone increasing in both variables and commutative binary operator on [0, 1]. It has been shown that the number of subclasses of n-uninorms is the (n + 1) th Catalan number. Stack sortable permutations and binary trees are well studied as combinatorial objects whose total number are also enumerated by Catalan numbers. We give a one-to-one correspondence between n-uninorms, stack sortable permutations and binary trees and use it to give an iterative algorithm to construct the operator on [0, 1]2 for any of its Catalan number of subclasses

[error in script]
IITH Creators:
IITH CreatorsORCiD
Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Aggregation operators; Binary trees; Catalan numbers; N-uninorms; Stack sortable permutations
Subjects: ?? sub3.8 ??
Divisions: Department of Mathematics
Depositing User: Team Library
Date Deposited: 21 Nov 2014 07:50
Last Modified: 05 Jan 2016 11:30
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 904 Statistics for this ePrint Item