Advertisement
Published in:
2010 | OriginalPaper | Chapter
An XML Format for Association Rule Models Based on the GUHA Method
Authors : Tomáš Kliegr, Jan Rauch
Published in: Semantic Web Rules
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.