A framework for redescription set construction

TL;DR

This paper introduces a flexible framework for constructing large, heterogeneous redescription sets using a novel algorithm and refinement procedure, enhancing the discovery of diverse, accurate descriptions in data with missing values.

Contribution

The framework enables creation of large, diverse redescription sets with a new conjunctive refinement and variability handling, outperforming existing methods in efficiency and versatility.

Findings

The framework produces larger, more accurate redescription sets.

It effectively handles missing data in redescription accuracy.

Empirical results show improved performance over state-of-the-art algorithms.

Abstract

Redescription mining is a field of knowledge discovery that aims at finding different descriptions of similar subsets of instances in the data. These descriptions are represented as rules inferred from one or more disjoint sets of attributes, called views. As such, they support knowledge discovery process and help domain experts in formulating new hypotheses or constructing new knowledge bases and decision support systems. In contrast to previous approaches that typically create one smaller set of redescriptions satisfying a pre-defined set of constraints, we introduce a framework that creates large and heterogeneous redescription set from which user/expert can extract compact sets of differing properties, according to its own preferences. Construction of large and heterogeneous redescription set relies on CLUS-RM algorithm and a novel, conjunctive refinement procedure that facilitates generation of larger and more accurate redescription sets. The work also introduces the variability of redescription accuracy when missing values are present in the data, which significantly extends applicability of the method. Crucial part of the framework is the redescription set extraction based on heuristic multi-objective optimization procedure that allows user to define importance levels towards one or more redescription quality criteria. We provide both theoretical and empirical comparison of the novel framework against current state of the art redescription mining algorithms and show that it represents more efficient and versatile approach for mining redescriptions from data.