Abstract
The union of concept lattice is an important research direction in the formal concept analysis, where one vertical union method of concept lattice is given. To improve the efficiency of union, A vertical union algorithm is introduced in the paper. It only needs to compare the intent intersection of two nodes in two sublattices with the intent of the just generated node or the intents of some nodes in some grades from top to bottom. And there are not only fewer comparisons, but also no redundant nodes, which will reduce the complexity of the algorithm. At the same time, Hasse diagram of concept lattice is generated.
| Original language | English |
|---|---|
| Pages (from-to) | 64-70 |
| Number of pages | 7 |
| Journal | Journal of Network Intelligence |
| Volume | 6 |
| Issue number | 1 |
| State | Published - 2021 |
Keywords
- Concept lattice
- Grade
- Intent
- Node
- Vertical uion