通过数据表中的簇族描述保持上和下聚集函数
Description of sup- and inf-preserving aggregation functions via families of clusters in data tables
摘要：
讨论和研究了聚集函数理论与形式概念分析之间的联系，从而填补了这两种理论之间的空白，一种是在数据融合领域，另一种是在数据采掘领域。我们展示了如何伽罗瓦连接可以用来描述一类重要的聚合函数保持上确界，并通过对偶，描述聚合函数保持下确界。我们发现的方法给出了这些类的优雅和完整的描述。我们的结果在某些双聚类模糊FCA为基础的方法也可能的应用进行了讨论。
英文摘要：
Connection between the theory of aggregation functions and formal concept analysis is discussed and studied, thus filling a gap in the literature by building a bridge between these two theories, one of them living in the world of data fusion, the second one in the area of data mining. We show how Galois connections can be used to describe an important class of aggregation functions preserving suprema, and, by duality, to describe aggregation functions preserving infima. Our discovered method gives an elegant and complete description of these classes. Also possible applications of our results within certain biclustering fuzzy FCA-based methods are discussed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
