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

10/09/2018
by   Radomír Halaš, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset