Academic Journals Database
Disseminating quality controlled scientific knowledge

Extracting Co-Occurrence Relations from ZDDs

ADD TO MY LIST
 
Author(s): Takahisa Toda

Journal: Algorithms
ISSN 1999-4893

Volume: 5;
Issue: 4;
Start page: 654;
Date: 2012;
Original page

Keywords: BDD | ZDD | partition | co-occurrence | data mining

ABSTRACT
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.
RPA Switzerland

RPA Switzerland

Robotic process automation

    

Tango Rapperswil
Tango Rapperswil