Extracting co-occurrence relations from ZDDs (Q1736536)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7042146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extracting co-occurrence relations from ZDDs |
scientific article; zbMATH DE number 7042146 |
Statements
Extracting co-occurrence relations from ZDDs (English)
0 references
26 March 2019
0 references
Summary: 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.
0 references
BDD
0 references
ZDD
0 references
partition
0 references
co-occurrence
0 references
data mining
0 references
0 references
0.786324679851532
0 references
0.7780064940452576
0 references
0.7709872126579285
0 references
0.7659896612167358
0 references
0.7627132534980774
0 references
