| Creator |
|
|
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Crossref DOI |
|
| Related DOI |
|
|
|
| Related URI |
|
|
|
| Relation |
|
|
|
| Abstract |
This paper presents a categorical formulation for association rules in information systems. MacCaull developed a tableaux style calculus that is sound and complete for the implication problem for asso...ciation rules. The proof of the completeness required an informational representability result, to go from frames to contexts with 1. To show the completeness for the implication problem for association rules in our categorical framework, we prove an informational representability result in Dedekind categories.show more
|
Export Mendeley
p001