Abstract
Penalty functions have been used for data aggregation since Yager introduced his “general theory of information aggregation” back in 1993. Obviously, the ideas of Yager have long time been surpassed. However, over the years, the use of penalty functions has shifted towards the aggregation of values in a closed interval. Here, we propose to return to the origin of penalty-based data aggregation and to expand the current definition of penalty functions beyond the confinement to closed intervals. We do this by bringing to the field of data aggregation an old acquaintance of the early scholars of geometry: betweenness relations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
