Next Article in Journal / Special Issue
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability
Previous Article in Journal
Edge Detection from MRI and DTI Images with an Anisotropic Vector Field Flow Using a Divergence Map
Previous Article in Special Issue
Exact Algorithms for Maximum Clique: A Computational Study
Article Menu

Export Article

Open AccessArticle
Algorithms 2012, 5(4), 654-667;

Extracting Co-Occurrence Relations from ZDDs

ERATO, MINATO Discrete Structure Manipulation System Project, JST, Sapporo-Shi 060-0814, Japan
Received: 27 September 2012 / Revised: 4 December 2012 / Accepted: 6 December 2012 / Published: 13 December 2012
(This article belongs to the Special Issue Graph Algorithms)
Full-Text   |   PDF [154 KB, uploaded 13 December 2012]   |  


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. View Full-Text
Keywords: BDD; ZDD; partition; co-occurrence; data mining BDD; ZDD; partition; co-occurrence; data mining

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

Toda, T. Extracting Co-Occurrence Relations from ZDDs. Algorithms 2012, 5, 654-667.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top