%0 Journal Article
%T Extracting Co-Occurrence Relations from ZDDs
%A Takahisa Toda
%J Algorithms
%D 2012
%I MDPI AG
%R 10.3390/a5040654
%X A 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.
%K BDD
%K ZDD
%K partition
%K co-occurrence
%K data mining
%U http://www.mdpi.com/1999-4893/5/4/654