|
Title:
|
UNIFYING THE SYNTAX OF ASSOCIATION RULES |
|
Author(s):
|
Michal Burda |
|
ISBN:
|
978-972-8924-88-1 |
|
Editors:
|
Ajith P. Abraham |
|
Year:
|
2009 |
|
Edition:
|
Single |
|
Keywords:
|
Association rules, data mining, typed relation, formalism. |
|
Type:
|
Full Paper |
|
First Page:
|
103 |
|
Last Page:
|
110 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
The discovery of association rules is one of the most Essentials disciplines of data mining. This paper studies various
types of association rules with focus to their syntax. Based on that study, a new formalism unifying the syntax and
capable of handling a wide range of association rule types is formally established. Such logic is intended as a tool for
further study of theoretical properties of various association rule types. |
|
|
|
|
|
|
