| 作成者 |
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
trcs208.ps
trcs208