Contrastive antichains in hierarchies - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Contrastive antichains in hierarchies


Concepts are often described in terms of positive integer-valued attributes that are organized in a hierarchy. For example, cities can be described in terms of how many places there are of various types (e.g. nightlife spots, residences, food venues), and these places are organized in a hierarchy (e.g. a Portuguese restaurant is a type of food venue). This hierarchy imposes particular constraints on the values of related attributes---e.g. there cannot be more Portuguese restaurants than food venues. Moreover, knowing that a city has many food venues makes it less surprising that it also has many Portuguese restaurants, and vice versa. In the present paper, we attempt to characterize such concepts in terms of so-called contrastive antichains: particular kinds of subsets of their attributes and their values. We address the question of when a contrastive antichain is interesting, in the sense that it concisely describes the unique aspects of the concept, and this while duly taking into account the known attribute dependencies implied by the hierarchy. Our approach is capable of accounting for previously identified contrastive antichains, making iterative mining possible. Besides the interestingness measure, we also present an algorithm that scales well in practice, and demonstrate the usefulness of the method in an extensive empirical results section.
Fichier principal
Vignette du fichier
KDDpaper.pdf (1.63 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02114775 , version 1 (02-10-2019)



Anes Bendimerad, Jefrey Lijffijt, Marc Plantevit, Céline Robardet, Tijl de Bie. Contrastive antichains in hierarchies. SIGKDD 2019, Aug 2019, Anchorage, Alaska, United States. pp.294:304, ⟨10.1145/3292500.3330954⟩. ⟨hal-02114775⟩
158 View
90 Download



Gmail Facebook Twitter LinkedIn More