Instant feedback on discovered association rules with PMML-based query-by-example

Authors:
Tomáš Kliegr;Andrej Hazucha;Tomáš Marek
Affiliations:
University of Economics, Prague, Department of Information and Knowledge, Engineering, Czech Republic;University of Economics, Prague, Department of Information and Knowledge, Engineering, Czech Republic;University of Economics, Prague, Department of Information and Knowledge, Engineering, Czech Republic
Venue:
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Year:
2011

Citing 2
Cited 1

The GUHA method and its meaning for data mining

Journal of Computer and System Sciences
A framework for mining interesting pattern sets

Proceedings of the ACM SIGKDD Workshop on Useful Patterns

Association rule mining following the web search paradigm

ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The long-pending research challenge of the association rule mining task is to identify, out of the multitude of discovered rules, the ones that are interesting for the domain expert. We will demonstrate a new feature of the SEWEBAR-CMS system that allows using any of the rules as a query-by-example, and in one click, discover whether this rule is in some interesting relation to a rule already stored in a knowledge base. New relations can be plugged in using a PMML-like XML-based declarative language through XSLT transformations.