| 作成者 |
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Formal concept analysis is a mathematical field applied to data mining. Usually, a formal concept is defined as a pair of sets, called extents and intents, for a given formal context in binary relatio...n. In this paper we review the idea that Armstrong’s inference rules are complete and sound for functional dependencies. Then, we prove that Armstrong’s inference rules are complete and sound for implications of formal contexts. Still, we give an example which shows the difference between implication and functional dependency. Besides, we show that functional dependency can be reduced to implication. Finally, we give the condition on which a set of implications and a set of functional dependencies for the intensional context are equivalent.続きを見る
|
Mendeley出力
