An XML Format for Association Rule Models Based on the GUHA Method

  • Tomáš Kliegr
  • Jan Rauch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6403)

Abstract

This paper proposes the GUHA AR Model, an XML Schema-based formalism for representing the setting and results of association rule (AR) mining tasks. In contrast to the item-based representation of the PMML 4.0 AssociationModel, the proposed expresses the association rule as a couple of general boolean attributes related by condition on one or more arbitrary interest measures. This makes the GUHA AR Model suitable also for other than apriori-based AR mining algorithms, such as those mining for disjunctive or negative ARs. In addition, there are practically important research results on special logical calculi formulas which correspond to such association rules. The GUHA AR Model is intended as a replacement of the PMML AssociationModel. It is tightly linked to the Background Knowledge Exchange Format (BKEF), an XML schema proposed for representation of data-mining related domain knowledge, and to the AR Data Mining Ontology ARON.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Tomáš Kliegr
    • 1
  • Jan Rauch
    • 1
  1. 1.Dept. Information and Knowledge EngineeringUniversity of Economics, PraguePraha 3Czech Republic

Personalised recommendations