Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Iglesias Vazquez, F., Zseby, T., & Zimek, A. (2020). Interpretability and Refinement of Clustering. In Proceedings of the 7th DSAA 2020 (pp. 21–29). http://hdl.handle.net/20.500.12708/77183
The difficulty to validate clustering reliability hinders the adoption of clustering in real-life applications. We pro-pose: (a) a set of symbolic representations to interpret problem spaces and (b) the CluReAL algorithm to refine any clustering result regardless of the used technique. Both approaches are grounded by recently published absolute cluster validity indices.Conducted experiments show h...
The difficulty to validate clustering reliability hinders the adoption of clustering in real-life applications. We pro-pose: (a) a set of symbolic representations to interpret problem spaces and (b) the CluReAL algorithm to refine any clustering result regardless of the used technique. Both approaches are grounded by recently published absolute cluster validity indices.Conducted experiments show how the refinement algorithm improves performances in a wide variety of scenarios and builds more interpretable solutions, whereas symbolic representations are shown to offer explainable summaries of problem contexts.Refinement and interpretability are both crucial to reduce failure and increase performance control and operational awareness in processes that depend on clustering.
en
Research Areas:
Logic and Computation: 70% Mathematical and Algorithmic Foundations: 30%