.png){kind=icon}
Return
Maximal c consensus meets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.inffus.2018.09.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Maximal c consensus meets
consensus clustering
clustering
heuristic algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
15.5
Papers:
4.3K
Citations:
2.7W
Organization
Cited Papers
ShareSaveShareSave
ShareSaveShareSaveConsensus under a fuzzy context: Taxonomy, analysis framework AFRYCA and experimental case of study.png)
INFORMATION FUSION
INFORMATION FUSIONIF15.5
PREAI
ShareSave no more
no more