Learning aggregation weights from 3-tuple comparison sets
Contribuinte(s) |
[Unknown] |
---|---|
Data(s) |
01/01/2013
|
Resumo |
An important task in multiple-criteria decision making is how to learn the weights and parameters of an aggregation function from empirical data. We consider this in the context of quantifying ecological diversity, where such data is to be obtained as a set of pairwise comparisons specifying that one community should be considered more diverse than another. A problem that arises is how to collect a sufficient amount of data for reliable model determination without overloading individuals with the number of comparisons they need to make. After providing an algorithm for determining criteria weights and an overall ranking from such information, we then investigate the improvement in accuracy if ranked 3-tuples are supplied instead of pairs. We found that aggregation models could be determined accurately from significantly fewer 3-tuple comparisons than pairs. © 2013 IEEE. |
Identificador | |
Idioma(s) |
eng |
Publicador |
IEEE |
Relação |
http://dro.deakin.edu.au/eserv/DU:30058800/beliakov-learning-post-2013.pdf http://dro.deakin.edu.au/eserv/DU:30058800/beliakov-learningaggregation-2013.pdf http://dro.deakin.edu.au/eserv/DU:30058800/evid-ifsaconf-2013.pdf http://dro.deakin.edu.au/eserv/DU:30058800/evid-learningpeerreview-2013.pdf http://dro.deakin.edu.au/eserv/DU:30058800/reasonforpostprint.pdf http://doi.org/10.1109/IFSA-NAFIPS.2013.6608604 |
Direitos |
2013, IEEE |
Tipo |
Conference Paper |