.png){kind=icon}
返回
Maximal c consensus meets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.inffus.2018.09.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a set S of subsets of a reference set X, we define the problem of finding c subsets of X that maximize the size of the intersection among the included subsets. Maximizing the size of the intersection means that they are subsets of the sets in S and they are as large as possible. We can understand the result of this problem as c consensus sets of S, or c consensus representatives of S. From the perspective of lattice theory, each representative will be a meet of some sets in S. In this paper we define formally this problem, and present heuristic algorithms to solve it. We also discuss the relationship with other established problems in the literature.
Keyword:
Maximal c consensus meets
consensus clustering
clustering
heuristic algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
15.5
论文数:
4.2K
被引数:
2.7W
机构
引用论文
Growth performance, haematology and serum biochemistry of African catfish (Clarias gariepinus) fingerlings fed graded levels of dietary fumonisin B1非洲cat鱼 (Clarias gariepinus) 鱼种的生长性能，血液学和血清生物化学饲喂分级水平的日粮伏马菌素B1
PREAI
分享收藏
分享收藏Consensus under a fuzzy context: Taxonomy, analysis framework AFRYCA and experimental case of study.png)
INFORMATION FUSION
INFORMATION FUSIONIF15.5
PREAI
分享收藏 没有更多内容
没有更多内容