This chapter introduces computational proximity. Basically, computational proximity (CP) is
an algorithmic approach to finding nonempty sets of points that are either close to each other …

This paper explores the properties of subsethood measures, including boundary conditions,
monotonicity, duality, and additivity. These properties can be used as candidates of axioms …

Rough inclusion functions are mappings considered in rough set theory with which one can
measure the degree of inclusion of a set (information granule) in a set (information granule) …

Data analytics is a process to discover useful information in data, draw valuable
conclusions, and help users make wise decisions. In most occasions, the conclusions can …