Closed Sets for Labeled Data

  • Gemma C. Garriga
  • Petra Kralj
  • Nada Lavrač
Conference paper

DOI: 10.1007/11871637_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4213)
Cite this paper as:
Garriga G.C., Kralj P., Lavrač N. (2006) Closed Sets for Labeled Data. In: Fürnkranz J., Scheffer T., Spiliopoulou M. (eds) Knowledge Discovery in Databases: PKDD 2006. PKDD 2006. Lecture Notes in Computer Science, vol 4213. Springer, Berlin, Heidelberg

Abstract

Closed sets are being successfully applied in the context of compacted data representation for association rule learning. However, their use is mainly descriptive. This paper shows that, when considering labeled data, closed sets can be adapted for prediction and discrimination purposes by conveniently contrasting covering properties on positive and negative examples. We formally justify that these sets characterize the space of relevant combinations of features for discriminating the target class. In practice, identifying relevant/irrelevant combinations of features through closed sets is useful in many applications. Here we apply it to compacting emerging patterns and essential rules and to learn descriptions for subgroup discovery.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Gemma C. Garriga
    • 1
  • Petra Kralj
    • 2
  • Nada Lavrač
    • 2
    • 3
  1. 1.Universitat Politècnica de CatalunyaBarcelonaSpain
  2. 2.Jožef Stefan InstituteLjubljanaSlovenia
  3. 3.University of Nova GoricaNova GoricaSlovenia

Personalised recommendations