Name
Abstract | ||
|---|---|---|
The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-20514-9_6 | international conference on formal concept analysis |
Keywords | DocType | Volume |
lattices,join-semilattice homomorphism,hasse diagram,fca lattice,border algorithms.,distributive lattice,border algorithm,ipred algorithm,hasse diagrams,arbitrary lattice | Conference | abs/1012.0742 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.44 |
References | Authors | |
13 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| José L. Balcázar | 1 | 701 | 62.06 |
| Cristina Tîrnăucă | 2 | 38 | 4.10 |