 |
HAL-LIRMM - Open Archive |  |
Conference papers
Hermes: an efficient algorithm for building Galois sub-hierarchies
Abstract : Given a binary relation R on a set O of objects and a set A of attributes, the Galois sub-hierarchy (also called AOC-poset) is the partial order on the introducers of objects and attributes in the corresponding concept lattice. We present a new efficient algorithm for building a Galois sub-hierarchy which runs in O(min{nm, n ^{\alpha}}), where n is the number of objects or attributes, m is the size of the relation, and n ^{\alpha} is the time required to perform matrix multiplication (currently \alpha = 2.376).
Cited literature [23 references]
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00743882
Contributor : Marianne Huchard <>
Submitted on : Sunday, October 21, 2012 - 3:52:56 PM
Last modification on : Wednesday, February 24, 2021 - 4:24:01 PM
Long-term archiving on: : Tuesday, January 22, 2013 - 3:39:06 AM
Contributor : Marianne Huchard <>
Submitted on : Sunday, October 21, 2012 - 3:52:56 PM
Last modification on : Wednesday, February 24, 2021 - 4:24:01 PM
Long-term archiving on: : Tuesday, January 22, 2013 - 3:39:06 AM
File
paperAnneBerry.pdf
Publisher files allowed on an open archive