- freely available
Extracting Co-Occurrence Relations from ZDDs
AbstractA zero-suppressed binary decision diagram (ZDD) is a graph representation suitable for handling sparse set families. Given a ZDD representing a set family, we present an efficient algorithm to discover a hidden structure, called a co-occurrence relation, on the ground set. This computation can be done in time complexity that is related not to the number of sets, but to some feature values of the ZDD. We furthermore introduce a conditional co-occurrence relation and present an extraction algorithm, which enables us to discover further structural information.
Share & Cite This Article
Export to BibTeX | EndNote
MDPI and ACS Style
Toda, T. Extracting Co-Occurrence Relations from ZDDs. Algorithms 2012, 5, 654-667.View more citation formats
Toda T. Extracting Co-Occurrence Relations from ZDDs. Algorithms. 2012; 5(4):654-667.Chicago/Turabian Style
Toda, Takahisa. 2012. "Extracting Co-Occurrence Relations from ZDDs." Algorithms 5, no. 4: 654-667.