Description of sup- and inf-preserving aggregation functions via families of clusters in data tables

作者：Halas Radomir; Mesiar Radko; Pocs Jozef^*

来源：Information Sciences, 2017, 400: 173-183.

DOI：10.1016/j.ins.2017.02.060

• Sup-preserving aggregation function
• Bounded lattice
• Galois connection

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.

• 出版日期2017-8