TY - GEN
T1 - Measures for ranking estimation performance based on single or multiple performance metrics
AU - Yin, Hanlin
AU - Lan, Jian
AU - Rong Li, X.
PY - 2013
Y1 - 2013
N2 - There are several error metrics for estimation performance evaluation. To rank the performance of estimators, a popular method is using the same error metric of performance. It is not without controversy. First, this ranking method depending on the 'marginal' information without considering the 'joint' information among the estimators is one-sided since different error metrics reflect different aspects of performance. Second, ranking according to different error metrics may lead to different results. Thus, we propose to use the 'joint' information just like Pitman's closeness measure (PCM) to rank the performance of estimators. However, one drawback of PCM, named nontransitivity, brings big trouble for estimation performance ranking. To rank estimators utilizing the 'joint' information, we propose a new approach using a so-called estimator ranking vector (ERV). The elements of ERV reflect how good the corresponding estimators are. Order-preserving mappings are proposed to obtain ERV, which, however, may not be unique. Then we use three specific mappings (i.e., linear, contraction, and concave, respectively) to solve this problem. Linear mappings can be easily applied and the other two mappings broaden the application domain of ERV. The ranking vector can also be used in multiple-attribute ranking problem. It does not need data normalization.
AB - There are several error metrics for estimation performance evaluation. To rank the performance of estimators, a popular method is using the same error metric of performance. It is not without controversy. First, this ranking method depending on the 'marginal' information without considering the 'joint' information among the estimators is one-sided since different error metrics reflect different aspects of performance. Second, ranking according to different error metrics may lead to different results. Thus, we propose to use the 'joint' information just like Pitman's closeness measure (PCM) to rank the performance of estimators. However, one drawback of PCM, named nontransitivity, brings big trouble for estimation performance ranking. To rank estimators utilizing the 'joint' information, we propose a new approach using a so-called estimator ranking vector (ERV). The elements of ERV reflect how good the corresponding estimators are. Order-preserving mappings are proposed to obtain ERV, which, however, may not be unique. Then we use three specific mappings (i.e., linear, contraction, and concave, respectively) to solve this problem. Linear mappings can be easily applied and the other two mappings broaden the application domain of ERV. The ranking vector can also be used in multiple-attribute ranking problem. It does not need data normalization.
KW - Performance ranking
KW - estimation
KW - mapping
KW - ranking vector
UR - https://www.scopus.com/pages/publications/84890843432
M3 - 会议稿件
AN - SCOPUS:84890843432
SN - 9786058631113
T3 - Proceedings of the 16th International Conference on Information Fusion, FUSION 2013
SP - 453
EP - 460
BT - Proceedings of the 16th International Conference on Information Fusion, FUSION 2013
T2 - 16th International Conference of Information Fusion, FUSION 2013
Y2 - 9 July 2013 through 12 July 2013
ER -