.png){kind=icon}
返回
Penalty-based aggregation of multidimensional data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.fss.2016.12.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Research in aggregation theory is nowadays still mostly focused on algorithms to summarize tuples consisting of observations in some real interval or of diverse general ordered structures. Of course, in practice of information processing many other data types between these two extreme cases are worth inspecting. This contribution deals with the aggregation of lists of data points in R-d for arbitrary d >= 1. Even though particular functions aiming to summarize multidimensional data have been discussed by researchers in data analysis, computational statistics and geometry, there is clearly a need to provide a comprehensive and unified model in which their properties like equivariances to geometric transformations, internality, and monotonicity may be studied at an appropriate level of generality. The proposed penalty-based approach serves as a common framework for all idempotent information aggregation methods, including componentwise functions, pairwise distance minimizers, and data depth-based medians. It also allows for deriving many new practically useful tools. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Multidimensional data aggregation
Penalty functions
Data depth
Centroid
Median
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
7.6K
被引数:
1.5W
机构
引用论文
分享收藏Monometrics and their role in the rationalisation of ranking rules单计量学及其在排名规则合理化中的作用.png)
INFORMATION FUSION
INFORMATION FUSIONIF15.5
PREAI
分享收藏
查看更多内容