By Topic

On mean type aggregation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yager, R.R. ; Machine Intelligence Inst., Iona Coll., New Rochelle, NY, USA

We introduce and define the concept of mean aggregation of a collection of n numbers. We point out that the lack of associativity of this operation compounds the problem of the extending mean of n numbers to n+1 numbers. The closely related concepts of self identity and the centering property are introduced as one imperative for extending mean aggregation operators. The problem of weighted mean aggregation is studied. A new concept of prioritized mean aggregation is then introduced. We next show that the technique of selecting an element based upon the performance of a random experiment can be considered as a mean aggregation operation

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:26 ,  Issue: 2 )